A Multi-next-Hop Routing Optimization Algorithm Based on Polymerization Equivalence Class

Abstract:

Article Preview

A multi-next-hop routing algorithm based on polymerization equivalence class proposed in this paper, which can efficiently avoid route loop. Because each node is divided into different equivalence class, message transmission direction is along reducing order of equivalent class numbers. Based on that, the link criticality is referred to depict the average task in network for every link, it can be used to avoid choosing links with heavier task and longer path length to route, making whole network utilization tend to balance, reducing package loss in the case of high load.

Info:

Periodical:

Edited by:

Zhixiang Hou

Pages:

52-55

DOI:

10.4028/www.scientific.net/AMM.48-49.52

Citation:

M. Tian et al., "A Multi-next-Hop Routing Optimization Algorithm Based on Polymerization Equivalence Class", Applied Mechanics and Materials, Vols. 48-49, pp. 52-55, 2011

Online since:

February 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.