Acyclic fork-join queuing networks
Journal of the ACM (JACM)
Time-shared Systems: a theoretical treatment
Journal of the ACM (JACM)
A transport layer approach for achieving aggregate bandwidths on multi-homed mobile hosts
Proceedings of the 8th annual international conference on Mobile computing and networking
On the Effect of Large-Scale Deployment of Parallel Downloading
WIAPP '03 Proceedings of the The Third IEEE Workshop on Internet Applications
Sojourn time asymptotics in processor-sharing queues
Queueing Systems: Theory and Applications
ACM SIGMETRICS Performance Evaluation Review
On processor sharing and its applications to cellular data network provisioning
Performance Evaluation
Analysis of join-the-shortest-queue routing for web server farms
Performance Evaluation
Deployable multipath communication scheme with sufficient performance data distribution method
Computer Communications
Tail Asymptotics for Discrete Event Systems
Discrete Event Dynamic Systems
Load balancing in processor sharing systems
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Fundamental limitations on increasing data rate in wireless systems
IEEE Communications Magazine
| Hi-index | 0.00 |
The fundamental limits on channel capacity form a barrier to the sustained growth on the use of wireless networks. To cope with this, multi-path communication solutions provide a promising means to improve reliability and boost Quality of Service (QoS) in areas that are covered by a multitude of wireless access networks. Today, little is known about how to effectively exploit this potential. Motivated by this, we consider N parallel communication networks, each of which is modeled as a processor sharing (PS) queue that handles two types of traffic: foreground and background. We consider a foreground traffic stream of files, each of which is split into N fragments according to a fixed splitting rule (*** 1 ,...,*** N ), where *** *** i = 1 and *** i *** 0 is the fraction of the file that is directed to network i . Upon completion of transmission of all fragments of a file, it is re-assembled at the receiving end. The background streams use dedicated networks without being split. We study the sojourn time tail behavior of the foreground traffic. For the case of light foreground traffic and regularly varying foreground file-size distributions, we obtain a reduced-load approximation (RLA) for the sojourn times, similar to that of a single PS-queue. An important implication of the RLA is that the tail-optimal splitting rule is simply to choose *** i proportional to c i *** ρ i , where c i is the capacity of network i and ρ i is the load offered to network i by the corresponding background stream. This result provides a theoretical foundation for the effectiveness of such a simple splitting rule. Extensive simulations demonstrate that this simple rule indeed performs well, not only with respect to the tail asymptotics, but also with respect to the mean sojourn times. The simulations further support our conjecture that the same splitting rule is also tail-optimal for non-light foreground traffic. Finally, we observe near-insensitivity of the mean sojourn times with respect to the file-size distribution.