A. S. Tannenbaum, "Computer Networks," Prentice Hall, Inc., New Jersey, 1981. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
A Recoverable Object Store - Strom, Yemini, Bacon (1988) (6 citations) (Correct)
....logical machine: Piecewise Determinism of each RU: The behavior of any recovery unit can be reconstructed by restoring a previous state and replaying its input messages. Reliable, FIFO channels between RUs: These can be implemented by any of a number of communication protocols (see e.g. TAN 81) Fail stop [SCH 83: all failures are detected before any event resulting from them is made visible ( committed ) outside the logical machine. THO212 1 88 OOOO ff215501.00 1988 IEEE 215 Stable Storage: recovery units store their current state in volatile storage, which is lost upon their ....
Tannenbaum, A. S., "Computer Networks", Prentice Hall, 1981. 221
Syllabus CSI516 Computer Communication Networks - Maniatty (2000) (Correct)
....software. There is also a theoretical analysis component which presumes a basic knowledge of data structures, computer architectures, operating systems, digital logic, probability and calculus. 4 Some Additional Resources Some good books for a qualitative look at networking include Tannenbaum s [7] and Comer [2] for a qualitative architectural approach (including logic design) Halsall [3] gives a more quantitative overview of network design. Peterson and Davie [5] provide an interesting alternative approach to computer networks. Stallings [6] and Black [1] provide an overview of high ....
A. S. Tannenbaum. Computer Networks. Prentice Hall, Englewood Cli s, NJ USA, 3 edition, 1996. 5
QoS Routing Mechanisms and OSPF Extensions - Guerin, Kamat, Orda.. (1997) (147 citations) (Correct)
....raise the link s attractiveness for future traffic instead of lowering it. Evidence that such considerations Guerin, et al. Expires 30 September 1997 [Page 21] Internet Draft QoS Routing Mechanisms 25 March 1997 are not speculative, but similar scenarios have been encountered, can be found in [Tan89]. Concluding with an example, assume a link with bandwidth of 8 Gbits s = 10243Bytes s, its encoding would consist of an exponent value of 6 since 10243=4; 096 86, which would then have a granularity of 86 260 kBytes s. The associated binary representation would then be (110) 0 1000 0000 ....
A. Tannenbaum. Computer Networks. Addisson Wesley, 1989.
Tailoring a Self-Distributing Architecture to a Cluster.. - Ronald Moore Bernd (2000) (Correct)
....recipient. The switches between the horizontal and vertical buses have small associative memories similar to the directories in the DDM. Hierarchical systems can be built by building grids of grids. Both broadcasting and multicasting are supported. Fast Ethernet: IEEE Standard 802.3, see e.g. [14]) is perhaps the most commonly used network technology for Cluster Computing today [12] It presents an attractive tradeoff between cost and performance. Better still, it is already installed, or soon to be installed, in many locations, and is thus effectively free . In a flat (non hierarchical) ....
A. Tannenbaum. Computer Networks. Prentice Hall, 3rd edition, 1996.
Self-Stabilization In Distributed Systems - A Short Survey - Brzezinski, Szychowiak.. (2000) (4 citations) (Correct)
....Communication protocols We start the presentation of stabilizing distributed algorithms with some communication protocols, a very important subject in distributed systems. The sliding window and alternating bit are fundamental asynchronous communication protocols. The sliding window technique [56] consists of a sequence number generator on the side of the transmitter process which is responsible for enumerating every message sent through the channels, and an acknowledgment mechanism used by the receiver. In the case of suspected message lost, a retransmission is involved. Gouda and Multari ....
A. S. Tannenbaum, "Computer Networks", Prentice-Hall, Englewood Clifs, 1991.
-213 Handout 9: Network Programming - Randal Bryant David (Correct)
....RFCs are typically written for developers of Internet infrastructure, and thus are usually too detailed for the casual reader. However, for authoritative information, there is no better source. There are many good texts that cover basic concepts of computer networking [3, 4, 11]. The great technical writer W. Richard Stevens developed a whole series of classic texts on such topics as advanced Unix programming [5] the Internet protocols [6, 7, 8] and Unix network programming [10, 9] Serious students of Linux systems programming will want to study all of them. ....
A. Tannenbaum. Computer Networks, Third Edition. Prentice-Hall, 1996.
Collision Avoidance and Resolution Multiple Access with .. - Garces.. (1997) (17 citations) (Correct)
....and a station can continue to transmit in this position as long as it has data to send. Stations compete to acquire the right to be in the transmission group based on a tree splitting algorithm. CARMA NTG is more attractive than previous dynamic reservation schemes for wireless nets [8] 9] [15] [17] in that it does not require time synchronization and in that it does not require the definition of control frames of fixed duration over which the slots for the data frame can be reserved. It is also more attractive than token passing schemes in that no fixed schedule exists for passing the ....
A. S. Tannenbaum, "Computer Networks," Prentice Hall, Inc., New Jersey, 1981.
Static and Dynamic Low-Congested Interval Routing Schemes - Cicerone, Di Stefano (1998) (Correct)
.... generation of INMOS Transputer C104 Router chips together with wormhole routing [22] In fact, the wormhole routing approach was introduced with the basic goal of reducing the negative dependency of the efficiency of the routing strategy from the length of the paths routed by the messages (see [32, 25] for a detailed description) In such a paradigm a message is divided into flits. The header flit forces the route, while all the remaining ones follow it in a pipeline fashion. If the header finds a link already in use, it is blocked until the link becomes available. Assuming that each flit can ....
A.S. Tannenbaum. Computer Networks. Englewood Cliffs, Prentice Hall, 1988.
Resource Management in Multi-hop Ad Hoc Networks - Maltz (1999) (2 citations) (Correct)
....among all the nodes in the network. The traditional formulation of the problem of computing routes in the network is itself a similar distributed computation problem, and there are two classes of classic routing algorithms that solve the distributed routing problem: Distance Vector and Link State [46]. In the routing problem, each node has local information, namely the set of its neighbors, that must be shared with the other nodes in order to compute routes. For the networks of the size in which we are interested, either the Distance Vector or the Link State algorithms could be trivially ....
....the packets sources eventually learn the rates at which they can send packets without causing congestion. The path state mechanism for DSR should enable the same style of congestion control, even when unidirectional links are in use. The Asynchronous Transfer Mode (ATM) network specification [46] deals extensively with both the use of pathidentifiers and the provision of QoS [15] However, the path identifiers used in ATM are only unique between pairs of switches, and not globally unique as in our protocol. While it would be possible to completely adopt the ATM model and eliminate global ....
Andrew S. Tannenbaum. Computer Networks. Prentice Hall, third edition, 1996.
The Las-Vegas Processor Identity Problem (How and When to Be.. - Kutten, al. (1993) (Correct)
....of a problem altogether: assume that each process is fabricated with a unique identifier. This assumption seems especially reasonable where the processes are physical processors, and an ID which is guaranteed to be unique is hardwired in them (see, for example, the IEEE 48 Bit Standard [Tan81] In some E mail: kutten watson.ibm.com. y E mail: rafail melody.berkeley.edu. Supported by an NSF postdoctoral fellowship and ICSI. Research partly done while visiting IBM T.J. Watson Research Center. z E mail: boaz theory.lcs.mit.edu. Supported in part by DARPA contracts N00014 92 J 4033 ....
Andrew Tannenbaum. Computer Networks. Prentice Hall, 1981.
How and When to Be Unique (Extended Abstract) - Kutten, al. (1993) (Correct)
....of a problem altogether: assume that each process is fabricated with a unique identifier. This assumption seems especially reasonable where the processes are physical processors, and an ID which is guaranteed to be unique is hardwired in them (see, for example, the IEEE 48 Bit Standard [Tan81] In some cases, however, one cannot get away with this approach. For instance, the processes might be virtual (i.e. software) processes that are spawned using the same code, and thus they are created identical. In this setting, the processes typically run on the same physical machine, and the ....
Andrew Tannenbaum. Computer Networks. Prentice Hall, 1981.
Acyclic Orientations for Deadlock Prevention in Usual.. - Bermond, Di Ianni.. (Correct)
....for G. Many different models can be defined for message routing in a communication network depending on the way each message moves through the network and it is buffered along the path. In this paper, we consider the packet routing (or packet switching) and the wormhole routing models (see [23, 9, 13, 20]) In the former model each message consists of a single entity (packet) which moves through the network and a set of buffers is assigned to each vertex. A buffer is the basic storage unit able to contain a single packet. Every time a packet is received by a vertex v, it is first stored in one ....
A.S. Tannenbaum. Computer Networks. Englewood Cliffs, Prentice Hall, 1988.
An Authentication Protocol for Mobile Devices - Simões, Alves, Rogado, .. (Correct)
....perform well, which lead us to a simple conclusion: the protocol must be based solely on symmetric cryptography and digest algorithms. Furthermore, we want it to be simple, yet highly secure. One of the classic problems in authentication based on a shared key is the distribution of that key [Tanenbaum96]: we need a secure channel to distribute the key, which will, in turn, create a secure channel We solved this problem in a very simple but effective way, by using the client s PC. In fact, the protocol needs an internal key, which should be acquired via a browser on the client s PC and then ....
Andrew Tannenbaum. Computer Networks. Prentice Hall, 1996.
Unknown - (Correct)
No context found.
A. S. Tannenbaum, "Computer Networks," Prentice Hall, Inc., New Jersey, 1981.
Optimistic Recovery in Distributed Systems - Research Seminar On (Correct)
No context found.
TANNENBAUM, A. S. Computer Networks. Prentice-Hall, Englewood Cliffs, N.J., 1981.
Acyclic Orientations for Deadlock Prevention in Usual.. - Bermond, Di Ianni.. (1996) (Correct)
No context found.
A.S. Tannenbaum. Computer Networks. Englewood Cliffs, Prentice Hall, 1988.
Unknown - Status Of This (Correct)
No context found.
A. Tannenbaum. Computer Networks. Addisson Wesley, 1989.
Tor: The Second-Generation Onion Router - Dingledine, Mathewson, Syverson (2004) (14 citations) (Correct)
No context found.
A. Tannenbaum. Computer networks, 1996.
Static and Dynamic Low-Congested Interval Routing Schemes - Cicerone, Di Stefano.. (1998) (Correct)
No context found.
A.S. Tannenbaum. Computer Networks. Englewood Cli s, Prentice Hall, 1988.
On-line Resource Management with Application to.. - Leonardi.. (1995) (7 citations) (Correct)
No context found.
A.S. Tannenbaum, Computer networks, Prentice Hall, 1989. 27
Universal Packet Analyzer - A Network Packet Filtering tool - Parameswar, Pooch (1996) (Correct)
No context found.
A. S. Tannenbaum, "Computer Networks," Prentice Hall of India, August 1993. 10
An Argument for Soft Layering of Protocols - Cooper (1993) (1 citation) (Correct)
No context found.
A. Tannenbaum. Computer Networks. Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1981.
Greedy Packet Scheduling on Shortest Paths - Mansour, Patt-Shamir (1991) (26 citations) (Correct)
No context found.
A. Tannenbaum. Computer Networks. Prentice Hall, 1981.
A Protocol for Anonymous Communication Over the Internet - Levine, Shields (2000) (Correct)
No context found.
A. Tannenbaum. Computer Networks. Prentice Hall, third edition, 1996.
Stability Of Binary Exponential Backoff - Goodman, Greenberg, Madras, March (1988) (17 citations) (Correct)
No context found.
Tannenbaum, A.S. Computer Networks , Prentice Hall, Englewood Cliffs, N.J. (1981).
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