Creating replicas of frequently accessed objects across a read-intensive network can result in large bandwidth savings which, in turn, can lead to reduction in user response time....
This paper proposes a set of novel distributed algorithms on top of m-D irregular mesh overlay to achieve the short delay and low network resource consumption end host multicast s...
Abstract--It was shown recently that carrier sense multiple access (CSMA)-like distributed algorithms can achieve the maximal throughput in wireless networks (and task processing n...
In this paper, we study the NP-hard delay-constrained least-cost path problem. A solution to this problem is needed to provide real-time communication service to connection-orient...
Hussein F. Salama, Douglas S. Reeves, Yannis Vinio...
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...