No 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.

No abstract

An autonomous decentralized system and a series of methods for reducing the detection time of path failures in the system are developed. Computing devices in the proposed system are organized into at least three groups based on their connectivity of system's graph model. Each computing device is assigned three identification values associated with their group memberships. The identification values are stored in a router connected to the communications network. Heartbeat packets are sent from the computing devices to the router periodically. If the router fails to receive a heartbeat packet from a computing device, a failed communication path from the router to the computing device is determined based on the three identification values.