A. S. Tanenbaum, Computer Networks, Third Edition, Prentice Hall Inc., 1996, pp. 367-370.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....or not they apply in the regime of sensor networks. Many variations of the CSMA [8, 17] strategy can be found in the literature. Listening to the channel before transmission to exploit information about other users is a very common approach found in almost all CSMA schemes, except pure ALOHA [15]. Another approach is to use explicit positive or negative acknowledgments to signal collision and perform necessary random delay before retransmit. ALOHA takes this approach. IEEE 802.11 [2] uses it in addition to listening. Other CSMA schemes rely on time synchronized slotted channel, such as ....

A. Tanenbaum. Computer Networks. Prentice Hall Inc., 1981.

....for the agent to achieve his goal. In order to have a basis for comparison of performances of our team formation algorithms, we introduce the Ant hill algorithm (based on fully cooperative agents called ants here) that is an adaptation of the static routing algorithm in computer networks, see [41]. Abstracting from our particular interpretation of the example, one can observe that the essential phenomenon of the team formation process relies on the fact that the agents interactions are local and distributed, and that each agent has its own goal. These goals may be mutually dependent, ....

....assumption assures maximal spread of information in the system. 6. 1 Ant hill algorithm In order to have a basis for comparing performances of the team formation algorithms we introduce the Ant hill algorithm, which is an adaptation of the standard static routing algorithm in computer networks [41]. The agents modeled by the algorithm can be considered as fully cooperative, so that they are called ants. Ant hill algorithm implements the idea that the main and persisting goal of each ant is to reach a situation, where all resources are possessed by ants that need them. So that, the ants do ....

A. S. Tanenbaum. Computer Networks. Prentice-Hall Inc.Englewood Cliffs, New Jersey, 1981.

....for the agent to achieve his goal. In order to have a basis for comparison of performances of our team formation algorithms, we introduce the Ant hill algorithm (based on fully cooperative agents called ants here) that is an adaptation of the static routing algorithm in computer networks, see [22]. As the working example we consider a network of servers and mobile agents that can move from one server to another in order to look for resources scattered randomly on the servers. To enhance cooperation between the agents, the entry to some servers is forbidden for some agents. Thus, if a ....

....This assumption assures maximal spread of information in the system. 5 Ant hill algorithm In order to have a basis for comparing performances of the team formation algorithms we introduce the Ant hill algorithm, which is an adaptation of the standard static routing algorithm in computer networks [22]. The agents modeled by the algorithm can be considered as fully cooperative, so that they are called ants. Ant hill algorithm implements the idea that the main and persisting goal of each ant is to reach a situation, where all resources are possessed by ants that need them. So that, the ants do ....

A. S. Tanenbaum. Computer Networks. Prentice-Hall Inc.Englewood Cliffs, New Jersey, 1981.

