%{search_type} search results

• 1. Models for mobile agent computing
• Introduction
• What is a mobile agent
• Why mobile agents
• An algorithmic model for mobile agents
• Mobile agents
• Distributed networks
• Resource measures
• Mobile agent rendezvous
• Outline of the book
• Comments and bibliographic remarks --

• 2. Deterministic rendezvous in a ring
• Introduction
• A single stationary token
• The feasibility of rendezvous
• The time complexity of rendezvous
• Memory tradeoff for rendezvous with detection
• Limits to the memory trade-off
• Movable tokens
• Comments and bibliographic remarks --

• 3. Multiple agent rendezvous in a ring
• Introduction
• Impossibility of rendezvous
• Rendezvous with detection
• Conditional solutions
• Comments and bibliographic remarks --

• 4. Randomized rendezvous in a ring
• Introduction
• Random walk algorithm
• Randomization and tokens
• Time/memory trade-offs
• Coin half tour algorithm
• Approximate counting algorithm
• Comments and bibliographic remarks --

• 5. Other models
• Introduction
• Leader election and rendezvous
• Rendezvous with failing tokens
• Rendezvous when tokens fail upon release
• Rendezvous when tokens can fail at any time
• The cost of token failure
• Flickering tokens
• Asynchronous rendezvous
• Look-compute-move
• Model and terminology
• Impossibility results
• Gathering configurations with a single multiplicity
• Gathering rigid configurations
• Gathering an odd number of robots
• Dangerous networks
• Black-hole search in an asynchronous ring
• Rendezvous in asynchronous rings in spite of a black-hole
• Comments and bibliographic remarks --

• 6. Other topologies
• Introduction
• Synchronous torus
• Memory lower bounds for rendezvous
• Rendezvous algorithms
• Trees
• Arbitrary graphs
• Comments and bibliographic remarks --

• Bibliography
• Glossary
• Authors' biographies
• Index.

Mobile agent computing is being used in fields as diverse as artificial intelligence, computational economics and robotics. Agents' ability to adapt dynamically and execute asynchronously and autonomously brings potential advantages in terms of fault-tolerance, flexibility and simplicity. This monograph focuses on studying mobile agents as modelled in distributed systems research and in particular within the framework of research performed in the distributed algorithms community. It studies the fundamental question of how to achieve rendezvous, the gathering of two or more agents at the same node of a network. Like leader election, such an operation is a useful subroutine in more general computations that may require the agents to synchronize, share information, divide up chores, etc. The work provides an introduction to the algorithmic issues raised by the rendezvous problem in the distributed computing setting.For the most part our investigation concentrates on the simplest case of two agents attempting to rendezvous on a ring network.Other situations including multiple agents, faulty nodes and other topologies are also examined. An extensive bibliography provides many pointers to related work not covered in the text. The presentation has a distinctly algorithmic, rigorous, distributed computing flavor and most results should be easily accessible to advanced undergraduate and graduate students in computer science and mathematics departments.

• Introduction. Background. FDDI
• Network Description. FDDI
• Module Description. Media Access Control. Detailed Description: Physical Layer Media Dependent. Physical Layer. SMT
• Station Management. Performance of FDDI Networks. FDDI-II. Future Developments: PMD Expansions. FDDI Follow-on Networks. Distributed Queue Dual Bus and Other Networks. Conclusion.
• (source: Nielsen Book Data)

This work on fibre distributed data interface (FDDI) provides background information on local area networks and outlines trade-off considerations for network design. It also provides a detailed explanation of state machines and state variables, many industry standards and performance issues not included in the standards. Availability information on the emerging integrated circuits for FDDI products is also given.
(source: Nielsen Book Data)

• * Preface
• 1. Introduction to Token Ring networks Overview * How does a Token Ring work? * Logical vs physical ring topology * Wire centres, hubs and concentrators * MAC frames and design * Errors and beaconing * Considerations for 16Mbps network designs
• 2. Network planning overview Network design consideration * Nodes * Multistation access units * Network repeaters * Media considerations * Environmental factors * Costs * Planning stages
• 3. Defining and locating nodes Beginning the design * Documentation * Types of node 8 Stage one-summary
• 4. Wiring closets, hubs and repeaters Physical network * Network components * Customer and site requirements * Locating wiring closets 8 Inter-closet cabling * Locating wire centres (MAUs) and racks * Verifying the design
• 5. Verifying the design: rules and formulae for STP cabling Introduction * Single wiring closet networks without repeaters * Multiple wiring closet networks without repeaters * Multiple wiring closet networks with repeaters * Network design using workgroup wire centres * Calculating the MLL for the sample network
• 6. Verifying the design: rules and formulae for UTP cabling Introduction * Single wiring closet networks without repeaters * Multiple wiring closet networks without repeaters * Multiple wiring closet networks with repeaters * Network design using workgroup wire centres * Calculating the MLL for the sample network
• 7. Verifying the design: rules and formulae for fibre optic cabling Introduction * Types of fibre optics link * Verifying fibre optic network designs
• 8. Summary and final planning steps Introduction * Cost analysis * Finalizing the network plan * Appendix A. Copper and fibre optic cables Copper cables * Token ring copper cable connectors * Fibre optic cables * Token Ring fibre support * Appendix B. Planning rules and formulae Deriving the general formula * Summary of planning rules and associated formulae * Planning rules and formulae for UTP networks * Token Ring design formulae: table summary * Appendix C. Planning forms * Glossary * Bibliography * Index.
• (source: Nielsen Book Data)

