Scaling Control Traac in Network Protocols Contents 1 Introduction and Problem Statement 1 2 Background and Motivation 2

The primary goal of a data network is to carry data tra c. Some of the tra c carried in a network is control tra c such as routing, signalling and end-to-end protocol control. Unregulated growth of control tra c can jeopardize the primary goal of networks. This paper discusses scaling of control tra c in network protocols and proposes some general scaling techniques. Control tra c can be regulated along three scaling dimensions: (1) frequency, (2) distribution scope, and (3) information aggregation. This paper describes a study of scalable timers to regulate control tra c along frequency dimension. We also describe future work in the areas of distribution scope and information aggregation. Soft state protocols use periodic refresh messages to keep network state alive while adapting to changing network conditions; this has raised concerns regarding the scalability of protocols that use the soft-state approach. In existing soft state protocols, the values of the timers that control the sending of these messages, and the timers for aging out state, are chosen by matching empirical observations with desired recovery and response times. These xed timer-values fail because they use time as a metric for bandwidth; they adapt neither to (1) the wide range of link speeds that exist in most wide-area internets, nor to (2) uctuations in the amount of network state over time. We propose and evaluate a new approach scalable timers in which timer-values adapt dynamically to the volume of control tra c and available bandwidth on the link. Global distribution of multi-party control messages in existing protocols can lead to unconstrained growth of control tra c. Aggregation ( or merging) of control messages and then hierarchical distribution can provide better scaling properties. In this paper we propose various techniques that can be used to distribute control messages for group state synchronization with limited scope.

[1]  Henning Schulzrinne,et al.  RTP: A Transport Protocol for Real-Time Applications , 1996, RFC.

[2]  Dave Thaler,et al.  Distance-Vector Multicast Routing Protocol MIB , 1999 .

[3]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[4]  William C. Fenner Internet Group Management Protocol, Version 2 , 1997, RFC.

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

[6]  Deborah Estrin,et al.  Scalable timers for soft state protocols , 1997, Proceedings of INFOCOM '97.

[7]  ZHANGLi-xia,et al.  A reliable multicast framework for light-weight sessions and application level framing , 1995 .

[8]  Deborah Estrin,et al.  Multicast routing in dense and sparse modes: simulation study of tradeoffs and dynamics , 1995, Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95.

[9]  Van Jacobson,et al.  Link-sharing and resource management models for packet networks , 1995, TNET.

[10]  Deborah Estrin,et al.  An architectural comparison of ST-II and RSVP , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[11]  Paul Francis,et al.  Core based trees (CBT) , 1993, SIGCOMM '93.

[12]  Claudio Topolcic,et al.  Experimental Internet Stream Protocol: Version 2 (ST-II) , 1990, RFC.

[13]  Madan Gopal,et al.  Topology distribution cost vs. efficient routing in large networks , 1990, SIGCOMM '90.

[14]  David D. Clark,et al.  The design philosophy of the DARPA internet protocols , 1988, SIGCOMM '88.

[15]  M. Mesarovic,et al.  Theory of Hierarchical, Multilevel, Systems , 1970 .

[16]  V. Jacobson,et al.  Protocol Independent Multicast (PIM): Motivation and Architecture , 1995 .

[17]  Liming Wei,et al.  The Design of the USC PIM Simulator (pimsim) , 1995 .

[18]  V. Jacobson,et al.  Protocol Independent Multicast (PIM), Sparse Mode Protocol Specification , 1994 .

[19]  V. Jacobson,et al.  Congestion avoidance and control , 1988, SIGCOMM '88.

[20]  G. Sicuranza,et al.  The landmark hierarchy: A new hierarchy for routing in very large networks , 1988 .

[21]  Farouk Kamoun,et al.  Hierarchical Routing for Large Networks; Performance Evaluation and Optimization , 1977, Comput. Networks.