....of groups. 717 1. Introduction In a shared memory parallel processing environment, shared variables are used to communicate information between parallel processes. These shared variables need protection from updating by more than one process at a time. They are placed within a critical section [5, 11]. On the negative side, guarding of shared variables will result in a serial execution of parallel processes within a parallel structure (i.e. Fork Join construct [5] To minimize this negative effect, different scheduling algorithms have been developed [3,5,6,10] to order the processes which ....

Tanenbaum, A.S., Operating Systems: Design and Implementation, Prentice-Hall Inc., Englewood Cliff, New Jersey, 1987.

....reaches a receiver, it is always ACKed if it is in sequence. An error is detected at the sender by either a timer interrupt or by a NACK from the receiver. At this point, if the sender backs up to the first packet in error and restarts the transmission, the strategy is referred to as go back n [9]. If, on the other hand, the sender retransmits only that packet which is in error, the strategy is called selective repeat. The state machine of go back n is simpler than that of selective repeat. Also, the selective repeat protocol may require a large receive buffer to cache packets which are ....

Tanenbaum, A.S., Computer Networks, Prentice-Hall Inc., Englewood Cliffs, NJ 07632, 1988.

....that when the switch to RT mode broadcast message is received, each node s transmission queue contains an MTU packet, and that the acknowledgement packet is 64 byte long, the minimum Ethernet packet length. When K nodes on an Ethernet want to send packets simultaneously, it has been shown in [And88] that the mean number of contention slots is (1 Gamma 1 K ) 1 GammaK (3) and each contention slot is 51.2 sec. Therefore, for a 16 mode Ethernet segment, the average delays for each non RT node to drain an MTU packet and send an acknowledgement packet are 3,450 135=3,585 sec and 680 135 = ....

Andrew S.Tanenbaum. Computer Networks. Prentice-Hall Inc., 1988.

....2 For the data to be safely sampled the following must be true: Max Time Until Data Valid Data Setup Time Min Time Until Data Sampled or 15 2.5 ICLK Period Propagation Delay or ICLK Period 17.5 Gamma Propagation Delay Since the minimum ICLK period is 20ns, this will always be true. [14]. The 32 bit CRC checksum appears in the final two words of the packet. The CRC block can either check or generate this value. A CRC code uses polynomial division to check the integrity of messages. It treats the k bits in a transmitted message as the coefficients of a polynomial with k terms. It ....

A. S. Tanenbaum. Computer Networks. Prentice-Hall Inc., Englewood NJ, 1988

....briefly described below. 4. 1 S3.mp Data Link Level Protocol Sun Microsystems S3.mp distributed shared memory computer uses workstations connected with a gigabit serial link to form a parallel computer [9] The data link level protocol used in the serial link, which operates over a slotted ring [10], was first developed in the MurM verification system [3] The description of this protocol is about 1200 lines of MurM code. For a ring with 4, 6, and 8 slots, there are 61, 85, and 107 state bits, respectively. 4.2 FLASH Examples Many of the benchmarks are portions of the Stanford FLASH ....

A. S. Tanenbaum, Computer Networks, chapter 7, pp. 312313. Prentice-Hall Inc., 1981

....nodes detect this and terminate transmission. CHAPTER 1. INTRODUCTION 4 Packet Contention Contention Idle Interval Slots Time Packet Packet Packet Figure 1: CSMA CD can be in one of three states : contention, transmission, or idle. They then wait for a random time, and repeat the whole process [Tan88] Hence, the network can be modeled as shown in Figure 1, consisting of alternating contention and transmission periods, with idle periods occurring when all nodes are quiet. The random waiting period is in terms of contention slots. After a collision, time is divided into discrete slots whose ....

....as a software module that augments the existing Ethernet device driver. Along with token passing protocols, we considered other collision free protocols such as the Basic bit map method, Broadcast Recognition with Alternating Priorities and the MultiLevel Multi Access Protocol, described in [Tan88] But, the implementation of these protocols requires that all the cards on the network be perfectly synchronized and the physical layer hardware implement the protocol. In these protocols, the transmission window of a node is determined by a bitmap circulating in the channel. This bitmap is ....

[Article contains additional citation context not shown here]

A. Tanenbaum. Computer Networks. Prentice-Hall Inc., 1988.

....units at the disk level perform well, we present a prototype implementation. The prototype is based on the logstructured prototype of LD (log structured logical disk or LLD, see [4] which originally did not support concurrent ARUs. We use the same combination of LLD and the Minix file system [17] as in [4] which shows excellent performance on Write operations (utilizing 85 of the available bandwidth as compared to 13 for the Minix file system by itself) and good performance on Read operations (depending on the workload) We also use the same experiments as in [4] for our performance ....

A. S. Tanenbaum. Operating Systems: Design and Implementation. Prentice-Hall Inc., Englewood Cliffs, N.J. 07632, 1987.

....refinement mappings, simulation relations, etc. in different works [Lam83,LT87,AL91,BBLS92,CGL92,Kur94,LV95,McM97] Also our choice of case studies is not new. Other correctness proofs for Tomasulo s algorithm can be found in [DP97,McM98] the sliding window protocol is taken from [Tan92] 2 A Verification Problem Reactive modules. Reactive modules is a formalism for the modular description of systems with heterogeneous components. The definition of reactive modules can be found in [AH96] here we give only a brief introduction. The state of a reactive module is determined by ....

Andrew S. Tanenbaum. Computer Networks. Prentice-Hall Inc., 1992.

....that the consumer consumes the messages in the correct order, a sequence number is associated with each message. The receiver can then assemble the message sequence correctly by looking at the sequence number. For the protocol to work correctly, at least 2 WINSIZE sequence numbers are needed [Tan92] The sender module has two arrays msgBufferS of messages and busy of boolean values, each of size WINSIZE . A variables windowS contains the size of the current window of unacknowledged messages. A new message can be produced only when windowS is less than WINSIZE . Whenever a new message ....

Andrew S. Tanenbaum. Computer Networks. Prentice-Hall Inc., 1992.

No context found.

A. S. Tanenbaum, Computer Networks, Third Edition, Prentice Hall Inc., 1996, pp. 367-370.

No context found.

A. S. Tanenbaum, Computer Networks, Third Edition, Prentice Hall Inc., 1996, pp. 276-287.

No context found.

A. S. Tanenbaum, Computer Networks, Third Edition, Prentice Hall Inc., 1996, pp. 367-370.

No context found.

A. S. Tanenbaum, Computer Networks, Third Edition, Prentice Hall Inc., 1996, pp. 276-287.

No context found.

Andrew S. Tanenbaum. Computer Networks. Prentice Hall Inc.

No context found.

Andrew S. Tanenbaum, Operating Systems: Design and Implementation, Prentice-Hall Inc., 1987.

No context found.

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

No context found.

Andrew S. Tanenbaum, Computer Networks, Third Edition, Prentice Hall Inc., 1998.

No context found.

#9# Tanenbaum, A.S., Computer Networks, Prentice-Hall Inc., Englewood Cli#s, NJ 07632,

No context found.

A. Tanenbaum, Computer Networks, Prentice-Hall Inc. (1981).

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