Propose a new algorithm of routing with information collected locally
Abstract
The type of algorithm which uses local information collected from source node for Quality of Service (QoS) routing has recently been researched as an alternative to QoS routing algorithms that traditionally use global state information. This algorithm, collecting information from source node only, helps flow routing better and assures more flexibly QoS for network. This trend leads to a new solution for satisfying the higher and higher demand of telecom market in the near future. In this paper, we introduce a new algorithm of routing like that type for assuring the quality of network as well as quality of services. The simulations at last section show the advantages over some other localized routing algorithms and global routing algorithm.
Downloads
References
[1] C. Pornavalai, G. Chakraborty and N. Shiratori, “QoS based routing algorithm in integrated services packet networks”, Proceedings of the IEEE ICNP, 1997.
[2] S. Chen and K. Nahrstedt, “An Overview of Quality-of-Service Routing for the Next Generation High-Speed Networks: Problems and Solutions”, IEEE Network, special issue on transmission and distribution of digital video, vol. 12, pp. 64-79, 1998.
[3] R. Guerin, S. Kamat, A. Orda, T. Przygienda and D. Williams, “QoS Routing Mechanisms and OSPF Extensions”, Work in Progress, Internet Draft, March 1997.
[4] Z. Whang and J. Crowcroft, “Quality-of-Service routing for supporting multimedia applications”, IEEE J. Select. Areas Commun, 14 (1996), pp. 1228-1234.
[5] M. Q. Ma and P. Steenkiste, “On Path Selection for Traffic with Bandwidth Guarantees”, IEEE ICNP ’97.
[6] G. Apostolopoulos, R. Guerin, S. Kamat and S. Tripathi, “Quality of Service Based Routing: A Performance Perspective”, ACM SIGCOMM, September 1998.
[7] F.P. Kelly, “Dynamic Routing in Stochastic Networks”, In Stochastic Networks, ed. F.P. Kellyand R.J.Williams, Springer-Verlag, 169-186, 1995.
[8] N. Taft-Plotkin, B. Bellur, and R. Ogier, “Quality-of-Service Routing using Maximally Disjoint Paths”, IWQOS, June 1999.
[9] J. Moy, “OSPF Version 2”, Request For Comments 2328, Internet Engineering Task Force, April 1998.
[10] S. Alabbad, M. E. Woodward. “Localized Credit Based Routing: Performance Evaluation Using Simulation”, Proc. of IEEE 39th Annual Simulation Symposium, Huntsville, Al. USA April 2-6 2006.
[11] S. Nelakuditi, Z. L. Zhang, R. Tsang and D. Du, “On selection of candidate paths for proportional routing”, Computer networks, 44 (2004),pp. 79-102.
[12] S. Nelakuditi and Z. L. Zhang, “Localized Quality of Service Routing for the Internet”, Kluwer Academic Publishers, June 2003.
[13] S. Nelakuditi, Z. L. Zhang, R. Tsang and D. Du, “Adaptive Proportional Routing: a Localized QoS Routing Approach”, IEEE/ACM Transactions on Networking 10 (2002), pp. 790-804.
[14] S. Nelakuditi, and Z-L. Zhang, “On Selection of Paths for Multipath Routing”, Techincal Report, Department of Computer Science, University of Minnesota, April 2001.
[15] F. M. Aldosari and F. Alradady, ”Localized QoS Routing with End-to-End Delay Guarantees,” in Proc. International Conference on Information Technology: New Generations, Las Vegas, NV, April 2013, pp. 464-472.
[16] ITU-T Recommendations, Y.1500-Y.1599: Quality of service and network performance. http://www.itu.int/ITUT/recommendations/index .aspx?ser=Y.
[17] A. Shaikh, J. Rexford, K. Shin, “Load-Sensitive Routing of Long-Lived IP Flows”, ACM SIGCOMM 1999.
[18] A.Shaikh, J.Rexford, K.G.Shin. Efficient Precomputation of Quality-of-Service Routes. Proc. IEEE NOSSDAV 98, July, 1998.
[19] Data Structures and Algorithms, Dijkstra’s Algorithm. https://www.cs.auckland.ac.nz/software/AlgAnim/dijkstra.html.
[20] A. Varga, The OMNeT++ Discrete Event Simulation System, the European Simulation Multiconference, Prague, Czxech Republic, 2001.
