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 describes a novel, ultra-fast heuristic algorithm to address an NP-hard optimization problem. One of its significances is that, for the first time, the paper shows...
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...
— Adaptive network coded cooperation (ANCC) has been proposed as an effective scheme to combine network and channel coding for cooperative wireless networks by matching network-o...
Abstract— In time varying packet-switched networks, delivering data with high reliability using a limited amount of network resources is highly desirable. To capture the trade-of...
Oscar Flardh, Carlo Fischione, Karl Henrik Johanss...