Optimal adaptive routing with efficient flapping prevention

• Autorzy: Morawski M.
• Języki publikacji: EN

Abstrakty

EN

In the paper we present the results of our work on the new method of an adaptive multipath unidirectional routing based on the Minimum Delay Routing principle. The routing problem considered in our work is focused on the most frequently encountered case of communication networks with the TCP-traffic dominating in all links, rather than UDP multimedia traffic. The paper extends previous results by maintaining paths and overall network stability in hard traffic conditions. In the approach presented, we assume that the values of link costs in all links and all metrics are not known exactly, but we consider them as values with uncertainty. Such an approach, together with associated forwarding method allows us to assimilate well known routing algorithms to the close to optimal behaviour and therefore, to obtain significantly better throughput for data streams, than in the case of usaging pure standard algorithms.

Słowa kluczowe

EN

optimal routing; QoS

• Wydawca: Oficyna Wydawnicza Politechniki Wrocławskiej
• Czasopismo: Systems Science
• Rocznik: 2006
• Tom: Vol. 32, no 3
• Strony: 61--68
• Opis fizyczny: Bibliogr. 21 poz., wykr.

Twórcy

autor

Morawski M.

• Division of Computer Networks, Technical University of Łódź, ul. Stefanowskiego 18/22, 90-924 Łódź, Poland,

Bibliografia

• [11 “EIGRP Protocol.” [Online]. Available: http://www.cisco.com/en/US/tech/lk365/technologies`tech` note09186a0080093i07.shtml
• [2] Network simulator NS-2. [Online]. Available: http://www.isi.edu/nsnam/ns/
• [3] Beitsekas D.P., Network Optimization: Continuous and Discrete Models, Athena Scientific, Belmont, Massachusetts. 1998.
• [4] Czumaj A., Selfish routing on the internet. Department of Computer Science, New Jersey Institute of Technology, Newark, NJ 07102, USA. Tech. Rep. grant CCR-0105701, May 15, 2003. [Online]. Available: http://www.cs.njit.edu/~czuiTiaj/PUBLICATIONS/Selfish-Routing-Survey.pdf
• [5] Gallager R.. A minimum delay routing algorithm using distributed computation, IEEE Trans. Communication, Vol. 25, No. 1, January 1977, pp. 73-84.
• [6] Garcia-Luna-Aceves J.J., Vutukury S.. Zaumen W.T., A practical approach to minimizing delays in internet routing protocols, IEEE ICC, Vancouver, Canada, June 6-10, 1999.
• [7] Grzech A., Sterowanie ruchem w sieciach teleinformatvcznych, Oficyna Wydawnicza Politechniki Wrocławskiej, 2002. (in Polish).
• [8] Hopps C., Analysis of an equal-cost multi-path algorithm, RFC, Tech. Rep. 2992, November 2000.
• [9] Jacobson V., Modified TCP congestion avoidance algorithm, end2end-interest mailing list. Tech. Rep., 30 April, 1990.
• [10] Khanna A.. Zinky J., The revised ARPANET routing metric, SIGCOMM, ACM, August 1989, pp. 45-56.
• [11] Kodialam M., Lakshman T.. Minimum interference routing with applications to MPLS traffic engineering, INFOCOM, Tel Aviv, Israel, March 2000, pp. 884-893.
• [12] La R.. Anatharam V., Optimal routing control: Game theoretic approach, 36th Conf. Decision and Control. San Diego. USA, December 1997, pp. 2910-2915.
• [13] Morawski M., Multipath routing that supports QoS, Sieci Komputerowe, Zakopane. Poland. 24-26 June, 2005. pp. 171-182.
• [14] Morawski M.,Uncertain metrics applied to QoS multipath routing, 5th Int. Workshop Design of Reliable Communication Networks, DRCN`05, Island of Ischia, Naples, Italy, 16-19 October, 2005, pp. 353-360.
• [15] Perros H.G., Connection-oriented Networks SONET/SDH, ATM, MPLS and OPTICAL NETWORKS, John Wiley & Sons, Inc., 2005.
• [16] Srikant R., The Mathematics of Internet Congestion Control, Birkhäuser, 2003.
• [17] Vutukury S., Garcia-Luna-Aceves J.J., A practical framework for minimum-delay routing in computer networks. Journal of High Speed Networks. Vol. 8. No. 4. 1999. pp. 241-263.
• [18] Vutukury S., Garcia-Luna-Aceves J.J., A simple approximation to minimum-delay routing, ACM SIGCOMM, Cambridge, Massachusetts, September 1-3, 1999.
• [19] Vutukury S., Garcia-Luna-Aceves J.J., A traffic engineering approach based on minimum-delay routing, IEEE IC3N, Las Vegas, Nevada, USA, October 16-19, 2000.
• [20] Vutukury S.. Garcia-Luna-Aceves J.J., MPATH: a loop-free inidtipath routing algorithm. Journal of Microprocessors and Microsystems (Elsevier), Vol. 24, 2001, pp. 319-327.
• [21] Wolkenhaucr O., Data Engineering: Fuzzy Mathematics in Systems Theory and Data Analysis, John Wiley & Sons. Inc., 2001.