Oh Lee, Yong and Rengarajan, Balaji and Narasimha Reddy, A.L. (2011) Reaching approximate Wardrop equilibrium at reduced costs of link state updates. In: The 3rd International Conference on COMmunication Systems and NETworkS (COMSNETS 2011), 4 - 8 January, 2011, Bangalore, India.
- Published Version
Download (569Kb) | Preview
Several routing protocols have been proposed to take advantage of the dynamic metrics on links such as link delays, queueing lengths, and available link bandwidths. Wardrop routing, QOS routing are few such example routing protocols. Even when these protocols can be shown to offer convergence properties without oscillations, the protocols have not been widely adopted for a number of reasons. The expected cost of keeping the link metrics updated at various nodes in the network being one of them. In this paper, we study the problem of reducing the cost of propagating dynamic link metrics while keeping the quality of paths within a margin of error. We propose a simple technique of threshold-based metric propagation that is shown, through analysis and simulations, to offer bounded guarantees on path quality while signiﬁcantly reducing the cost of propagating the dynamic link metric information. Our results indicate that threshold based updates can reduce the number of link updates by up to 90-95% in some cases.
|Item Type:||Conference or Workshop Papers (Paper)|
|Uncontrolled Keywords:||Dynamic routing, link state updates, wardrop routing, efﬁciency, performance|
|Subjects:||Q Science > Q Science (General)
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
T Technology > T Technology (General)
T Technology > TA Engineering (General). Civil engineering (General)
T Technology > TK Electrical engineering. Electronics Nuclear engineering
|Divisions:||Faculty of Engineering, Science and Mathematics > School of Electronics and Computer Science|
|Depositing User:||Christian Sanchez|
|Date Deposited:||12 Mar 2012 09:29|
|Last Modified:||03 Dec 2014 11:59|
Actions (login required)