Overlay-based Service Distribution Network: A Novel Approach to Convey Service through Overlay Routing

Author

Liu, Nianzu ; Chen, Xiao

Author_Institution

Sch. of Math. & Inf., Shanghai Lixin Univ. of Commerce, Shanghai, China

fYear

2011

fDate

17-18 Sept. 2011

Firstpage

115

Lastpage

118

Abstract

We propose Overlay-based Service Distribution Network(OSDN) as a novel platform to convey service through overlay routing. We formulate the OSDN deployment problem in order to build an optimal overlay for a given set of connection demands but find the problem is NP-complete. To obtain a suboptimal solution, we first design a LASER algorithm to calculate all shortest overlay paths available for a given AS pair and then apply heuristic methods to merge the overlay paths selectively for different AS pairs. Through simulation experiments, we conclude that our approach has a good performance to reduce the construction cost of an OSDN for a given set of connection demands.

Keywords

computational complexity; computer networks; telecommunication network routing; LASER algorithm; NP-complete problem; OSDN deployment problem; convey service; optimal overlay; overlay based service distribution network; overlay routing; Algorithm design and analysis; Educational institutions; Internet; Labeling; Lasers; Merging; Routing; Overlay Network; Service Distribution Network;

fLanguage

English

Publisher

ieee

Conference_Titel

Internet Computing & Information Services (ICICIS), 2011 International Conference on

Conference_Location

Hong Kong

Print_ISBN

978-1-4577-1561-7

Type

conf

DOI

10.1109/ICICIS.2011.35

Filename

6063207