The QoS Routing for Anycast Message

Author

Xuegong, Tan

Author_Institution

Coll. of Chinese Language & Culture, Jinan Univ., Guangzhou, China

fYear

2011

fDate

20-21 Aug. 2011

Firstpage

41

Lastpage

44

Abstract

Anycast is a one-to-any communication model in IPv6 and other networks. In any cast, a packet is intended to be delivered to one of the nearest group recipients. When quality-of-service(QoS) routing is considered, whether or not there is an appropriate routing under several constraints? How to select the destination node from many candidates? To the best of our knowledge, there is little literature about this issue. In general, finding a feasible path with two additive constraints based on any cast is an NP-complete problem. In highly dynamic large networks, the information available for making routing decisions may be inaccurate. In this paper, we propose an algorithm for delay and delay jitter constrained any cast routing with inaccurate link state information.

Keywords

IP networks; communication complexity; decision making; jitter; quality of service; telecommunication network routing; IPv6; NP-complete problem; QoS routing; anycast message; delay jitter; one-to-any communication model; quality-of-service routing; routing decision making; Additives; Bandwidth; Delay; Jitter; Quality of service; Routing; Additive constraints; Anycast; Inaccurate information; QoS routing;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligence Science and Information Engineering (ISIE), 2011 International Conference on

Conference_Location

Wuhan

Print_ISBN

978-1-4577-0960-9

Electronic_ISBN

978-0-7695-4480-9

Type

conf

DOI

10.1109/ISIE.2011.131

Filename

5997372