𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Power Savings in Packet Networks via Optimised Routing

✍ Scribed by Erol Gelenbe; Christina Morfopoulou

Publisher
Springer US
Year
2011
Tongue
English
Weight
264 KB
Volume
17
Category
Article
ISSN
1383-469X

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

Packet Routing in Fixed-Connection Netwo
Packet Routing in Fixed-Connection Networks: A Survey
✍ Miltos D Grammatikakis; D.Frank Hsu; Miro Kraetzl; Jop F Sibeyn πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 748 KB

We survey routing problems on fixed-connection networks. We consider many aspects of the routing problem and provide known theoretical results for various communication models. We focus on (partial) permutation, k-relation routing, routing to random destinations, dynamic routing, isotonic routing, f