Programmable Device Circuits and Systems

Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

Network Constancy in Allocating the Resource with Multiple Connections


Affiliations
1 Department of Computer Science, Rathinam College of Arts and Science, Coimbatore, India
     

   Subscribe/Renew Journal


Network resource allocation controls the number of different routes, where each connection is subject to congestion control. A cooperative users control the number of active connections based on congestion prices from the transport layer to emulate primal-dual dynamics in the aggregate rate. This achieves user-centric allocation. In non-cooperative users, the network stability and user-centric fairness can be enforced at the network edge. The issues in stability and fairness can be studied when routing of incoming connection is enabled at the edge router. The stability region can be obtained which can be served with routing alone and a generalization of admission control policy to ensure user-centric fairness when the stability condition is not met.


Keywords

Primal-Dual, User-Centric, Stability, Fairness.
User
Subscription Login to verify subscription
Notifications
Font Size

  • Andres Ferragut and Fernando Paganini, Senior Member, IEEE “Network Resource Allocation for Users With Multiple Connections: Fairness and Stability” Manuscript received April 13, 2012; revised December 28, 2012; accepted February 16, 2013; approved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor A. Proutiere.

  • T. J. Hacker, B. D. Athey, and B. Noble, “The end-to-end performance effects of parallel TCP sockets on a lossy wide-area network,” in Proc.16th IPDPS, Apr. 2002.

  • F. Kelly, A.Maulloo, and D. Tan, “Rate control in communication networks: Shadow prices, proportional fairness and stability,” J. Oper.Res. Soc., vol. 39, pp. 237–252, 1998.

  • P. Key, L. Massoulié, and D. Towsley, “Path selection and multipath congestion control,” in Proc. IEEE INFOCOM, Mar. 2007, pp. 143–151.

  • P. Key and L. Massoulié, “Fluid models of integrated traffic and multipath routing,” Queueing Syst., vol. 53, no. 1–2, pp. 85–98, 2006.

  • F. Kelly, P. Key, and S. Zachary, “Distributed admission control,” IEEE J. Sel. Areas Commun., vol. 18, no. 12, pp. 2617–2628, Dec.2000.

  • L. Massoulie and J. Roberts, “Arguments in favour of admission control of TCP flows,” in Proc. Int. Teletraffic Conf. 16, Jun. 1999, pp.33–44.

  • D. Feijer and F. Paganini, “Stability of primal-dual gradient dynamics and applications to network optimization,” Automatica, vol. 46, no. 12, pp. 1974–1981, 2010.

  • A. Ferragut and F. Paganini, “Achieving network stability and user fairness through admission control of TCP connections,” in Proc. Conf.Inf. Sci. Syst., 2008, pp. 1195–1200.

  • A. Ferragut and F. Paganini, “User-centric network fairness through connection-level control,” in Proc. IEEE INFOCOM, 2010, pp. 1–5.

  • D.Wischik, C. Raiciu, A. Greenhalgh, and M. Handley, “Design, implementation and evaluation of congestion control for multipath TCP,” in Proc. USENIX NSDI, Mar. 2011, p. 8.

  • H. Zhang, D. F. Towsley, and W. Gong, “TCP connection game: A study on the selfish behavior of TCP users,” in Proc. ICNP, 2005, pp. 301–310.

  • R. D. Foley and D. R.McDonald, “Join the shortest queue: Stability and exact asymptotics,” Ann. Appl. Probab., vol. 11, no. 3, pp. 569–607, 2001.

  • X. Lin, N. Shroff, and R. Srikant, “On the connection-level stability of congestion-controlled communication networks,” IEEE Trans. Inf. Theory, vol. 54, no. 5, pp. 2317–2338, May 2007.

  • L. Massoulie, “Structural properties of proportional fairness: Stability and insensitivity,” Ann. Appl. Probab., vol. 17, no. 3, pp. 809–839, 2007.

  • F. Paganini, K. Tang, A. Ferragut, and L. Andrew, “Stability of networks under general file size distribution and alpha fair bandwidth allocation,” IEEE Trans. Autom. Control, vol. 57, no. 3, pp. 579–591, Mar. 2012.

  • J. Padhye, V. Firoiu, D. Towsley, and J. Kurose, “Modeling TCP throughput: A simple model and its empirical validation,” Comput. Commun. Rev., vol. 28, no. 4, pp. 303–314, 1998.

  • R. Srikant, The Mathematics of Internet Congestion Control. Boston, MA, USA: Birkhäuser, 2004.

  • H. Han, S. Shakkotai, C. Hollot, R. Srikant, and D. Towsley, “Multipath TCP: A joint congestion control and routing scheme to exploit path diversity in the internet,” IEEE/ACM Trans. Netw., vol. 14, no. 6, pp. 1260–1271, Dec. 2006.

  • F. Kelly and T. Voice, “Stability of end-to-end algorithms for joint routing and rate control,” Comput. Commun. Rev., vol. 35, no. 2, pp. 5–12, 2005.


Abstract Views: 175

PDF Views: 4




  • Network Constancy in Allocating the Resource with Multiple Connections

Abstract Views: 175  |  PDF Views: 4

Authors

K. Renuka
Department of Computer Science, Rathinam College of Arts and Science, Coimbatore, India

Abstract


Network resource allocation controls the number of different routes, where each connection is subject to congestion control. A cooperative users control the number of active connections based on congestion prices from the transport layer to emulate primal-dual dynamics in the aggregate rate. This achieves user-centric allocation. In non-cooperative users, the network stability and user-centric fairness can be enforced at the network edge. The issues in stability and fairness can be studied when routing of incoming connection is enabled at the edge router. The stability region can be obtained which can be served with routing alone and a generalization of admission control policy to ensure user-centric fairness when the stability condition is not met.


Keywords


Primal-Dual, User-Centric, Stability, Fairness.

References