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

Ming Tian; Ju Long Lan; Peng Yi

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

Paper Titles

A Method of Combined Evaluation Based on Two-Dimensional Density Weighted Operator
p.34

A Method to Estimate Control Delay of Signalized Intersection
p.38

A Model-Driven Approach for Monitoring in Service Cloud
p.43

A Modified Phase Correlation Method for Image Registration
p.48

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

A Multi-Objective Model about Period Train Timetable Problem and a Genetic Algorithm Based on Job-Shop Problem
p.56

A Multi-Objective Model for Evaluation of Road-Region Ecosystem Stability
p.60

A New Algorithm of Online Handwritten Mathematical Formula Structure Recognition
p.64

A New Hazard Identification Method-State Transition Graph
p.71

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 48-49A Multi-next-Hop Routing Optimization Algorithm...

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

Abstract:

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.

You might also be interested in these eBooks

Measuring Technology and Mechatronics Automation

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 48-49)

Pages:

52-55

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.48-49.52

Citation:

Cite this paper

Online since:

February 2011

Authors:

Ming Tian, Ju Long Lan, Peng Yi

Keywords:

Multi-next-Hop Routing, Polymerization Equivalence Class, Route Optimization, Traffic Balancing

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] RFC 1058, Routing Information Protocol.

Google Scholar

[2] RFC 2178, OSPF Version 2.

Google Scholar

[3] A. Zinin, Cisco IP Routing. Boston, MA: Addison-Wesley, (2002).

Google Scholar

[4] Pascal Merindol, Jean-Jacques Pansiot, Stephane Cateloin, Improving Load Balancing with Multipath Routing, University Louis Pasteur, IEEE, (2008).

DOI: 10.1109/icccn.2008.ecp.30

Google Scholar

[5] S. Vutukury, J.J. Garcia-Luna-Aceves, MDVA: A Distance-Vector Multipath Routing Protocol, In Proceedings of the INFOCOM[C], 2001, pp.557-564.

DOI: 10.1109/infcom.2001.916780

Google Scholar

[6] Sa-Ngiamsak Wisitsak, Varakulsiripunth Ruttikorn. A Bandwidth-Based Constraint Routing Algorithm for Multi-Protocol Label Switching Networks. In: IEEE ICACT 2004); Phoenix Park, Korea; 2004. pp.933-937.

DOI: 10.1109/icact.2004.1293005

Google Scholar

[7] Gopalan Kartik, Chiueh Tzi-cker, Lin Yow-Jian. Load Balancing Routing with Bandwidth-Delay Guarantees[J]. IEEE Communication Magazine. 2004, 42(6): 108-113.

DOI: 10.1109/mcom.2004.1304244

Google Scholar