DocumentCode :
3375990
Title :
A Distributed Routing Algorithm for Networks with Data-Path Services
Author :
Huang, Xin ; Ganapathy, Sivakumar ; Wolf, Tilman
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of Massachusetts, Amherst, MA
fYear :
2008
fDate :
3-7 Aug. 2008
Firstpage :
1
Lastpage :
7
Abstract :
Many next-generation Internet architectures propose advanced packet processing functions in the data path of the network. Such "services" are typically performed on some nodes along the path of a packet. We present a novel decentralized algorithm that can determine an allocation of services to network nodes. The algorithm can obtain globally optimal solutions for a single service and approximate solutions for two or more services. In our simulation results, we validate the correctness of the algorithm, quantify the quality of the approximations, and compare the results to those of a centralized algorithm. Our results show that the proposed algorithm presents an effective solution to the service placement problem that can be implemented in a realistic network.
Keywords :
Internet; distributed algorithms; telecommunication network routing; data-path services; decentralized algorithm; distributed routing algorithm; next-generation Internet architectures; packet processing functions; service placement problem; Computer architecture; Data security; Distributed algorithms; IP networks; Next generation networking; Peer to peer computing; Protocols; Routing; Scalability; Web and internet services;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Communications and Networks, 2008. ICCCN '08. Proceedings of 17th International Conference on
Conference_Location :
St. Thomas, US Virgin Islands
ISSN :
1095-2055
Print_ISBN :
978-1-4244-2389-7
Electronic_ISBN :
1095-2055
Type :
conf
DOI :
10.1109/ICCCN.2008.ECP.32
Filename :
4674192
Link To Document :
بازگشت