2017•Unpublished venueRequires access

Improved localized distributed routing algorithm with smart mechanism

Tran Minh Anh, Nguyen Chien Trinh

Open publisher page 0 citations

Abstract

In providing new telecommunication services, the requisition for quality of network is more and more popular and sophisticated with high bandwidth, small value of delay time or packet loss etc. To assure the quality of network, the localized routing schemes have recently been researched as a promising alternative to the currently deployed global QoS routing schemes. Different from the traditional QoS routing algorithms which use global state information, the localized routing algorithms use local information collected from source node to make routing decisions. These localized routing algorithms can be solutions to meet the demand of telecom market in the near future. In this paper, we study and propose one model of localized QoS routing algorithm, which uses distributed routing type to route flows. We perform it with experiments, compare and realize the more considerable performance of this algorithm than other algorithms, which use the same conditions of simulation. From that, we imply that localized QoS routing algorithm using distributed routing works more effectively than other types of routing algorithm.

About this research paper

What this paper is about

In providing new telecommunication services, the requisition for quality of network is more and more popular and sophisticated with high bandwidth, small value of delay time or packet loss etc. To assure the quality of network, the localized routing schemes have recently been researched as a promising alternative to the currently deployed global QoS routing schemes. Different from the traditional QoS routing algorithms which use global state information, the localized routing algorithms use local information collected from source node to make routing decisions. These localized routing algorithms can be solutions to meet the demand of telecom market in the near future. In this paper, we study and propose one model of localized QoS routing algorithm, which uses distributed routing type to route flows. We perform it with experiments, compare and realize the more considerable performance of this algorithm than other algorithms, which use the same conditions of simulation. From that, we imply that localized QoS routing algorithm using distributed routing works more effectively than other types of routing algorithm.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In providing new telecommunication services, the requisition for quality of network is more and more popular and sophisticated with high bandwidth, small value of delay time or packet loss etc. To assure the quality of network, the localized routing schemes have recently been researched as a promising alternative to the currently deployed global QoS routing schemes. Different from the traditional QoS routing algorithms which use global state information, the localized routing algorithms use local information collected from source node to make routing decisions. These localized routing algorithms can be solutions to meet the demand of telecom market in the near future. In this paper, we study and propose one model of localized QoS routing algorithm, which uses distributed routing type to route flows. We perform it with experiments, compare and realize the more considerable performance of this algorithm than other algorithms, which use the same conditions of simulation. From that, we imply that localized QoS routing algorithm using distributed routing works more effectively than other types of routing algorithm.

Key concepts: Static routing, Policy-based routing, Link-state routing protocol, Computer science, Dynamic Source Routing, Multipath routing, Computer network, Destination-Sequenced Distance Vector routing

Related papers

Back to paper searchBrowse research topicsOriginal source
Improved localized distributed routing algorithm with smart mechanism — Research Paper | ScholarLens