Differentiating Services with Noncongestive Queuing (NCQ)

We discuss a new packet service paradigm, called "Less Impact Better Servicerdquo (LIBS), which is realized through a novel queuing discipline, called "noncongestive queuingrdquo (NCQ). NCQ prioritizes small packets when conditions permit and utilizes service thresholds to confine the delay impact of prioritization on congestive applications. We show that LIBS and NCQ satisfy more users with diverse demands on delay and throughput. We obtained both analytical and simulation results, which are very promising. Diversity is simulated by using FTP, sensor, and VoIP traffic.

[1]  Ratul Mahajan,et al.  Controlling high-bandwidth flows at the congested router , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[2]  Konstantinos Psounis,et al.  CHOKe - a stateless active queue management scheme for approximating fair bandwidth allocation , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[3]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[4]  Krishnendu Chakrabarty,et al.  Location-aided flooding: an energy-efficient data dissemination protocol for wireless-sensor networks , 2005, IEEE Transactions on Computers.

[5]  T. V. Lakshman,et al.  SRED: stabilized RED , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[6]  Scott Shenker,et al.  Core-stateless fair queueing: a scalable architecture to approximate fair bandwidth allocations in high-speed networks , 2003, TNET.

[7]  Thomas Bonald,et al.  Statistical bandwidth sharing: a study of congestion at flow level , 2001, SIGCOMM.

[8]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .

[9]  Vassilis Tsaoussidis,et al.  Efficiency/Fairness Tradeoffs in Networks with Wireless Components and Transient Congestion , 2002, The Journal of Supercomputing.

[10]  Albert Y. Zomaya,et al.  Secure localization in wireless sensor networks , 2007 .

[11]  Mark Claypool,et al.  Traffic sensitive active queue management , 2005, INFOCOM.

[12]  Deborah Estrin,et al.  Random, Ephemeral Transaction Identifiers in dynamic sensor networks , 2001, Proceedings 21st International Conference on Distributed Computing Systems.

[13]  Vassilis Tsaoussidis,et al.  Differentiating Services for Sensor Internetworking , 2008 .

[14]  ZhangHui,et al.  Core-stateless fair queueing , 1998 .

[15]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[16]  Raj Jain,et al.  Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks , 1989, Comput. Networks.

[17]  Vassilis Tsaoussidis,et al.  Transport Protocol Behavior and Energy-Saving Potential , 2006, Proceedings. 2006 31st IEEE Conference on Local Computer Networks.

[18]  Wu-chang Fengy,et al.  BLUE: A New Class of Active Queue Management Algorithms , 1999 .

[19]  Scott Shenker,et al.  Integrated Services in the Internet Architecture : an Overview Status of this Memo , 1994 .

[20]  Leandros Tassiulas,et al.  Fair bandwidth sharing among adaptive and non-adaptive flows in the Internet , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[21]  Yuguang Fang,et al.  Secure localization in wireless sensor networks , 2005, MILCOM 2005 - 2005 IEEE Military Communications Conference.

[22]  Trang Dinh Dang,et al.  Fractal analysis and modeling of VoIP traffic , 2004, 11th International Telecommunications Network Strategy and Planning Symposium. NETWORKS 2004,.

[23]  Patrick Thiran,et al.  ABE: providing a low-delay service within best effort , 2001 .

[24]  Laurent Massoulié,et al.  Bandwidth sharing and admission control for elastic traffic , 2000, Telecommun. Syst..

[25]  Pavlin Radoslavov,et al.  A framework for incremental deployment strategies for router-assisted services , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[26]  Gustavo de Veciana,et al.  Stability and performance analysis of networks supporting elastic services , 2001, TNET.

[27]  Anand Rangarajan.  Early Regulation of Unresponsive Flows , 1999 .

[28]  FredS. Ben,et al.  Statistical bandwidth sharing , 2001 .

[29]  Scott Shenker,et al.  Approximate fairness through differential dropping , 2003, CCRV.

[30]  V. Tsaoussidis,et al.  A new approach to Service Differentiation : Non-Congestive , 2005 .

[31]  Anurag Kumar,et al.  Performance Analysis of TCP with Nonpersistent Sessions , 2007 .

[32]  Robert G. Cole,et al.  Voice over IP performance monitoring , 2001, CCRV.

[33]  Scott Shenker,et al.  Core-stateless fair queueing: achieving approximately fair bandwidth allocations in high speed networks , 1998, SIGCOMM '98.

[34]  Sally Floyd,et al.  Promoting the use of end-to-end congestion control in the Internet , 1999, TNET.

[35]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[36]  Vassilis Tsaoussidis,et al.  Less Impact Better Service (LIBS) , 2010, Ann. des Télécommunications.

[37]  Robert Tappan Morris,et al.  Dynamics of random early detection , 1997, SIGCOMM '97.

[38]  Ian T. Downard,et al.  Simulating Sensor Networks in NS-2 , 2004 .

[39]  Paul T. Brady,et al.  A statistical analysis of on-off patterns in 16 conversations , 1968 .