Generic cell rate algorithm

About: Generic cell rate algorithm is a research topic. Over the lifetime, 451 publications have been published within this topic receiving 13634 citations. The topic is also known as: GCRA.

A generalized processor sharing approach to flow control in integrated services networks: the multiple node case

Abstract: Worst-case bounds on delay and backlog are derived for leaky bucket constrained sessions in arbitrary topology networks of generalized processor sharing (GPS) servers. The inherent flexibility of the service discipline is exploited to analyze broad classes of networks. When only a subset of the sessions are leaky bucket constrained, we give succinct per-session bounds that are independent of the behavior of the other sessions and also of the network topology. However, these bounds are only shown to hold for each session that is guaranteed a backlog clearing rate that exceeds the token arrival rate of its leaky bucket. A much broader class of networks, called consistent relative session treatment (CRST) networks is analyzed for the case in which all of the sessions are leaky bucket constrained. First, an algorithm is presented that characterizes the internal traffic in terms of average rate and burstiness, and it is shown that all CRST networks are stable. Next, a method is presented that yields bounds on session delay and backlog given this internal traffic characterization. The links of a route are treated collectively, yielding tighter bounds than those that result from adding the worst-case delays (backlogs) at each of the links in the route. The bounds on delay and backlog for each session are efficiently computed from a universal service curve, and it is shown that these bounds are achieved by "staggered" greedy regimes when an independent sessions relaxation holds. Propagation delay is also incorporated into the model. Finally, the analysis of arbitrary topology GPS networks is related to Packet GPS networks (PGPS). The PGPS scheme was first proposed by Demers, Shenker and Keshav (1991) under the name of weighted fair queueing. For small packet sizes, the behavior of the two schemes is seen to be virtually identical, and the effectiveness of PGPS in guaranteeing worst-case session delay is demonstrated under certain assignments. >

A calculus for network delay. I. Network elements in isolation

Abstract: A calculus is developed for obtaining bounds on delay and buffering requirements in a communication network operating in a packet switched mode under a fixed routing strategy. The theory developed is different from traditional approaches to analyzing delay because the model used to describe the entry of data into the network is nonprobabilistic. It is supposed that the data stream entered into the network by any given user satisfies burstiness constraints. A data stream is said to satisfy a burstiness constraint if the quantity of data from the stream contained in any interval of time is less than a value that depends on the length of the interval. Several network elements are defined that can be used as building blocks to model a wide variety of communication networks. Each type of network element is analyzed by assuming that the traffic entering it satisfies bursting constraints. Under this assumption, bounds are obtained on delay and buffering requirements for the network element; burstiness constraints satisfied by the traffic that exits the element are derived. >

A generalized processor sharing approach to flow control in integrated services networks-the multiple node case

Abstract: Worst-case bounds on delay and backlog are derived for leaky bucket constrained sessions in arbitrary topology networks of generalized processor sharing servers. When only a subset of the sessions are leaky bucket constrained succinct per-session bounds that are independent of the behavior of the other sessions and also of the network topology are given. However, these bounds are only shown to hold for each session that is guaranteed a backlog clearing rate that exceeds the token arrival rate of its leaky bucket. When all of the sessions are leaky bucket constrained, a much larger class of networks called consistent relative session treatment networks is analyzed. The session i route is treated as a whole, yielding tighter bounds than those that result from adding the worst-case delays (backlogs) at each of the servers in the route. The bounds on delay and backlog for each session are computed and shown to be achieved by staggered regimes when an independent sessions relaxation holds. Propagation delay is also incorporated into the model. >

Virtual clock: a new traffic control algorithm for packet switching networks

Abstract: A challenging research issue in high speed networking is how to control the transmission rate of statistical data flows. This paper describes a new algorithm, VirtualClock, for data traffic control in high-speed networks. VirtualClock maintains the statistical multiplexing flexibility of pocket switching while ensuring each data flow its reserved average throughput rate at the same time. The algorithm has been tested through simulation.

Modeling and performance comparison of policing mechanisms for ATM networks

Abstract: Asynchronous transfer mode (ATM) networks, as proposed by CCITT as the solution for the future broadband ISDN, will provide high flexibility with respect to the varying bandwidth requirements of the different services. They will also support variable bit rates within a connection. The packetized information transfer, without flow control between the user and the network, in combination with the asynchronous multiplexing principle, results in a need to control the individual cell stream during the entire duration of the calls to ensure an acceptable quality of service for all coexisting calls sharing the same network resources. This kind of control will be provided by introducing a policing or usage parameter control function. Basic design objectives and requirements for such a function are described. These requirements serve as a basis for the comparison of some of the mechanisms proposed so far, namely the leaky bucket, the jumping window, the triggered jumping window, the moving window, and the exponentially weighted moving average mechanisms. >