Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Evaluation of a new end-to-end quality of service algorithm in differentiated services networks

Evaluation of a new end-to-end quality of service algorithm in differentiated services networks

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© The Institution of Engineering and Technology
Published

A new end-point admission control algorithm is proposed. The proposed algorithm helps to manage the network traffic within a domain more efficiently in the next generation network where multiple classes of service are required by different applications. In the existing solutions, when a request for a new traffic is received by the network, according to the admission control mechanism the availability of resources for the requested service class is examined and the call is accepted if the resources are available. In the proposed algorithm, users' are allowed to temporarily use lower service classes in the routers along the path, whenever the requested service class is not available, given that the end-to-end service quality level is preserved unless a lower service quality is acceptable by the application. The probe-based end-point admission control mechanism proposed here, dynamically manages the available bandwidth. In this way more calls can be admitted and the utilisation of the network is increased.

Inspec keywords: DiffServ networks; telecommunication traffic; quality of service; telecommunication congestion control

Other keywords: end-to-end quality of service algorithm; differentiated services network; end-point admission control algorithm; network traffic; probe-based end-point admission control

Subjects: Other computer networks; Communication network design, planning and routing; Computer communications

References

    1. 1)
      • Georgoulas, S., Trimintzios, P., Pavlou, G.: `Joint measurement and traffic descriptor-based admission control at real-time traffic aggregation points', IEEE Int. Conf. on Communications, June 2004, 4, p. 1841–1845.
    2. 2)
      • Nichols, K., Jacobson, V., Zhang, L.: `A two-bit differentiated services architecture for the Internet', IETF RFC 2638, July 1999.
    3. 3)
      • Bakiras, S., Li, V.O.K.: `Efficient resource management for end-to-end QoS guarantees in DiffServ networks', IEEE ICC2002, 2, p. 1220–1224.
    4. 4)
      • M. Grossglauser , D.: Tse . A time-scale decomposition approach to measurement-based admission control. IEEE/ACM Trans. Netw. , 4 , 550 - 563
    5. 5)
      • Zhang, J., Hu, H., Chen, M., Mo, Y.: `QoS routing in IPV6 with link-utilization-ratio single metric', Int. Conf. on Wireless Communications, Networking and Mobile, 2006, p. 1–5.
    6. 6)
      • Blake, S., Black, D., Calson, M., Davies, E., Wang, Z., Weiss, W.: `An architecture for differentiated services', IETF RFC 475, December 1998.
    7. 7)
      • Bianchi, G., Blefari-Melazzi, N.: `Admission control over assured forwarding PHBs: a way to provide service accuracy in a DiffServ framework', IEEE Globecom'01, November 2001, p. 25–29.
    8. 8)
      • S.H. Lim , M.H. Yaacob , K.K. Phang , T.C. Ling . Traffic engineering enhancement to QoS-OSPF in DiffServ and MPLS networks. IEE Proc. Commun. , 1 , 101 - 106
    9. 9)
      • J. Yang , J. Ye , S. Papavassiliou . Enhancing end-to-end QoS granularity in Diffserv networks via service vector and explicit endpoint admission control. IEE Proc. Commun. , 1 , 77 - 81
    10. 10)
      • EI-Haddadeh, R., Taylor, G.A., Watts, S.J.: `Towards scalable end-to-end QoS provision for VoIP applications', IEE Telecommunications Quality of Services: The Business of Success 2004, QoS 2004, March 2004, p. 132–135.
    11. 11)
      • A.J. Ganesh , P.B. Key , D. Polis , R. Srikant . Congestion notification and probing mechanisms for endpoint admission control. IEEE/ACM Trans. Netw. , 3 , 568 - 578
    12. 12)
      • A.K. Parekh , R.G. Gallager . A generalized processor sharing approach to flow control in integrated services networks: the single-node case. IEEE/ACM Trans. Netw. , 3 , 344 - 357
    13. 13)
      • Allali, H.E., Lo, A., Niemegeers, I.: `A robust measurement-based admission control for resource management in DiffServ IP networks', ICCS, October 2006, p. 1–5.
    14. 14)
      • ITU-T Rec. Y.2001: ‘General overview of NGN’, 2004.
    15. 15)
      • I. Stoica , S. Shenker , H. Zhang . Core-stateless fair queuing: a scalable architecture to approximate fair bandwidth allocations in high-speed networks. IEEE/ACM Trans. Netw. , 1 , 33 - 46
    16. 16)
      • R. Van Slyke . (2001) Network planning and design.
    17. 17)
      • S. Floyd , V. Jacobson . Random early detection for congestion avoidance. IEEE/ACM Trans. Netw. , 397 - 413
    18. 18)
      • Bernet, Y., Ford, P., Yavatkar, R.: `A framework for integrated services operation over DiffServ networks', RFC 2998, November 2000.
    19. 19)
      • A.C. Odinma , L.O. Borkhale . Quality of service mechanisms and challenges for IP networks. Pacific J. Sci. Technol. , 1 , 10 - 16
    20. 20)
      • Narvaez, P., Siu, K.Y.: `Efficient algorithms for multi-path link state routing', ISCOM'99, 1999, Kaohsiung, Taiwan.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com.2009.0433
Loading

Related content

content/journals/10.1049/iet-com.2009.0433
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address