✦ LIBER ✦

Routing in computer networks

✍ Scribed by H. Frank; W. Chou

Publisher: John Wiley and Sons
Year: 1971
Tongue: English
Weight: 607 KB
Volume: 1
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230010202

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal packet fragmentation and routing

Optimal packet fragmentation and routing in computer networks

✍ Orda, Ariel; Rom, Raphael 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 216 KB 👁 1 views

The packet fragmentation problem in computer networks is that of breaking a packet into smaller pieces (fragments) due to packet-size limitations along the packet's route. This is a typical internetworking problem. We show that the commonly used simplistic approach whereby the routing and fragmentat

Overall reliability determination of com

Overall reliability determination of computer networks with hierarchical routing strategies

✍ D. Mandaltsis; J.M. Kontoleon 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 446 KB

Optimal routing in toroidal networks

✍ Izidor Jerebic; Roman Trobec 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 582 KB

Neural computation network for global ro

Neural computation network for global routing

✍ P.-H. Shih; K.-E. Chang; W.-S. Feng 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 669 KB

An overview of these steps of the routing process is shown in Figure . This paper discusses the global-routing problem.

Shortest-Path Routing in Arbitrary Netwo

Shortest-Path Routing in Arbitrary Networks

✍ Friedhelm Meyer auf der Heide; Berthold Vöcking 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 197 KB

We introduce an on-line protocol which routes any set of N packets along shortest paths with congestion C and dilation D through an arbitrary network in Ž . O C q D q log N steps, with high probability. This time bound is optimal up to the additive log N, and it has previously only been reached for

Split agent-based routing in interconnec

Split agent-based routing in interconnected networks

✍ Constandinos X. Mavromoustakis; Helen D. Karatza 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 273 KB 👁 1 views

## Abstract Adaptive behaviour of swarm‐based agents (__BT Technol. J__. 1994; **12**:104–113; __AAMAS Conference '02__, Melbourne, Australia, Month 1–2, 2002; __Softcomput. J__. 2001; **5**(4):313–317.) is being studied in this paper with respect to network throughput for a certain amount of data