This book provides a standard reference for planning, configuring, and installing Token Ring local area networks. Its objective is to enable the reader to design and operate Token Ring LANS using the variety of cards, cables, and connections available. The book adopts a general formula approach to network design, enabling Token Ring LANS to be planned by substituting the relevant numbers into the formula. It examines the three main cabling systems-STP, UTP and Fiber-and includes comprehensive coverage of LANS components.
(source: Nielsen Book Data)

• Introduction. Physical Configurations of Token Ring. Signaling Parameters for Token Ring. Classic Token Ring. Dedicated Token Ring. Conclusions.
• (source: Nielsen Book Data)

Explaining the rationale and critical decisions behind the standards' development, this text describes cabling examples for token ring, the enhancement in point-to-point distance provided by Dedicated Token Ring and how the standard's consensus process was used to solve the jitter accumulation interoperability issue. The Token Ring architecture and configurations are detailed and used to explain the migration between Classic Token Ring and Dedicated Token Ring. The book presents a history of Token Ring and its clocking scheme, PHY theory and state tables. It also explains how to optimize future developments in token ring networking; the methodology for standards development; physical layer design; network management; fault isolation; and more.
(source: Nielsen Book Data)

• 1. Models for mobile agent computing
• Introduction
• What is a mobile agent
• Why mobile agents
• An algorithmic model for mobile agents
• Mobile agents
• Distributed networks
• Resource measures
• Mobile agent rendezvous
• Outline of the book
• Comments and bibliographic remarks.

• 2. Deterministic rendezvous in a ring
• Introduction
• A single stationary token
• The feasibility of rendezvous
• The time complexity of rendezvous
• Memory tradeoff for rendezvous with detection
• Limits to the memory trade-off
• Movable tokens
• Comments and bibliographic remarks.

• 3. Multiple agent rendezvous in a ring
• Introduction
• Impossibility of rendezvous
• Rendezvous with detection
• Conditional solutions
• Comments and bibliographic remarks.

• 4. Randomized rendezvous in a ring
• Introduction
• Random walk algorithm
• Randomization and tokens
• Time/memory trade-offs
• Coin half tour algorithm
• Approximate counting algorithm
• Comments and bibliographic remarks.

• 5. Other models
• Introduction
• Leader election and rendezvous
• Rendezvous with failing tokens
• Rendezvous when tokens fail upon release
• Rendezvous when tokens can fail at any time
• The cost of token failure
• Flickering tokens
• Asynchronous rendezvous
• Look-compute-move
• Model and terminology
• Impossibility results
• Gathering configurations with a single multiplicity
• Gathering rigid configurations
• Gathering an odd number of robots
• Dangerous networks
• Black-hole search in an asynchronous ring
• Rendezvous in asynchronous rings in spite of a black-hole
• Comments and bibliographic remarks.

• 6. Other topologies
• Introduction
• Synchronous torus
• Memory lower bounds for rendezvous
• Rendezvous algorithms
• Trees
• Arbitrary graphs
• Comments and bibliographic remarks.

• Bibliography
• Glossary
• Authors' biographies
• Index.

Mobile agent computing is being used in fields as diverse as artificial intelligence, computational economics and robotics. Agents' ability to adapt dynamically and execute asynchronously and autonomously brings potential advantages in terms of fault-tolerance, flexibility and simplicity. This monograph focuses on studying mobile agents as modelled in distributed systems research and in particular within the framework of research performed in the distributed algorithms community. It studies the fundamental question of how to achieve rendezvous, the gathering of two or more agents at the same node of a network. Like leader election, such an operation is a useful subroutine in more general computations that may require the agents to synchronize, share information, divide up chores, etc. The work provides an introduction to the algorithmic issues raised by the rendezvous problem in the distributed computing setting. For the most part our investigation concentrates on the simplest case of two agents attempting to rendezvous on a ring network. Other situations including multiple agents, faulty nodes and other topologies are also examined. An extensive bibliography provides many pointers to related work not covered in the text. The presentation has a distinctly algorithmic, rigorous, distributed computing flavor and most results should be easily accessible to advanced undergraduate and graduate students in computer science and mathematics departments.