Path layout on tree networks: Bounds in different label switching models

Path Layout is a fundamental graph problem in label switching protocols. This problem is raised in various protocols such as the traditional ATM protocol and MPLS which is a new label switching protocol standardized recently by the IETF. Path layout is essentially the problem of reducing the size of the label table in a router. The size is equivalent to the number of different paths that pass through the router, or start from it. A reduction in the size can be achieved by choosing a relatively small number of paths, from which a larger set is composed using concatenation. In this paper we deal with three variants of the Path Layout Problem according to the special characteristics of paths in three label switching protocols, MPLS, ATM and TRAINET. We focus on tree networks, and show an algorithm which finds label tables of small size, while permitting concatenation of at most k paths. We prove that this algorithm gives worst case tight bounds (up to constant factor) for all three models. The bounds are given as a function of the size of the tree, and the maximum degree.

[1]  Ori Gerstel,et al.  Optimal Virtual Path Layout in ATM Networks With Shared Routing Table Switches , 1996, Chic. J. Theor. Comput. Sci..

[2]  Ladislav Stacho,et al.  Virtual Path Layouts in ATM Networks , 2000, SIAM J. Comput..

[3]  Vishal Sharma,et al.  Framework for Multi-Protocol Label Switching (MPLS)-based Recovery , 2003, RFC.

[4]  Yakov Rekhter,et al.  Tag-switching architecture: overview , 1997, Other Conferences.

[5]  Dino Farinacci,et al.  Tag switching architecture overview : Global information infrastructure , 1997 .

[6]  Peter Newman,et al.  IP switching and gigabit routers , 1997, IEEE Commun. Mag..

[7]  Shmuel Zaks,et al.  Path Layout in ATM Networks , 1997, SOFSEM.

[8]  George Swallow,et al.  A framework for multiprotocol label switching , 1999 .

[9]  Michael O. Ball,et al.  Fault-Tolerant Virtual Path Layout in ATM Networks , 2000, INFORMS J. Comput..

[10]  Ori Gerstel,et al.  The layout of virtual paths in ATM networks , 1996, TNET.

[11]  D. Awduche,et al.  Multiprotocol lambda switching: combining MPLS traffic engineering control with optical crossconnects , 2001, IEEE Commun. Mag..

[12]  George Varghese,et al.  Trading packet headers for packet processing , 1995, SIGCOMM '95.

[13]  Sanghyun Ahn,et al.  Virtual path layout design on ATM networks , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[14]  Hiroshi Esaki,et al.  Toshiba's Router Architecture Extensions for ATM : Overview , 1997, RFC.

[15]  Rainer Händel,et al.  Integrated broadband networks : an introduction to ATM-based networks , 1991 .

[16]  W. D. Grover,et al.  Comparative Methods and Issues In Design of Mesh-Restorable STM and ATM Networks , 1999 .

[17]  Shmuel Zaks,et al.  A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load , 1998, Parallel Process. Lett..

[18]  Nicholas F. Maxemchuk,et al.  Routing in the Manhattan Street Network , 1987, IEEE Trans. Commun..

[19]  Avishai Wool,et al.  Optimal layouts on a chain ATM network , 1998, Discret. Appl. Math..

[20]  Ori Gerstel,et al.  The virtual path layout problem in fast networks (extended abstract) , 1994, PODC '94.

[21]  Yehuda Afek,et al.  Trainet: a new label switching scheme , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[22]  William I. Grosky,et al.  SOFSEM 2002: Theory and Practice of Informatics , 2002, Lecture Notes in Computer Science.