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

Localised credit based QoS routing

Localised credit based QoS routing

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:
 
 
 
 
 
IEE Proceedings - Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© The Institution of Engineering and Technology
Published

Localised quality of service (QoS) routing has recently been proposed as a viable alternative approach to traditional QoS routing algorithms that use global state information. In this approach, problems associated with maintaining global state information are avoided by having the source nodes to infer the network QoS state based on flow blocking statistics collected locally, and perform flow routing using this localised view of the network QoS state. A credit based routing algorithm (CBR) which is a simple yet effective localised QoS routing algorithm is introduced. Its performance is compared against the localised proportional sticky routing (PSR) algorithm using different types of network topologies, QoS requirements and traffic patterns and under a wide range of traffic loads. Extensive simulations show that the algorithm outperforms the PSR scheme while maintaining the same level of adaptivity and stability. Its performance is also compared against the global widest-shortest path algorithm (WSP) and it is shown that CBR gives a comparable performance with better time complexity and very low communication overhead.

References

    1. 1)
      • Kweon, S.K., Shin, K.G.: `Distributed QoS routing using bounded flooding', Report CSE-TR388-99, University of Michigan, 1999.
    2. 2)
      • R.J. Gibbens , F.P. Kelly , P.B. Key , M. Steenstrup . (1995) Dynamic alternative routing’,, Routing in Communications Networks.
    3. 3)
      • Apostolopoulos, G., Williams, D., Kamat, S., Guerin, R., Orda, A., Przygienda, T.: ‘QoS routing mechanism and OSPF extensions’, RFC 2676, 1999.
    4. 4)
      • Z. Whang , J. Crowcroft . Quality-of-service routing for supporting multimedia applications. IEEE J. Sel. Areas Commun. , 7 , 1228 - 1234
    5. 5)
      • Paul, P., Raghavan, S.V.: `Survey of QoS routing', 15thInt. Conf. on Computer Communication, 2002, Mumbai, India, p. 50–75.
    6. 6)
      • S. Floyd , V. Paxson . Difficulties in simulating the Internet. IEEE/ACM Trans. Netw. , 4 , 392 - 403
    7. 7)
      • A. Shaikh , J. Rexford , K.G. Shin . Evaluating the impact of stale link state on quality-of-service routing. IEEE/ACM Trans. Netw. , 2 , 162 - 176
    8. 8)
      • Chen, S., Nahrstedt, K.: `Distributed quality-of-service routing in highspeed networks based on selective probing', 23rdAnnual Conf. on Local Area Networks, 1998, IEEE, p. 80–90.
    9. 9)
      • Chen, S., Nahrstedt, K.: `Distributed QoS routing with imprecise state information', 7thIEEE Int. Conf. on Computer Communications and Networks, 1998, Lafayette, LAIEEE, p. 614–621.
    10. 10)
      • Yuan, X., Saifee, A.: `Path selection methods for localized quality of service routing', 10th IEEE Int. Conf. Computer Communications and Networks, 2001, Phoenix, Arizona, p. 102–107.
    11. 11)
      • S. Nelakuditi , Z.-L. Zhang , R. Tsang , D. Du . On selection of candidate paths for proportional routing. Comput. Netw. , 1 , 79 - 102
    12. 12)
      • S. Nelakuditi , Z.L. Zhang , R. Tsang , D. Du . Adaptive proportional routing: a localized qos routing approach. IEEE/ACM Trans. Netw. , 6 , 790 - 804
    13. 13)
      • H.D. Neve , P.V. Mieghem . TAMCRA: a tunable accuracy multiple constraints routing algorithm. Comput. Commun. , 7 , 667 - 679
    14. 14)
    15. 15)
      • S. Chen , K. Nahrstedt . An overview of quality-of-service routing for the next generation highspeed networks: problems and solutions. IEEE Netw. Mag. , 6 , 64 - 79
    16. 16)
      • Shaikh, A., Rexford, J., Shin, K.: `Efficient precomputation of quality of service routes', Int. Workshop on Network and OS Support for Digital Audio and Video 1998, 1998, Cambridge, IEEE, p. 15–27.
    17. 17)
      • Varga, A.: `The OMNeT++ discrete event simulation system', European Simulation Multiconference, 2001, Prague, Czech Republic.
    18. 18)
      • Ma, Q., Steenkiste, P.: `Quality-of-service routing for traffic with performance guarantees', 5thInt. IFIP Workshop on QoS, IEEE, May 1997, New York, NY, p. 115–126.
    19. 19)
      • R. Guerin , A. Orda . QoS-based routing in networks with inaccurate information: theory and algorithms. IEEE/ACM Trans. Netw. , 3 , 605 - 614
    20. 20)
      • Medina, A., Lakhina, A., Matta, I., Byers, J.: `Brite: an approach to universal topology generation', Proc. Int. Workshop on Modeling Analysis and Simulation of Computer and Telecommunications Systems, 2001, Cincinnati, Ohio, p. 346–356.
http://iet.metastore.ingenta.com/content/journals/10.1049/ip-com_20060003
Loading

Related content

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