Multihoming in computer networks: a topology-design approach

Author

Orda, Ariel ; Rom, Raphael

Author_Institution

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

fYear

1988

fDate

27-31 Mar 1988

Firstpage

941

Lastpage

945

Abstract

Multihoming in networks, i.e. attaching a subscriber to more than a single access point in the network, is a mechanism used to improve performance. The authors take the topological design view and address the problem of finding optimal multihoming configurations for several topological design criteria. They analyze the problem and demonstrate that except for dual homing, multihoming is algorithmically complex. Optimal algorithms based on maximum matching in graphs and 0-1 integer programming are given for all cases

Keywords

computational complexity; computer networks; graph theory; integer programming; network topology; 0-1 integer programming; dual homing; maximum matching in graphs; multihoming computer network access; optimal multihoming configurations; topological design criteria; Algorithm design and analysis; Availability; Computer crashes; Computer networks; Cost function; Intelligent networks; Joining processes; Linear programming; Protection; Read only memory;

fLanguage

English

Publisher

ieee

Conference_Titel

INFOCOM '88. Networks: Evolution or Revolution, Proceedings. Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies, IEEE

Conference_Location

New Orleans, LA

Print_ISBN

0-8186-0833-1

Type

conf

DOI

10.1109/INFCOM.1988.13010

Filename

13010