Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Lagrangian Relaxation and Linear Intersection Based QoS Routing Algorithm

Lagrangian Relaxation and Linear Intersection Based QoS Routing Algorithm Abstract Due to the process of network convergence, the variety of types of traffic transmitted over a single medium increases steeply. This phenomenon can be handled by the existing networking structure although the protocols that are used and, especially, the underlying routing protocols need to be improved. The problem of finding the shortest path on the Internet can no longer be easily defined as there is an increasing number of different characteristics to describe a point-to-point link. The definition of the shortest path may differ for different traffic types. Therefore, in the mathematical models used to solve the modern routing problems multiple criteria must be taken into account. One of the interesting classes of the optimization problem is the problem of finding the solution that is minimized against one of the criteria under certain constraints with regard to the others. In this paper, two algorithms solving this kind of problems are presented and compared with a new solution proposed by the authors. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Electronics and Telecommunications de Gruyter

Lagrangian Relaxation and Linear Intersection Based QoS Routing Algorithm

Download PDF
8 pages

Loading next page...
 
/lp/de-gruyter/lagrangian-relaxation-and-linear-intersection-based-qos-routing-gphovD1T3v

References (20)

Publisher
de Gruyter
Copyright
Copyright © 2012 by the
ISSN
0867-6747
DOI
10.2478/v10177-012-0042-2
Publisher site
See Article on Publisher Site

Abstract

Abstract Due to the process of network convergence, the variety of types of traffic transmitted over a single medium increases steeply. This phenomenon can be handled by the existing networking structure although the protocols that are used and, especially, the underlying routing protocols need to be improved. The problem of finding the shortest path on the Internet can no longer be easily defined as there is an increasing number of different characteristics to describe a point-to-point link. The definition of the shortest path may differ for different traffic types. Therefore, in the mathematical models used to solve the modern routing problems multiple criteria must be taken into account. One of the interesting classes of the optimization problem is the problem of finding the solution that is minimized against one of the criteria under certain constraints with regard to the others. In this paper, two algorithms solving this kind of problems are presented and compared with a new solution proposed by the authors.

Journal

International Journal of Electronics and Telecommunications – de Gruyter

Published: Dec 1, 2012

There are no references for this article.