By Topic

Minimum fragmentation internetwork routing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Bonuccelli, M.A. ; Dipartimento di Inf., Pisa Univ., Italy

The problem of minimizing the internetwork packet fragmentation cost by selecting an appropriate route from the origin to the destination network is investigated. It is shown that this problem is NP-complete, and optimal (minimum fragmentation cost) paths cannot be computed by fast algorithms when the intranetwork strategy is used. Then, the internetwork fragmentation strategy is considered, and a fast (i.e., polynomial time) routing algorithm, called Maxbottleneck, is presented. When a greedy fragmentation scheme is adopted, like the classical maximal one, the algorithm produces an optimal path when some conditions on the networks' maximum packet sizes are met. A novel, non-greedy fragmentation scheme called bottleneck is also proposed. It is shown that the path produced by Maxbottleneck is always optimal when the bottleneck scheme is used

Published in:

INFOCOM '91. Proceedings. Tenth Annual Joint Conference of the IEEE Computer and Communications Societies. Networking in the 90s., IEEE

Date of Conference:

7-11 Apr 1991