Routing with packet duplication and elimination in computer networks

Author

Orda, Ariel ; Rom, Raphael

Author_Institution

Dept. of Electr. Eng., Technion-Israel, Haifa, Israel

Volume

36

Issue

7

fYear

1988

fDate

7/1/1988 12:00:00 AM

Firstpage

860

Lastpage

866

Abstract

Packet duplication is discussed as a means of increasing network reliability in an environment where packet loss exists. Several methods of routing the duplicates are presented, one of which-the st-numbering-is shown to have the combined advantage of using disjoint paths and more even utilization of network resources. An additional mechanism, deliberate packet elimination, is introduced as a means of controlling congestion that may result, in part, from the duplication. A comprehensive model is defined encompassing the process of packet duplication together with both forms of packet elimination. Within this model, a cost function based on average packet delay is defined. A quasi-static distributed algorithm is developed that is optimal, deadlock free, and loop free. Extension of the model to include packet retransmission is considered

Keywords

computer networks; delays; packet switching; telecommunication traffic; average packet delay; computer networks; congestion; cost function; deadlock free algorithm; deliberate packet elimination; disjoint paths; loop free algorithm; network reliability; network resources; optimal algorithm; packet duplication; packet loss; packet retransmission; quasi-static distributed algorithm; routing; st-numbering; Computer network reliability; Computer networks; Cost function; Delay; Distributed algorithms; IP networks; Intelligent networks; Read only memory; Routing; System recovery;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/26.2816

Filename

2816