A better model for generating test networks

Author

Doar, Matthew B.

Author_Institution

Ascom Nexion Inc., Acton, MA, USA

fYear

1996

fDate

18-22 Nov 1996

Firstpage

86

Lastpage

93

Abstract

Much of the work on routing algorithms, particularly for multicast, which has been done in the past has used fairly simple models to generate the topological graph which represents the hosts in the network. Some such random graphs bear little resemblance to data communication networks which are actually deployed. This paper proposes a more realistic model, incorporating hierarchy and redundancy, and is developed into a network generation algorithm. The approach described can be developed to provide more refined models in the future

Keywords

computer networks; data communication; graph theory; network topology; packet switching; telecommunication channels; telecommunication network routing; LAN; MAN; WAN; data communication networks; hierarchy; multicast packet routing; network generation algorithm; network topology; random graphs; redundancy; routing algorithms; test network generation model; topological graph; Costs; Data communication; Euclidean distance; IP networks; Multicast algorithms; Network topology; Routing; Testing; Tree graphs; USA Councils;

fLanguage

English

Publisher

ieee

Conference_Titel

Global Telecommunications Conference, 1996. GLOBECOM '96. 'Communications: The Key to Global Prosperity

Conference_Location

London

Print_ISBN

0-7803-3336-5

Type

conf

DOI

10.1109/GLOCOM.1996.586131

Filename

586131