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:
Main Author: | Mohamed Abdulqader, Makarem |
---|---|
Format: | Thesis |
Language: | English English |
Published: |
2007
|
Subjects: | |
Online Access: | http://psasir.upm.edu.my/id/eprint/448/1/1600477.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A genetic algorithm solution to the shortest path problem in OSPF and MPLS /
by: Tee, Wee Jing
Published: (2002) -
An investigation and simulation of novel dynamic routing methods
by: Saleh, Mohammad
Published: (2001) -
Crosstalk-Free Scheduling Algorithms for Routing in Optical Multistage Interconnection Networks
by: Raja Mohd Auzar, Tengku Dian Shahida
Published: (2009) -
Location-Based Approach for Route Maintenance in Dynamic Source Routing Protocol
by: Sjaugi, Muhammad Farhan
Published: (2008) -
Performance of Ad-Hoc on-Demand Distance Vector Discovery Algorithms Based On Packet Lifetime
by: Ahmad, Noor Azlan
Published: (2008)