Routing optimization in packet switching communication networks
β Scribed by Z. Flikop
- Publisher
- Elsevier Science
- Year
- 1985
- Tongue
- English
- Weight
- 506 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
This paper addresses the routing problem with reliability requirements in packetswitched communication networks. In this problem, two classes of communicating node pairs are considered: less critical and highly critical node pairs. We develop a model which identifies a primary route for each less cr
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