Dinesh Verma. Guaranteed Performance Communication in High Speed Networks. PhD dissertation, University of California at Berkeley, November 1991.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....the frame size at each switch. Controlling the rate jitter at each switch along the path will only partially reconstruct the traffic pattern; the partially reconstructed traffic pattern obeys the same traffic specification as the input traffic, but some inter packet spacing information is lost [84]. Notice that, if the traffic at the entrance to the network has a small rate jitter, controlling delay jitter inside the network will also keep the rate jitter small; however, controlling rate jitter would not automatically eliminate or reduce delay jitter. The following example illustrates the ....

....till they become eligible. Eligibility times for packets from different connections are computed using the same formula (as described in Section 3. 2) with different parameters; holding packets is equivalent to managing a set of timers; the mechanism for managing timers, which is a calendar queue [10, 84], can be shared by all regulators. Figure 3.12 shows the proposed implementation. Each of the real time queues is implemented as a linked list. The operations performed on a linked list are: deleting the packet at the head (when the next packet is chosen for transmission) and appending a packet ....

Dinesh Verma. Guaranteed Performance Communication in High Speed Networks. PhD dissertation, University of California at Berkeley, November 1991.

....is the minimum packet inter arrival time for the connection, AT k j is the time the k th packet on the connection arrived at switch j, and k j is the minimum number such that average packet inter arrival time in any I period does not exceed X ave . The computation of k j can be found in [13]. From this definition, we can see that ET k j AT k j always holds, i.e. a packet is never eligible before its arrival. Also, if we consider the sequence of packet eligibility times at switch j, fET k j g k=1;2; it always satisfies the (Xmin ; X ave ; I) traffic characterization. ....

....The scheduler consists of multiple prioritized FCFS queues, and the rate controller consists of a set of regulators corresponding to each connection. We implement each real time packet queue in the scheduler as a linked list, and the rate controller as a modified version of a calendar queue [1, 13]. Notice that the conceptual decomposition of the rate controller into a set of regulators does not imply that there are multiple physical regulators in an implementation; a common mechanism can be shared by all regulators. Each regulator has two functions: computing the eligibility times for ....

[Article contains additional citation context not shown here]

Dinesh Verma. Guaranteed Performance Communication in High Speed Networks. PhD dissertation, University of California at Berkeley, November 1991.

....(statistical) worst case, and this is what Tenet schemes do. However, this allows the burstiness of client traffic to be exploited for statistical multiplexing; and thus less resources need to be reserved for each connection than would be needed to provide deterministic ones. It has been shown in [Ver91] that, by providing statistical guarantees instead of deterministic ones, the utilization of a link by realtime traffic can reach roughly 30 when the probability of a packet s missing its deadline is guaranteed to be under 10 Gamma7 and the burstiness (defined as the peak to average ratio) of ....

Dinesh Verma. Guaranteed Performance Communication in High Speed Networks. PhD dissertation, University of California at Berkeley, November 1991.

....i.e. advance reservations help increase resource sharing acceptance gain, under the assumption that larger conferences will be more likely to make reservations in advance. 7 Related work A number of researchers have proposed techniques for providing probabilistic and statistical guarantees [18, 20] to improve the connection acceptance rates. Instead, resource sharing aims to improve the connection acceptance rate for deterministic guarantees by exploiting known relationships between channels. There are only two other related research efforts that we are aware of: the UCSD filters [17] and ....

Dinesh Verma. Guaranteed Performance Communication in High Speed Networks. PhD dissertation, University of California at Berkeley, November 1991.

.... clients cannot afford long waits for their transmissions to start [5] Scalability: The procedure must work also in very large networks and internetworks [6] Mathematical provability of the guarantees: Real time clients must be offered firm contractual commitments by the service provider [4, 11]. Flexibility in the specification of QoS and traffic parameters: The network layer clients must be given as much freedom as possible in specifying their QoS requirements and traffic descriptions; service classes can be easily defined and easily added on top of a flexible interface, while ....

Dinesh Verma. Guaranteed performance communication in high speed networks. Ph.D. Dissertation, Technical Report UCB/CSD 91/663, University of California, Berkeley, December 1991.

....is plotted along with the allocation gain g = m 2t formulated in the analysis. As the graph shows, the simulation results correspond fairly well to the analytical values. 6 Related work A number of researchers have proposed techniques for providing probabilistic and statistical guarantees [16, 17] to improve the connection acceptance rates. Instead, resource sharing aims to improve the connection acceptance rate for deterministic guarantees by exploiting known relationships between channels. There are only two other related research efforts that we are aware of: the UCSD filters [15] and ....

Dinesh Verma. Guaranteed Performance Communication in High Speed Networks. PhD dissertation, University of California at Berkeley, November 1991.

....throughout the network. Controlling the rate jitter at each switch along the path will only partially reconstruct the traffic pattern; the partially reconstructed traffic pattern obeys the same traf fic specification as the input traffic, but some inter packet spacing information is lost [17]. Notice that, if the traffic at the entrance to the network has a small rate jitter, controlling delay jitter inside the network will also keep the rate jitter small; however, controlling rate jitter would not automatically eliminate delay jitter. From the network s point of view, the partial ....

....minimum packet inter arrival time for the connection, AT k j is the time the k Gamma th packet on the connection arrived at switch j, and k j is the minimum number such that average packet inter arrival time in any I period does not exceed X ave . The computation of k j can be found in [17]. From this definition, we can see that ET k j AT k j always holds, i.e. a packet is never eligible before its arrival. Also, if we consider the sequence of packet eligibility times at switch j, fET k j g k=1;2; it always satisfies the (Xmin ; X ave ; I) traffic characterization. For a ....

[Article contains additional citation context not shown here]

Dinesh Verma. Guaranteed Performance Communication in High Speed Networks. PhD dissertation, University of California at Berkeley, November 1991.

....has included analytic approaches, as in [18] and [6] However, they treat only single queues, not taking into account the fact that the original CBR stream will not be equispaced any more after leaving the queue. This means that these methods will not be applicable to subsequent queues. Verma [19] has done multihop simulations, but his cross traffic is composed of CBR streams of equal bandwidths (among other cross traffic models) He observes bunching by measuring the change of the minimum inter cell spacing after a number of hops. He does not discuss, however, the implications for ....

Dinesh Chandra Verma. Guaranteed Performance Communication in High Speed Networks. PhD thesis, University of California, Berkeley, Berkeley, CA 94720, December 1991. Report No. UCB/CSD 91/663.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC