A. S. Tanenbaum, Computer Networks - third edition. Prentice Hall, 1996.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....executed. 4.1. Network Types and Payload Sizes We consider the following network types: 56 kbps (phone line modem) 1. 54 Mbps (T1, wireless) 10 Mbps (Ethernet) 100 Mbps (Ethernet) and 1 Gbps (Ethernet) Under ideal conditions, Ethernet networks can achieve a channel efficiency of over 90 [23]. As the number of network users increases, however, the channel efficiency drops to roughly 82 [23] In this study, we assume all the network connections sustain 80 of their maximum throughput. We evaluate the performance of the IPsec procedures using 3 ULP payload sizes: 1 kilobyte, 4 ....

....(phone line modem) 1. 54 Mbps (T1, wireless) 10 Mbps (Ethernet) 100 Mbps (Ethernet) and 1 Gbps (Ethernet) Under ideal conditions, Ethernet networks can achieve a channel efficiency of over 90 [23] As the number of network users increases, however, the channel efficiency drops to roughly 82 [23]. In this study, we assume all the network connections sustain 80 of their maximum throughput. We evaluate the performance of the IPsec procedures using 3 ULP payload sizes: 1 kilobyte, 4 kilobytes, and 63 kilobytes. TCP, which stands for Transmission Control Protocol, is a connection based ....

Tanenbaum, A., Computer Networks Third Edition, Prentice-Hall, Upper Saddle River, NJ, 1996.

....communication paradigm. For instance, datagram communication imposes no delivery order restrictions; messages are delivered at the destination in any order. On the other hand, a virtual circuit or FIFO channel imposes a total order, based on the transmission order, on the delivery of the messages [18]. There is, however, no reason to impose all ornothing receipt order requirements on all messages in all distributed programs. Instead, we ought to give the application programmer the opportunity to specify receipt order restrictions on a message by message basis, thus providing a greater ....

Tanenbaum, A. Computer Networks: Third Edition. Prentice-Hall, Inc., 1996.

....which extrapolates better. 1 INTRODUCTION Many applications use the exponential average function to estimate the future values of unknown generator functions. Examples are the estimation of the round trip time and its standard deviation in TCP [6] which is crucial for the TCP timer management [11]) estimation of the mean allowed cell rate in ATM (ATM Forum) and estimation of CPU burst times [10] Another application area is the dynamic resource (e.g. bandwidth) reservation in the Internet. Recently, the Differentiated Service (DiffServ) 2] architecture has been standardised to allow ....

A. S. Tanenbaum. "Computer Networks - Third Edition". Prentice-Hall International, Inc., 1996.

....From the first case study we discovered some of these, and then found that we were not the first to learn them. It has been proven that no protocol can exist such that two processes on a non error free network can each be aware of the precise state of the other. This is the twoarmy problem (Tanenbaum 1996, pp. 498 502) also described as the coordinated attack problem (Lynch 1996, pp 82 86) Also, computer networks typically respond to overloads by dropping messages, and network protocols typically respond to messages that are lost by timing out and retrying. Due to this, most computer networks ....

....Also, computer networks typically respond to overloads by dropping messages, and network protocols typically respond to messages that are lost by timing out and retrying. Due to this, most computer networks do not guarantee that separate messages will be received in the same order as they are sent (Tanenbaum 1996). Sequencing of messages is the province of higher level protocols. In practice, these limitations can be overcome, otherwise humanity would not be able to use ATM machines. Practical solutions such as the two phase commit (Date 1986) are commonly used for this. However, these facts create ....

Tanenbaum, Andrew S. 1996. Computer Networks Third Edition. Upper Saddle River, NJ: Prentice-Hall.

.... 1996; Gutwin and Greenberg, 1995) 2 The implications of non local area network architectures on data storage mechanisms and on reliable communication and group membership protocols have already been investigated and several Characteristics of wide area networks According to Tanenbaum (Tanenbaum, 1996, p.9f) the difference between local area networks and wide area networks is that wide area networks contain switching elements and local area networks do not. LANs have only a single transmission line that is or is not operable. In contrast, WANs consist of several transmission lines and ....

Tanenbaum, A. S. (1996): Computer Networks - third edition, Prentice Hall, Upper Saddle River, NJ.

....CER The Cell error rate indicates the fraction of cells delivered without error. SECBR The Severely Errorred Cell Block Ratio indicates the fraction of blocks corrupted. CMR The Cell Misinsertion Rate indicates the wrong destination cell rate. A description of these parameters can be found in [52]. When a traffic contract is specified thru the UNI interface, it includes a service class and a traffic descriptor. The traffic descriptor is a variable subset of ATM traffic parameters that characterize an ATM connection, depending of the service class. A traffic descriptor could include the ....

A. Tanenbaum, "Computer Networks -- Third Edition". Prentice-Hall International, 1996.

....methods. CSMA (Carrier Sense Multiple Access) requires carrier sensing before transmission. If the channel is free, the packet is transmitted immediately. Otherwise, it is rescheduled after a random timeout. The major limitation of CSMA is the hidden terminal and exposed terminal problem [11]. The hidden terminal problem illustrates that collision of data packets occurs at the receiver, rather than at the sender. Even if the channel is free within the sender s range, it may not be free at the receiver. In the exposed terminal problem, although the medium is sensed busy near the ....

Andrew S. Tanenbaum, "Computer Networks: Third Edition", Prentice Hall PTR, New Jersey, 1996.

.... the current number of messages from all clusters C k that C i will receive before an acknowledgement needs to be generated, corresponding to the number of remaining message slots reserved to C k : u j;i round = w j;i reserved P k (w k;i reserved Gamma c k;i reserved ) A slow start scheme [8, 10] is adopted to define the initial window size. The described mechanisms can be adapted to the case that multiple processes are active in the same cluster C i : ffl the external queue of cluster C i is logically decomposed into portions ExQ i k , one for each process P i k , dedicated to storing ....

A.S. Tanenbaum, Computer Networks - third edition, (Prentice Hall, Inc., 1996)

....and MACAW throughputs as a function of number of hops H are reported in Table 1. One can verify that throughput values match exactly the analytic predictions for a sendand wait protocol. The throughput is inversely proportional to the hop distance. CSMA throughput is slightly higher than FAMA [12] because of RTS CTS overhead in the latter. MACAW exhibits the lowest throughput among the three protocols due mostly to the additional control frames. Number of Hops CSMA FAMA MACAW 1 1838.4 1476.5 971.7 2 921.3 718.7 485.8 3 614.8 475.4 323.9 4 461.4 355.3 242.9 5 369.2 287.5 194.3 6 307.7 239.1 ....

Andrew S. Tanenbaum, "Computer Networks: Third Edition", Prentice Hall PTR, New Jersey, 1996.

....fail in a system. Techniques involve replacing the faulty element, either using a hot standby or a warm standby or even accepting some downtime and repairing the unit off line. Existing traffic may also be rerouted via another redundant path from the source to its destination by routing algorithms [2, 12]. In telecommunications networks, fault tolerance has progressed to considering the recovery of failures such as reductions in the speed or capacity of a service. For instance, a telecom switch might reduce the maximum number of calls that can be handled if a processor failure is encountered. Thus ....

A. S. Tanenbaum, Computer Networks Third Edition, Prentice Hall, 1996.

....an example of WaveLAN MAC transmissions using the same set of data and stations as the previous IEEE 802.11 example, Figure 2. 5 [17] The WaveLAN CSMA CA will avoid the majority of those collisions which would otherwise occur at the end of an ongoing transmission if a 1 persistent CSMA scheme [23] was applied. With only a 1 persistent CSMA scheme, all stations that had CHAPTER 2. BACKGROUND 28 to defer until the end of the ongoing transmission will try simultaneously to send their frames when the medium becomes available. The random backoff delay will significantly increase the ....

....are at the user level, so user space is used. When the client sends out a request, it is copied from user buffer space to kernel buffer space and vice versa for the server. In order to determine whether the copying process is significant, ping , a utility to send ICMP ECHO REQUEST packets [23], was used to measure the round trip time between the two stations for the same set of packet sizes. Since the receiver sends back an ICMP ECHO REPLY packet from the kernel, this eliminates two copying processes from the kernel to user space and vice versa at the receiver. The results are shown in ....

Tanenbaum, Andrew S. Computer Networks - Third Edition. Upper Saddle River, New Jersey: Prentice Hall PTR, 1996.

....CSMA and FAMA throughputs as a function of number of hops H are reported in Table 1. One can verify that throughput values match exactly the analytic predictions for a send and wait protocol. The throughput is inversely proportional to the hop distance. CSMA throughput is slightly higher than FAMA [17] because of RTS CTS overhead in the latter. Number of Hops CSMA FAMA 1 1838.4 1476.5 2 921.3 718.7 3 614.8 475.4 4 461.4 355.3 5 369.2 287.5 6 307.7 239.1 7 263.4 204.7 Table 1. Throughput (Kbps) Single TCP Connection, Variable Number of Hops, W = 1460B. Next, we set W = 32KB. Here, the TCP ....

Andrew S. Tanenbaum, "Computer Networks: Third Edition", Prentice Hall PTR, New Jersey, 1996.

No context found.

A. S. Tanenbaum, Computer Networks - third edition. Prentice Hall, 1996.

No context found.

Andrew S. Tanenbaum "Computer networks (Third edition)", Prentice-Hall International Inc, 1996.

No context found.

A. S. Tanenbaum: "Computer Networks, Third Edition ". Prentice-Hall Inc. (1996).

No context found.

A. S. Tanenbaum: "Computer Networks, Third Edition ". Prentice-Hall Inc. (1996).

No context found.

Andrew S. Tanenbaum. Computer Networks - Third Edition. Prentice-Hall International, Inc, 1996.

No context found.

Tanenbaum A. S. Computer Networks - thirdedition. Prentice Hall, Upper Saddle River, NJ, 1996.

No context found.

Tanenbaum, A.: "Computer Networks: Third Edition." ISBN 0-13-349945-6, Prentice Hall, 1996.

No context found.

Tanenbaum, A. S., Computer Networks Third Edition, Prentice Hall PTR, 1996.

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