Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Altman, E., Ayesta, U., Prabhu, B.: Load balancing in processor sharing systems. In: Proceedings of the Second International Workshop on Game Theory in Communication Networks 2008, GameComm 2008, Athens Greece, October 20. HAL - CCSD (2008)
Baccelli, F., Massey, W.A., Towsley, D.: Acyclic fork-join queuing networks. Journal of the ACM 36(3), 615–642 (1989)
Borst, S., Núnez-Queija, R., Zwart, B.: Sojourn time asymptotics in processor-sharing queues. Queueing Systems: Theory and Applications 53(1-2), 31–51 (2006)
Borst, S.C., Boxma, O.J., Hegde, N.: Sojourn times in finite-capacity processor-sharing queues. In: Proceedings NGI 2005 Conference (2005)
Boxma, O., Zwart, B.: Tails in scheduling. SIGMETRICS Performance Evaluation Review 34(4), 13–20 (2007)
Chandra, R., Bahl, P., Bahl, P.: Multinet: Connecting to multiple IEEE 802.11 networks using a single wireless card. In: Proceedings of IEEE INFOCOM (2004)
Cox, D.: Fundamental limitations on the data rate in wireless systems. IEEE Communications Magazine 46(12), 16–17 (2008)
IEEE Unapproved Draft Std P802.11n D3.00. Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY), amendment 4: Enhancements for higher throughput (September 2007)
Duncanson, J.: Inverse multiplexing. IEEE Communications Magazine 32(4), 34–41 (1994)
Federal Communications Commission Spectrum Policy Task Force. Report of the spectrum efficiency working group. Technical report, FCC-Federal Communications Commission (November 2002)
Gkantsidis, C., Ammar, M., Zegura, E.: On the effect of large-scale deployment of parallel downloading. In: WIAPP 2003: Proceedings of the The Third IEEE Workshop on Internet Applications, Washington, DC, USA, p. 79. IEEE Computer Society, Los Alamitos (2003)
Guillemin, F., Robert, P., Zwart, A.P.: Tail asymptotics for processor sharing queues. Advances in Applied Probability 36, 525–543 (2004)
Gupta, V., Harchol Balter, M., Sigman, K., Whitt, W.: Analysis of join-the-shortest-queue routing for web server farms. Performance Evaluation 64(9-12), 1062–1081 (2007)
Hasegawa, Y., Yamaguchi, I., Hama, T., Shimonishi, H., Murase, T.: Deployable multipath communication scheme with sufficient performance data distribution method. Computer Communications 30(17), 3285–3292 (2007)
Hoekstra, G.J., Panken, F.J.M.: Increasing throughput of data applications on heterogeneous wireless access networks. In: Proceedings 12th IEEE Symposium on Communication and Vehicular Technology in the Benelux (2005)
Hoekstra, G.J., van der Mei, R.D.: On the processor sharing of file transfers in wireless lans. In: Proceedings of the 69th IEEE Vehicular Technology Conference, VTC Spring 2009, Barcelona, Spain, April 26-29. IEEE, Los Alamitos (2009)
Hsieh, H.Y., Sivakumar, R.: A transport layer approach for achieving aggregate bandwidths on multi-homed mobile hosts. In: MobiCom 2002: Proceedings of the 8th annual international conference on Mobile computing and networking, pp. 83–94. ACM, New York (2002)
Kleinrock, L.: Time-shared systems: a theoretical treatment. Journal of the ACM 14(2), 242–261 (1967)
Koudouris, G.P., Agero, R., Alexandri, E., Choque, J., Dimou, K., Karimi, H.R., Lederer, H., Sachs, J., Sigle, R.: Generic link layer functionality for multi-radio access networks. In: Proceedings 14th IST Mobile and Wireless Communications Summit (2005)
Lelarge, M.: Packet reordering in networks with heavy-tailed delays. Mathematical Methods of Operations Research 67(2), 341–371 (2008)
Lelarge, M.: Tail asymptotics for discrete event systems. Discrete Event Dynamic Systems 18(4), 563–584 (2008)
Litjens, R., Roijers, F., Van den Berg, J.L., Boucherie, R.J., Fleuren, M.J.: Performance analysis of wireless LANs: An integrated packet/flow level approach. In: Proceedings of the 18th International Teletraffic Congress - ITC18, Berlin, Germany, pp. 931–940 (2003)
Rodriguez, P., Kirpal, A., Biersack, E.: Parallel-access for mirror sites in the internet. In: INFOCOM, pp. 864–873 (2000)
Wu, Y., Williamson, C., Luo, J.: On processor sharing and its applications to cellular data network provisioning. Performance Evaluation 64(9-12), 892–908 (2007)
Zwart, A.P.: Sojourn times in a multiclass processor sharing queue. In: Key, P., Smith, D. (eds.) Proceedings of the 16th International Teletraffic Congress - ITC16, Edinburgh, UK, pp. 335–344. North-Holland, Amsterdam (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hoekstra, G., van der Mei, R., Nazarathy, Y., Zwart, B. (2009). Optimal File Splitting for Wireless Networks with Concurrent Access. In: Núñez-Queija, R., Resing, J. (eds) Network Control and Optimization. NET-COOP 2009. Lecture Notes in Computer Science, vol 5894. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10406-0_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-10406-0_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10405-3
Online ISBN: 978-3-642-10406-0
eBook Packages: Computer ScienceComputer Science (R0)