Home   >   CSC-OpenAccess Library   >    Manuscript Information
Full Text Available

(516.59KB)
This is an Open Access publication published under CSC-OpenAccess Policy.
Publications from CSC-OpenAccess Library are being accessed from over 74 countries worldwide.
A-Serv: A Novel Architecture Providing Scalable Quality of Service
Yuke Wang, Lie Qian, Alberto Conte, Xiaoyu Song
Pages - 1 - 21     |    Revised - 15-01-2012     |    Published - 21-02-2012
Volume - 4   Issue - 1    |    Publication Date - February 2012  Table of Contents
MORE INFORMATION
KEYWORDS
Network QoS, QoS Architecture, Internet, Packet Format
ABSTRACT
QoS architectures define how routers process packets to ensure QoS service guarantees enforced. Existing QoS architectures such as Integrated Services (IntServ), Differentiated Services (DiffServ), and Dynamic Packet State (DPS) share one common property that the packet structure and the function of the routers are closely connected. Packets of one data flow are treated the same all the time at different routers. We propose to decouple such connection between packet structures and router functions. In our solution, packets carry as much information as possible, while routers process packets as detailed as possible until their load burden prohibits. We call such novel QoS architecture Adaptive Services (A-Serv). A-Serv utilizes our newly designed Load Adaptive Router to provide adaptive QoS to data flows. Treatments to data flows are not predefined but based on the load burden in Load Adaptive Routers. A-Serv overcomes the scalability problem of IntServ, provides better service guarantees to individual data flows than DiffServ and can be deployed incrementally. Our empirical analysis results show that compared with DiffServ architecture, A-Serv can provide differentiated services to data flows in the same DiffServ class and can provide better guaranteed QoS to data flows. Furthermore, A-Serv provides better protection to data flows than DiffServ when malicious data flows exist.
CITED BY (2)  
1 Qi, C., & Cui, S. (2009, January). Providing End-to-End Guaranteed QoS in A-Serv Architecture. In Computer Network and Multimedia Technology, 2009. CNMT 2009. International Symposium on (pp. 1-4). IEEE.
2 Topalova, V. (2006). Functional dependencies and points of intersection between the mechanisms for providing guaranteed QoS. In International Conference on Computer Systems and Technologies-CompSysTech (Vol. 6).
1 Google Scholar 
2 CiteSeerX 
3 Scribd 
4 SlideShare 
5 PdfSR 
1 B. Braden, “Integrated services in Internet architecture - an overview,” Internet RFC-1633,June 1994.
2 S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, and W. Weiss, “An architecture for differential services,” IETF, RFC 2475, December 1998,
3 I. Stoica and H. Zhang, “Providing guaranteed services without per flow management,”Proc. Of ACM SIGCOMM, pp. 81-94, September 1999.
4 R. Braden, L. Zhang, S. Berson, S. Herzog, and S. Jamin, “Resource ReSerVation protocol(RSVP) – version 1 functional specification,” RFC 2205, Internet Engineering Task Force,September 1997.
5 L. Zhang, S. Deering, D. Estrin, S. Shenker, and D. Zappala, “RSVP: a new resource ReSerVation protocol," IEEE Network, September 1993.
6 S. Bradner and A. Mankin, “The recommendation for the IP next generation protocol,” RFC 1752, Internet Engineering Task Force, June 1995.
7 V. Jacobson, K. Nichols, and K. Poduri, “An expedited forwarding PHB,” RFC 2598,Internet Engineering Task Force, June 1999.
8 J. Heinanen, F. Baker, W. Weiss, and J. Wroclawski, “Assured forwarding PHB group,”RFC 2597, Internet Engineering task Force, June 1999.
9 J.C.R. Bennett, K. Benson, A. Charny, W.F. Courtney, and J.Y. Le Boudec, “Delay jitter bounds and packet scale rate guarantee for expedited forwarding,” IEEE/ACM Transactions on Networking, vol. 10, Issue 4, pp. 529-540, August 2002.
10 A. Charny and J.Y. Le Boudec, “Delay bounds in a network with aggregate scheduling,”Proc. Of First International Workshop of QofIS’2000, Berlin, Germany, September, 2000.
11 V. Firoiu, J. -Y. Le Boudec, D. Towsley, Zhi-Li Zhang, “Theories and models for Internet quality of service,” Proc. Of the IEEE, vol. 90, Issue 9, pp. 1565-1591, September 2002.
12 Network Simulator 2 - NS2, http://www-mash.cs.berkeley.edu/ns.
13 “The need for QoS,” Stardust.com. White Paper, July 1999, http://www.qosforum.com
14 D. Ferrari and D. C. Verma, “A scheme for real-time channel establishment in wide-area networks,” IEEE Journal on Selected Areas in Communications, vol. 8, Issue 3, pp. 368-379, April 1990.
15 E. W. Knightly, “H-BIND: a new approach to providing statistical performance guarantees to VBR traffic,” Proc. Of IEEE INFOCOM '96, pp. 1091--1099, March 1996.
16 E. W. Knightly and N. B. Shroff, “Admission control for statistical QoS: theory and practice,”IEEE Network, vol. 13, Issue 2, pp. 20--29, 1999.
17 C. Courcoubetis and R. Weber, “Effective bandwidth for stationary sources,” Prob. Eng.Inf. Sci., vol. 9, 285-294, 1995.
18 R. Guerin, H. Ahmadi, and M. Naghshineh, “Equivalent capacity and its application to bandwidth allocation in high-speed networks,” IEEE Journal on Selected Areas in Communications, vol. 9, Issue 7, September 1991.
19 G. Kesidis, J. Walrand and C. Chang, “Effective bandwidths for multiclass Markov fluids and other ATM sources,” IEEE/ACM Transactions on Networking, vol. 1, pp. 424-428,1993.
20 F. P. Kelly, “Effective bandwidths at multi-class queues,” Queueing Systems, vol. 9, pp. 5-16, 1991.
21 E. W. Knightly and H. Zhang, “D-BIND: an accurate traffic model for providing QoS guarantees to VBR traffic,” IEEE/ACM Transactions on Networking, vol. 5, Issue 2, pp.219-231, April 1997.
22 G. Mao, and D. Habibi, “Loss performance analysis for heterogeneous on-off sources with application to connection admission control,” IEEE/ACM Transactions on Networking, vol.10, Issue 1, pp. 125-138, February 2002.
23 B. Pang, H. Shao, W, Zhu, and W. Gao, “An admission control scheme to provide end-toend statistical QoS provision in IP networks,” 21st IEEE International Performance,Computing, and Communications Conference, pp. 399-403, April 2002.
24 F. P. Kelly, P. B. Key, and S. Zachary, “Distributed admission control,” IEEE Journal on Selected Areas in Communications, vol. 18, Issue 12, pp. 2617-2628, December 2000.
25 L. Breslau, E. Knightly, S. Shenker, I. Stoica, and H. Zhang, “Endpoint admission control:architectural issues and performance,” ACM SIGCOMM Computer Communication Review, vol. 30, Issue 4, 2000.
26 G. Bianchi, F. Borgonovo, A. Capone, L. Fratta, and C. Petrioli, “Endpoint admission control with delay variation measurements for QoS in IP networks,” ACM SIGCOMM Computer Communication Review, vol. 32, Issue 2, April 2002.
27 K. S. Seo, and B. G. Lee, “Measurement-based admission control using maximum burstiness,” IEEE Communications Letters, vol. 6, Issue 9, pp. 403-405, September 2002.
28 J. Qiu and E. W. Knightly, “Measurement-based admission control with aggregate traffic envelopes,” IEEE/ACM Transactions on Networking, vol. 9, no. 2, pp. 199-210, April 2001.
29 L. Breslau, E. W. Knightly, S. Shenker, I. Stoica, and H. Zhang, “Endpoint admission control: architectural issues and performance,” Proc. Of ACM SIGCOMM’00, pp. 57-69,September 2000.
30 R. Gibbens and F. Kelly, “Distributed connection acceptance control for a connectionless network,” Proc. Of ITC’99, June 1999.
31 V. Elek, G. Karlsson, and R. Ronngre, “Admission control based on end-to-end measurements,” Proc. Of IEEE INFOCOM, March 2000.
32 T. Chen, J. Walrand, and D. Messerschmitt, “Dynamic priority protocols for packet voice,”IEEE Journal on Selected Areas in Communications, vol. 7, Issue 5, pp. 632-643, 1989.
33 D. Ferrari and D. Verma, “A scheme for real-time channel establishment in wide-area networks,” IEEE Journal on Selected Areas in Communications, vol. 8, Issue 3, pp. 368-379, April 1990.
34 D. Verma, H. Zhang, and D. Ferrari, “Guaranteeing delay jitter bounds in packet switching networks,” Proc. Of TRICOMM, pp. 35-46, New York, April 1991.
35 D. Clark, S. Shenker, and L. Zhang, “Supporting real-time applications in an integrated services packet network: Architecture and mechanism,” Proc. Of ACM SIGCOMM ’92, pp.14-26, Baltimore, August 1992.
36 A. K. Parekh and R. G. Gallager, “A generalized processor sharing approach to flow control in integrated services networks: the single node case,” IEEE/ACM Transactions on Networking, vol. 1 Issue 3, pp. 344-357, June 1993.
37 A. Demers, S. Keshav, and S. Shenker, “Analysis and simulation of a fair queueing algorithm,” Proc. Of ACM SIGCOMM, pp. 3-12, 1989.
38 M. Andrews, “Probabilistic end-to-end delay bounds for earliest deadline first scheduling,”Proc. IEEE INFOCOM 2000, Tel AVIV, Israel, pp. 603-612, March 2000.
39 M. Andrews and L. Zhang, “Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule,” Proc. Of IEEE INFOCOM 1999, pp. 380-388, New York,March 1999.
40 S. J. Golestani, “A self-clocked fair queueing scheme for broadband applications,” Proc. Of IEEE INFOCOM 1994, vol. 2, pp. 636-646, June 1994.
41 L. Georgiadis, R. Guerin, V. Peris, and K. Sivarajan, “Efficient network QoS provisioning based on per node traffic shaping,” IEEE/ACM Transactions on Networking, vol. 4, Issue 4,pp. 1518-1535, August 1996.
42 L. Zhang, “Virtual clock: A new traffic control algorithm for packet switching networks,”ACM Transactions on Computer Systems, vol. 9, Issue 2, pp. 101-124, May 1991.
43 S. J. Golestani, “Congestion-free communication in high-speed packet networks,” IEEE Transactions on Communications, vol. 39, Issue: 12, pp. 1802-1813, December 1991.
44 H. Sariowan, R. L. Cruz, G. C. Polyzos, “SCED: A generalized scheduling policy for guaranteeing quality of service,” IEEE/ACM Transactions on Networking, vol. 7, Issue 5,pp. 669-684, October 1999.
45 D. Saha, S. Mukherjee, and S. K. Tripathi, “Carry-over round robin: A simple cell scheduling mechanism for ATM networks,” IEEE/ACM Transactions on Networking, vol. 6,Issue 6, pp. 779-796, December 1998.
46 M. Shreedhar and G. Varghese, “Efficient fair queuing using deficit round-robin,”IEEE/ACM Transactions on Networking, vol. 4, Issue 3, pp. 375 - 385, June 1996.
47 H. Zhang, D. Ferrari, “Rate-controlled static-priority queueing,” Proc. Of IEEE INFOCOM 1993, vol. 1, pp. 227-236, March 1993.
48 E. P. Rathgeb, “Modeling and performance comparison of policing mechanisms for ATM networks,” IEEE Journal on Selected Areas in Communications, vol. 9, Issue 3, pp. 325-334, April 1991.
49 J. Turner, “New directions in communications (or which way to the information age),” IEEE Communication Magazine, vol. 24, Issue 10, pp. 8-15, October 1986.
50 M. Salamah, H. Lababidi, “BLLB: a novel traffic policing mechanism for ATM networks,”Proc. Of 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, pp. 411-415, August 2000.
51 M. Salamah, H. Lababidi, “FBLLB: a fuzzy-based traffic policing mechanism for ATM networks,” ACS/IEEE International Conference on Computer Systems and Applications,pp. 31-35, June 2001.
52 Z. Wang and J. Crowcroft, “QoS routing for supporting resource reservation,” IEEE Journal of Selected Areas Communication, vol. 14, pp. 1228-1234, September 1996.
53 H. De Neve and P. Van Mieghem, “TAMCRA: a tunble accuracy multiple constraints routing algorithm,” Computer Communication, vol. 24, pp. 667-679, 2000.
54 W. Xiao, Y. Luo, B. H. Soong, et al. “An efficient heuristic algorithm for multi-constrained path problems,” in Proc. Of VTC2002-Fall, Vancouver, British Columbia, Canada,September 2002.
55 G. Liu and K. G. Ramakrishnan, “A*Prune: an algorithm for finding K sharotest paths subject to multiple constraints,” in Proc. IEEE INFOCOM, vol. 2, 2001, pp. 743-749.
56 S. Chen and K. Nahrstedt, “On finding multi-constrained paths,” in Proc. Of IEEE ICC98,Atlanta, USA, Vol.2, pp. 874-879, June 1998.
57 X. Yuan, “Heuristic algorithms for multiconstrained quality-of-service routing,” IEEE/ACM Transactions on Networking, vol. 10, pp. 244-256, April 2002.
58 L. Guo and I. Matta, “Search space reduction in QoS routing,” in Proc. 19th International Conference of Distributed Computing Systems, III, pp. 142-149, May 1999.
59 R. Hassin, “Approximation schemes for the restricted shortest path problem,” Math.Operation Research, vol. 17, no. 1, pp. 36-42, 1992.
60 A. Juttner, B. Szviatovszki, I. Mecs, and Z. Rajko, “Lagrange relaxation based method for the Qos routing problem,” in Proc. Of IEEE INFOCOM, vol. 2, pp. 859-868, April 2001.
61 D. S. Reeves and H. F. Salama, “A distributed algorithm for delay-constrained unicast routing,” IEEE/ACM Tansactions of Networking, vol. 8, pp. 239-250, April 2000.
62 A. Orda, “Routing with end-to-end QoS guarantees in broadband networks,” IEEE/ACM Transactions of Networking, vol. 7, pp. 365-374, June 1999.
63 C. Dovrolis and P. Ramanathan, “Proportional Differentiated Services, Part II: Loss Rate Differentiation and Packet Dropping,” Proc. IWQoS, 2000, pp. 52-61, 2000.
64 T. Quynh et al., “Relative Jitter Packet Scheduling for Differentiated Services,” Proc. 9th IFIP Conf. Perf. Modeling and Eval. of ATM & IP Networks, 2001.
65 [QA-00-14] S. Bodamer, “A New Scheduling Mechanism to Provide Relative Differentiation for Real-Time IP Traffic,” Proc. GLOBECOM, 2000, vol. 1,pp. 646-650, 2000.
66 C. Dovrolis, D. Stiliadis, and P. Ramanathan, “Proportional Differentiated Services: Delay Differentiation and Packet Scheduling,” ACM SIGCOMM, September 1999.
67 C. L. Lee, J. R. Chen, and Y. C. Chen, “A scalable architecture for differentiated services,”Proc. Of 22nd International Conference on Distributed Computing Systems Workshops,2002, pp. 311-316, 2-5 July 2002.
68 J. C. R. Bennett and H. Zhang, “Hierarchical packet fair queueing algorithms,” IEEE/ACM Transactions on Networking, vol. 5, Issue 5, pp.675-689, October, 1997.
Associate Professor Yuke Wang
- United States of America
yuke@utdallas.edu
Associate Professor Lie Qian
Southeastern Oklahoma State University - United States of America
Mr. Alberto Conte
- France
Professor Xiaoyu Song
- United States of America