A constant-time method for TCP/IP socket I/O multiplexing
by Jianli Sun
International Journal of Critical Computer-Based Systems (IJCCBS), Vol. 2, No. 1, 2011

Abstract: For a given large number of N communication channels or sockets, the major challenge with I/O multiplexing is to frequently find out which R channels are ready for input and output. The computational cost of I/O multiplexing is high, and it is directly proportional to N. This paper presents an innovative method to complete TCP/IP multiplexing functionality for any number of N sockets in a small constant time.

Online publication date: Wed, 11-Mar-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Critical Computer-Based Systems (IJCCBS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com