D. P. Bertsekas, R. Gallager Data Networks, Englewood Cliffs, NJ: Prentice-Hall 1987. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Design Space for Distributed Search (DS)² - A System.. - Mischke, Stiller (2002) (Correct)
....form, makes a random table structure search deterministic while avoiding flooding. However, the synchronization overhead incurred can be substantial. Specific attention is due in networks containing loops in order to avoid a count to infinity problem. In distance vector or Bellman Ford IP routing [4], 10] routers advertise their distance to other routers. Even though in the stable state, every router has complete information on distances and next hops towards a peer router, information is aggregated (and distributed) in that only the next hop but not the entire path is stored. For name and ....
O. Bertsekas, R. Gallager: Data Networks, 2nd Edition; Prentice -Hall, U.S.A., 1992.
Service Specific Connection Oriented Protocol (SSCOP) with.. - Hébuterne, Monin (Correct)
....When the connection is established, the Sender may send data as long as it has credits available, which correspond to available buffer capacity at the Receiver s end. In case of lost data, the Receiver requests retransmission to the Sender, according to a selective retransmission scheme (see e.g. [1]) The protocol makes use of three types of Protocol Data Units (PDUs) Sequences Data PDUs (SD PDU) Poll PDUs and Stat PDUs. SD PDUs, refered to as data packets or frames, are variable length packets which carry user s data, and are identified by their sequence number. Poll PDUs are ....
D. Bertsekas, R. Gallager: Data Networks. Prentice Hall, second edition 1992.
Service Differentiation Through End-to-end Rate.. - Nandagopal, Kim.. (1999) (3 citations) (Correct)
....decrease (LIMD) rate control algorithm in order to provide service differentiation through rate control. In our approach, each flow belongs to a service class, which has an associated rate weight . The goal of our rate control algorithm is to achieve weighted max min fair rate allocation [2], wherein contending flows that traverse the same bottleneck link are allocated rates in proportion to their rate weights. ffl We correct several design flaws in the original WTCP rate control algorithm that limited its applicability to very low bandwidth links O(10 Kbps) As a result of the ....
....rate guarantees are very hard to provide, since the resources of the wireless channel keep changing continually. Hence, in this paper we focus on achieving relative service differentiation via weighted max min fairness, which we define below. Let us first start with defining max min fairness [2]. Consider a set of flows f1: ng and a rate allocation vector for the flows R = r 1 : r n ] such that r i r j if i j without loss of generality. Then R is a max min fair rate allocation if it is impossible to increase the rate allocation r i without causing the decrease of some r j r i . ....
D. Bertsekas and R. Gallager Data Networks. Prentice Hall, 1997.
End-to-End Congestion Control Schemes: Utility Functions.. - Kunniyur, Srikant (2000) (82 citations) (Correct)
....derived from their utility functions. This allows one to model the heterogeneity in the needs of different applications. It is now well established that various notions of fairness can be defined in terms of appropriate utility functions [13] 25] 22] While the well known maxmin fairness [2] cannot be defined in terms of a single utility function, it can still be defined in terms of a sequence of utility functions [13] Thus, another motivation for allowing different utility functions for different users is to develop a model that would potentially allow one to study interactions ....
D. Bertsekas and R. Gallager Data Networks. Prentice Hall, Englewood Cliffs, NJ, 1987.
Arq Protocols For High Speed Hardware Implementation - Gopal, Rom (Correct)
....the protocol [1] In this paper, we investigate one approach to designing link control protocols to simplify certain aspects of hardware implementation. Most Data Link Control protocols use one of two basic mechanisms to recover from messages lost due to errors: Go back N or Selective Repeat (SR) [2,3]. The main advantage of Go back N is that the implementation of the receiver is simple. There is very little state information to maintain and buffer management is accomplished through a single FIFO buffer. A large numbers of variations on the Go Back N protocol have appeared in the literature ....
D. Bertsekas and R. Gallager Data Networks, Prentice Hall, Inc., New-Jersey, 1987.
Lyapunov-Based Stability Analysis for REM - Congestion Control Orhan (Correct)
No context found.
D. P. Bertsekas, R. Gallager Data Networks, Englewood Cliffs, NJ: Prentice-Hall 1987.
Distributed Algorithms for Fair Bandwidth Allocation .. - Yaïche.. (2000) (Correct)
No context found.
D. Bertsekas and R. Gallager: Data networks. Prentice-Hall, 1987.
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