The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (2009 vol.58)
pp: 591-604
Lefteris Mamatas , University College London, London
Vassilis Tsaoussidis , Democritus University of Thrace, Xanthi
ABSTRACT
We discuss a new packet service paradigm, called "Less Impact Better Service” (LIBS), which is realized through a novel queuing discipline, called "Noncongestive Queuing” (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.
INDEX TERMS
Service differentiation, packet scheduling, QoS.
CITATION
Lefteris Mamatas, Vassilis Tsaoussidis, "Differentiating Services with Noncongestive Queuing (NCQ)", IEEE Transactions on Computers, vol.58, no. 5, pp. 591-604, May 2009, doi:10.1109/TC.2008.197
REFERENCES
[1] F.M. Anjum and L. Tassiulas, “Fair Bandwidth Sharing among Adaptive and Non-Adaptive Flows in the Internet,” Proc. IEEE INFOCOM '99, Mar. 1999.
[2] D. Bertsekas and R. Gallager, Data Networks, seconded. Prentice-Hall, 1991
[3] S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, and W. Weiss, An Architecture for Differentiated Service, RFC 2475, 1998.
[4] R. Braden, D. Clark, and S. Shenker, Integrated Services in the Internet Architecture: An Overview, RFC 1633, June 1994.
[5] P. Brady, “A Statistical Analysis of On-Off Patterns in 16Conversations,” The Bell System Technical J., vol. 47, pp.73-91, Jan. 1968.
[6] D. Chiu and R. Jain, “Analysis of the Increase/Decrease Algorithms for Congestion Avoidance in Computer Networks,” J. Computer Networks and ISDN, vol. 17, no. 1, pp. 1-14, June 1989.
[7] M. Claypool, R. Kinicki, and A. Kumar, “Traffic Sensitive Active Queue Management,” Proc. Eighth IEEE Global Internet Symp., Mar. 2005.
[8] R. Cole and J. Rosenbluth, “Voice over IP Performance Monitoring,” ACM SIGCOMM Computer Comm. Rev., vol. 31, no. 2, pp. 9-24, Apr. 2001.
[9] T.D. Dang, B. Sonkoly, and S. Molnar, “Fractal Analysis and Modeling of VoIP Traffic,” Proc. 11th Int'l Telecomm. Network Strategy and Planning Symp. (NETWORKS '04), June 2004.
[10] G. de Veciana, T. Konstantopoulos, and T.-J. Lee, “Stability and Performance Analysis of Networks Supporting Elastic Services,” IEEE/ACM Trans. Networking, vol. 9, no. 1, pp. 2-14, 2001.
[11] I. Downard, “Simulating Sensor Networks in NS-2,” Technical Report NRL/FR/5522-04-10073, Naval Research Laboratory, May 2004.
[12] J. Elson and D. Estrin, “Random, Ephemeral Transaction Identifiers in Dynamic Sensor Networks,” Proc. 21st Int'l Conf. Distributed Computing Systems (ICDCS '01), pp. 459-468, Apr. 2001.
[13] W. Feng, D. Kandlur, D. Saha, and K.G. Shin, “BLUE: A New Class of Active Queue Management Algorithms,” Technical Report CSE-TR-387-99, Univ. of Michigan, Apr. 1999.
[14] S. Floyd and K. Fall, “Promoting the Use of End-to-End Congestion Control in the Internet,” IEEE/ACM Trans. Networking, vol. 7, no. 4, pp. 458-472, 1999.
[15] S. Floyd and V. Jacobson, “Random Early Detection Gateways for Congestion Avoidance,” IEEE/ACM Trans. Networking, vol. 1, no. 4, pp. 397-413, Aug. 1993.
[16] S. Fred, T. Bonald, A. Proutiere, G. Régnié, and J. Roberts, “Statistical Bandwidth Sharing: A Study of Congestion at Flow Level,” Proc. ACM SIGCOMM '01, vol. 31, no. 4, pp. 111-122, 2001.
[17] X. He, C. Papadopoulos, and P. Radoslavov, “A Framework for Incremental Deployment Strategies for Router-Assisted Services,” Proc. IEEE INFOCOM '03, vol. 2, pp. 1488-1498, 2003.
[18] P. Hurley, J. Boudec, P. Thiran, and M. Kara, “ABE: Providing a Low-Delay Service within Best-Effort,” IEEE Network, vol. 15, no. 3, pp. 60-69, 2001.
[19] The E-Model, a Computational Model for Use in Transmission Planning, ITU-T Recommendation G.107, Dec. 1998.
[20] General Characteristics of General Telephone Connections and Telephone Circuits—Transmission Impairments, ITU-T Recommendation G.113, Feb. 1996.
[21] Pulse Code Modulation (PCM) of Voice Frequencies, ITU-T Recommendation G.711, Nov. 1988.
[22] A. Kherani and A. Kumar, “Performance Analysis of TCP with Non-Persistent Sessions,” Proc. Workshop Modeling of Flow and Congestion Control, Sept. 2000.
[23] D. Lin and R. Morris, “Dynamics of Random Early Detection,” Proc. ACM SIGCOMM '97, pp. 127-137, Sept. 1997.
[24] L. Mamatas and V. Tsaoussidis, “Protocol Behavior and Energy-Saving Potential,” Proc. Sixth Int'l Workshop Wireless Local Networks (WLN '06), Nov. 2006.
[25] L. Mamatas and V. Tsaoussidis, “Less Impact Better Service (LIBS): A Service Paradigm for Internet Telephony,” Technical Report TR-DUTH-EE-2007-16, Democritus Univ. of Thrace, Nov. 2007.
[26] R. Mahajan, S. Floyd, and D. Wetherall, “Controlling High-Bandwidth Flows at the Congested Router,” Proc. Ninth Int'l Conf. Network Protocols (ICNP '01), Nov. 2001.
[27] L. Mamatas and V. Tsaoussidis, “A New Approach to Service Differentiation: Non-Congestive Queuing,” Proc. ICST First Int'l Workshop Convergence of Heterogeneous Wireless Networks (CONWIN'06), July 2006.
[28] L. Mamatas and V. Tsaoussidis, “Differentiating Services for Sensor Internetworking,” Proc. IFIP Fifth Ann. Mediterranean AdHoc Networking Workshop (Med-Hoc-Net '07), June 2007.
[29] M. Marsan and M. Gerla, “Fairness in Local Computing Networks,” Proc. IEEE Int'l Conf. Comm. (ICC '02), June 1982.
[30] L. Massoulié and J. Roberts, “Bandwidth Sharing and Admission Control for Elastic Traffic,” Telecomm. Systems, vol. 15, no. 1, pp. 185-201, 2000.
[31] S. McCanne and S. Floyd NS-2 Network Simulator, http://www.isi.edu/nsnamns/, 1997.
[32] T.J. Ott, T.V. Lakshman, and L.H. Wong, “SRED: Stabilized RED,” Proc. IEEE INFOCOM '99, vol. 3, pp. 1346-1355, 1999.
[33] R. Pan, L. Breslau, B. Prabhakar, and S. Shenker, “Approximate Fairness through Differential Dropping,” ACM SIGCOMM Computer Comm. Rev., vol. 33, no. 2, pp. 23-39, Apr. 2003.
[34] R. Pan, B. Prabhakar, and K. Psounis, “CHOKe—A Stateless Queue Management Scheme for Approximating Fair Bandwidth Allocation,” Proc. IEEE INFOCOM '00, Mar. 2000.
[35] C. Perkins, E. Belding-Royer, and S. Das, “RFC3561: Ad Hoc On-Demand Distance Vector (AODV) Routing,” Internet RFCs, 2003.
[36] A. Rangarajan, “Early Regulation of Unresponsive Flows,” Technical Report TRCS99-26, Univ. of California at Santa Barbara, July 1999.
[37] H. Sabbineni and K. Chakrabarty, “Location-Aided Flooding: An Energy-Efficient Data Dissemination Protocol for Wireless Sensor Networks,” IEEE Trans. Computers, vol. 54, no. 1, pp. 36-46, Jan. 2005.
[38] I. Stoica, S. Shenker, and H. Zhang, “Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks,” Proc. ACM SIGCOMM '98, pp. 118-130, 1998.
[39] D. Vardalis and V. Tsaoussidis, “On the Efficiency and Fairness of Congestion Control Mechanisms in Wired and Wireless Networks,” The J. Supercomputing, 2002.
[40] Y. Zhang, W. Liu, and Y. Fang, “Secure Localization in Wireless Sensor Networks,” Proc. IEEE Military Comm. Conf. (MILCOM '05), vol. 5, pp. 3169-3175, Oct. 2005.
12 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool