Use this URL to cite or link to this record in EThOS:
Title: State-sharing mechanisms that support adaptive routing in distributed networks
Author: Liu, Bin
ISNI:       0000 0004 2734 2043
Awarding Body: University of Birmingham
Current Institution: University of Birmingham
Date of Award: 2003
Availability of Full Text:
Access from EThOS:
It is desirable to make packet-switched network routing algorithms adaptive to changes in the distribution of traffic loading in order to maximize the utilization of network capacity. In a distributed routing algorithm, this requires sharing routing state updates (i.e., routing information exchanges amongst routing nodes). On the one hand, the routing state-sharing is helpful to optimize distributed routing in dynamic environments; on the other hand, the information exchange consumes network resources that could be otherwise used for user traffic. When network changes take place dynamically, to determine a good trade-off between the benefit and the cost of the routing state-sharing becomes an important issue. In a large-scale dynamic network, where optimal routing is not always achievable irrespective of how much cost the network designers/operators are willing to pay, the issue of state-sharing is critical to the global routing performance. In this thesis, we study typical wired and wireless routing protocols and their routing state-sharing algorithms, and conclude that the time-scales and neighborhood size for state-sharing as two major factors contributed to the routing state-sharing cost. The key contribution of this research is a new routing state-sharing scheme based on the partitioning of the neighborhood for each router, which results in lower costs than flooding, and leads to better routing performance in large-scale dynamic networks.
Supervisor: Not available Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID:  DOI: Not available