Traffic Balancing Method in Shortest Path Routing
Open Shortest Path First (OSPF) is the most commonly used intra-domain routing protocol. OSPF routes traffic flows along shortest paths and splits the load evenly at nodes where several outgoing links are on the shortest paths to the same destination. Shortest paths are defined based on a weight va...
Saved in:
主要作者: | Mohamed Abdulqader, Makarem |
---|---|
格式: | Thesis |
语言: | English English |
出版: |
2007
|
主题: | |
在线阅读: | http://psasir.upm.edu.my/id/eprint/448/1/1600477.pdf |
标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
相似书籍
-
A genetic algorithm solution to the shortest path problem in OSPF and MPLS /
由: Tee, Wee Jing
出版: (2002) -
An investigation and simulation of novel dynamic routing methods
由: Saleh, Mohammad
出版: (2001) -
Crosstalk-Free Scheduling Algorithms for Routing in Optical Multistage Interconnection Networks
由: Raja Mohd Auzar, Tengku Dian Shahida
出版: (2009) -
Location-Based Approach for Route Maintenance in Dynamic Source Routing Protocol
由: Sjaugi, Muhammad Farhan
出版: (2008) -
Performance of Ad-Hoc on-Demand Distance Vector Discovery Algorithms Based On Packet Lifetime
由: Ahmad, Noor Azlan
出版: (2008)