Edge-Based TACCS: A More Scalable TACCS Based on Cooperation of High Functional Edge Nodes

Various multimedia streaming have started to be offered in Internet protocol (IP) networks. However, since current networks cannot operate well if the consumers' end system sends multimedia stream at will, an admission control is becoming an important part of IP networks. Therefore, we previously proposed an admission control scheme we call "tentative accommodating and congestion confirming strategy (TACCS)". The basic idea is to accommodate incoming flows tentatively and then confirm congestion after a certain period. In TACCS, the ingress nodes of a domain make flow-accommodating decisions based on information about packet-loss events. The information is assumed to be advertised from congestion detection agents (CDAs) located in the domain. If comparable performance could be achieved without adding CDA functions to core nodes, the cost of deploying TACCS would be reduced and its scalability would be improved. We have thus developed an enhanced TACCS called "edge-based TACCS" that achieves admission control based on cooperation of high functional edge nodes and does not depend on CDAs in the core network. Simulation showed that the performance of edge-based TACCS is comparable to that of conventional TACCS that depends on CDAs in the core network.

[1]  Zheng Wang,et al.  An Architecture for Differentiated Services , 1998, RFC.

[2]  Lixia Zhang,et al.  Resource ReSerVation Protocol (RSVP) - Version 1 Functional Specification , 1997, RFC.

[3]  Raj Jain,et al.  Effect of number of drop precedences in assured forwarding , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[4]  Gunnar Karlsson,et al.  Admission control based on end-to-end measurements , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[5]  Stan Zachary,et al.  Distributed admission control , 2000, IEEE Journal on Selected Areas in Communications.

[6]  K. Yasukawa.  Drop Precedence Mapping on Dynamic Class Assignment Method : On Simplified One Link Model , 2004 .

[7]  Antonio Capone,et al.  Throughput analysis of end-to-end measurement-based admission control in IP , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[8]  B. Teitelbaum,et al.  Q Bone Bandwidth Broker Architecture , 1999 .

[9]  Sang-Ha Kim,et al.  Two phase edge-to-edge distributed measurement based admission control mechanism in large IP networks , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[10]  Scott Shenker,et al.  Integrated Services in the Internet Architecture : an Overview Status of this Memo , 1994 .

[11]  Ioannis Lambadaris,et al.  Empirical study of buffer management scheme for Diffserv assured forwarding PHB , 2000, Proceedings Ninth International Conference on Computer Communications and Networks (Cat.No.00EX440).

[12]  H. T. Kung,et al.  A DiffServ enhanced admission control scheme , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[13]  Scott Shenker,et al.  Endpoint admission control: architectural issues and performance , 2000, SIGCOMM.

[14]  Katsunori Yamaoka,et al.  Tentative Accommodating and Congestion Confirming Strategy - A Novel Admission Control Strategy for Packet Switching Networks - , 2006, IEICE Trans. Commun..

[15]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .