| J. Walrand and P. Varaiya, High Performance Communication Networks, 2 Ed, Morgan Kaufman, 1999. |
....(FEC) nor Automatic Repeat reQuest (ARQ) are implemented in the simulations described in Section 7.2.2. Trac Sources In the simulations we use three trac types: Voice, Data, and Media, see Table 7.1. The incoming trac was generated using a Poisson distribution for the packet inter arrival time [32, 64], and a Pareto distributed packet size [13] except for the VOICE trac class, which was chosen to have a xed packet size to comply with current wireless standards. The Poisson cumulative distribution function is given by (7.6) and the Pareto cumulative distribution by (7.7) F (t) 1 e t ....
J. Walrand and P. Varaiya. High-Performance Communications Networks. Morgan Kaumann Publishers, 2 edition, 2000.
....of incoming requests, it would be possible to re ne this procedure and improve the VPN admission control decision. Similar to the case of circuit switched networks, the blocking probability for a call request depends on factors such as the duration of the call and the routing algorithm used [Walrand96] The problem is harder in VServ where VPN topologies are more complex than single connections, but VServ has the advantage that subsequent recon guration of a VPN s topology and resource allocation is possible in a non disruptive manner through the resource revocation described in Chapter 7. ....
Jean Walrand and Pravin Varaiya. High-Performance Communication Networks. Morgan Kaufmann, 1996. (p 98)
....in everyday s life. We propose to use network design technology to analyze and design SoCs. In other words, we view a SoC as a micro network of components. We postulate that SoC interconnect design can be done using the micro network stack paradigm, which is an adaptation of the protocol stack [19] (Figure 1) Thus the electrical, logic, and functional properties of the interconnection scheme can be abstracted. SoCs differ from wide area networks because of local proximity and because they exhibit much less non determinism. Local, high performance networks (such as those developed for ....
J. Walrand, P. Varaiya, High-Performance Communication Networks. Morgan Kaufman, 2000.
....link itself. Shannon s equation gives the relation between available data rate R for a channel with bandwidth B with a Signal to Noise Ratio (SNR) as : R = B log 2 (1 SNR) This is the theoretical limit and there can be additional loss because of multipath fading, Doppler shifts, and bit errors [19]. The second rung of reduction in throughput occurs at the Physical layer. An 802.11b frame is shown in Figure 11. Each frame comprises of 24 bytes of Physical Convergence Protocol Layer (PLCP) preamble and header. This PLCP preamble is then augmented with rest of the MAC Protocol Data Unit ....
....of view, it severely impacts the performance. It is evident that in order to optimize the network performance, all layers in the protocol stack should adapt to the variations in the wireless link appropriately. Further, this should be done while considering the adaptive strategies at other layers [19]. 5.3 Performance Improvements The performance improvement research for IEEE 802.11b can be broadly categorized into three classes based on the locality of the optimizations involved. These categories are mainly: MAC performance optimization, Network or Transport layer enhancements, and ....
[Article contains additional citation context not shown here]
J. Walrand and P. Varaiya. "High-Performance Communication Networks". Morgan Kaufman, 2nd edition, 2000.
....not allocate its peak rate to every individual con nection, but perform resource overbooking. At the lowest level, overbooking uses both buffering (traffic peaks are temporarily stored) and statistical multiplexing (based on the expectation that traffic peaks do not all occur at the same time) [7]. If only CBR VTs are used, then access or edge nodes that multiplex small or medium numbers of connections are not able to perform a large amount of statistical multiplexing because efficient statistical multiplexing requires a small ratio between connection rate and the VT bit rate [8] Further, ....
P. Varaiya and J. Walrand, High-Performance Communication Networks. Morgan Kaufmann, San Francisco, October 1996.
....occurs inside the extended high speed LANs. This results in short mean round trip time, and causes fast window openings giving rise to burstiness and packet loss in TCP [5] Third, the rate mismatch brings about bottleneck at the switch and the low speed link may cause packet drop in this switch [7]. Hop by hop flow control, also known as backpressure flow control, is implemented in the data link layer of the OSI reference model. Before buffer gets full, a congested switch temporarily prevents input switches from sending packets in order to prevent data packet drop. In particular, in ....
J. Walrand, P. Varaiya. High-Performance Communication Networks. Morgan Kaufmann Publishers, 2000.
....be arranged wisely. However, if a massive traffic will be whelming such a network, probably similar dimensioning as in common telecommunication networks may be expected. Thus, it is of vital importance to know basics of blocking economy relations. For further scopes, see for example Walrand et al. [17] and Roberts et al. [18] ....
Walrand, J.and Varaiya, P., High-Performance Communication Networks. Morgan Kaufmann Publishers, San Francisco 1996.
....occurs in side the extended high speed LANs. This results in short mean round trip time, and causes fast window openings giving rise to burstiness and packet loss in TCP[5] Third, the rate mismatch brings about bottleneck at the switch and the low speed link may cause packet drop in this switch[7]. Hop by hop flow control, also known as backpressure flow control, is implemented in the datalink layer of the OSI reference model. Before buffer gets full, a congested switch temporarily prevents input switches from sending packets in order to prevent data packet drop. In particular, in ....
J. Walrand, P. Varaiya. High-Performance Communication Networks. Morgan Kaufmann Publishers, 2000.
....our paper: protection paths and normal paths need not be managed in the same way. A. Different Routing Algorithms Several sophisticated algorithms for the calculation of paths in a network have been developed, and much work has also gone into the computation of protection paths (e.g. 3] 4] [5]) The metric behind calculating the normal and protection paths may easily be different, depending on the application. A simple example illustrates the point. In an optical network when a new wavelength # needs to be routed through the network, the metric frequently used is to choose the path ....
J. Walrand and P. Varaiya, "High-Performance Communication Networks, " Morgan-Kaufman, 2000 Second Edition.
....competition environments are discussed. In [GSW94b, GSW94a] the Internet is modeled as a collection of servers offering services with different delay (priorities) Prices are adjusted in a decentralized manner based on measurements of the demand (average flow rate) and the observed delay. WV96, Section 8.4] investigates time of day pricing (with two periods) for a single resource, and discusses how the aggregate demand for each of the two periods is affected by prices. HS95] considers a model of a single link which multiplexes heterogeneous users and presents numerical results showing ....
....(e.g. 5 Gamma 8 msec for a 155 Mbps link) this stops to occur and increasing the buffer size has a smaller effect on the overflow probability. In addition, the logarithm of the overflow probability in both of these regimes We have not taken into account propagation and packetization delay [WV96, page 204] is almost linear with the buffer size. The above indicate that there are two dominant time scales for MPEG 1 traffic: fast time scales which are important for overflow when the buffer size is small and slow time scales which are important for overflow when the buffer size is large. ....
[Article contains additional citation context not shown here]
J. Walrand and P. Varaiya. High-Performance Communication Networks. Morgan Kaufmann Publishers, Inc., San Francisco, CA, 1996.
No context found.
J. Walrand and P. Varaiya, High Performance Communication Networks, 2 Ed, Morgan Kaufman, 1999.
No context found.
J. Walz# d and P. Varaiya. High-Performance C ommunication Networks. Morgan Kaufmann,San Mateo,Cal2,: second edition,2000.
No context found.
J. Walrand and P. Varaiya, High-Performance Communication Networks. San Francisco, CA: Morgan Kaufmann, 1996.
No context found.
J. Walrand, P. Varaiya, High Performance Communication Networks, Morgan Kaufmann, San Francisco, California, 2000.
No context found.
J. Walrand, P. Varaiya, High-Performance Communication Networks. Morgan Kaufman, 2000.
No context found.
J. Walrand and P. Varaija. High Performance Communication Networks. Morgan Kaufmann,San Francisco, 2000.
No context found.
J. Walrand, P. Varaiya, High-Performance Communication Networks. Morgan Kaufman, 2000.
No context found.
J. Walrand, P. Varaiya, High-Performance Communication Networks. Morga n Kaufman, 2000.
No context found.
J. Walz# d and P. Varaiya. High-Performance C ommunication Networks. Morgan Kaufmann,San Mateo,Cal2,: second edition,2000.
No context found.
P. Varaiya and J. Walrand. High-Performance Communication Networks. Morgan Kaufmann, 2000. Chapter 7.
No context found.
P. Varaiya and J. Walrand. High-Performance Communication Networks. Morgan Kaufmann, 2000. Chapter 7.
No context found.
J. Walrand and P. Varaiya, High Performance Communication Networks, 2nd ed., Morgan Kaufmann, San Francisco, 2000.
No context found.
J. Walrand, P. Varaiya, High Performance Communications Networks, Second edition, Morgan Kaufman, 1999.
No context found.
Walrand, Jean, and Pravin Varaiya, High-Performance Communication Networks. San Francisco: Morgan Kaufmann, 1996.
No context found.
J. Walrand and P. Varaiya, High-Performance Communication Networks, Morgan Kauffmann, San Francisco, CA, 1996.
First 50 documents Next 50
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