Network topologies

Details Network topologies Network topologies

1999-06-02

2003-06-24

Marcelo, Melvin (Department: 2663)

Multiplex communications

Network configuration determination

C370S406000

Reexamination Certificate

active

06584073

ABSTRACT:

FIELD OF THE INVENTION
The present invention relates generally to data processing systems and, more particularly, to improved network topologies.
BACKGROUND OF THE INVENTION
A “network topology” refers to the structure that provides the communications interconnection among nodes of a network. As used herein, the term “node” refers to any device capable of communicating, such as a computer, router, switch, network processor, or symmetric multiprocessor. Thus, the topology of a network refers to the network's particular configuration of links and nodes.
Conventional systems for configuring networks utilize a predefined pattern that easily extends to accommodate large numbers of nodes. When configuring a network, the pattern dictates the network topology to be used based on the number of nodes. For example, one such conventional system for configuring networks that uses predefined patterns is the hypercube system. As shown in
FIG. 1
, the hypercube system accommodates only networks with a number of nodes that can be expressed as a power of 2. Accordingly,
FIG. 1
depicts the hype rube network topology of networks having 2, 4, 8, and 16 nodes. The pattern that the hypercube system uses is apparent from an examination of the different topologies.
Following a predefined pattern provides a convenient, scalable method for configuring networks, but it ignores network performance. As a result, network performance may suffer. It is thus desirable to improve the manner in which networks are configured.
SUMMARY OF THE INVENTION
In accordance with methods and systems consistent with the present invention, a number of improved network topologies are provided that have been selected to improve network performance based on various performance characteristics. These topologies have also been selected based on the ease with which the network can be reconfigured, including adding nodes and removing nodes. As a result, the network topologies in accordance with methods and systems consistent with the present invention do not follow a rigid, predefined pattern; rather, these topologies have been selected to improve network performance and facilitate reconfiguration.
In accordance with methods consistent with the present invention, a method is provided for distributed system configuration. According to this method, a set of network topologies for groups of nodes is created, where each network topology is associated with one of the groups of nodes, and each group has a different number of nodes. Each network topology is configured to improve network performance of the associated group of nodes based on performance characteristics and does not fully connect the associated group of nodes. Furthermore, this method selects one of the network topologies for a network and then configures the network using the selected topology.
In accordance with methods consistent with the present invention, a method is provided for distributed system configuration. According to this method, a set of network topologies for groups of nodes is created, where each network topology is associated with one of the groups of nodes, and each group has a different number of nodes. Each network topology is configured to facilitate reconfiguration of the associated group and does not fully connect the associated group. Furthermore, this method selects one of the network topologies for a network based on the number of nodes in the network and then configures the network using the selected topology.


REFERENCES:
patent: 5128932 (1992-07-01), Li
patent: 5453978 (1995-09-01), Sethu et al.
patent: 5602839 (1997-02-01), Annapareddy et al.
patent: 5680116 (1997-10-01), Hashimoto et al.
patent: 5721819 (1998-02-01), Galles et al.
patent: 5740346 (1998-04-01), Wicki et al.
patent: 5751967 (1998-05-01), Raab et al.
patent: 5768501 (1998-06-01), Lewis
patent: 5781546 (1998-07-01), Sethu
patent: 5812549 (1998-09-01), Sethu
patent: 5859981 (1999-01-01), Levin et al.
patent: 5874964 (1999-02-01), Gille
patent: 5884047 (1999-03-01), Aikawa et al.
patent: 5914953 (1999-06-01), Krause et al.
patent: 5970232 (1999-10-01), Passint et al.
patent: 6005860 (1999-12-01), Anderson et al.
patent: 6031835 (2000-02-01), Abali et al.
patent: 6055618 (2000-04-01), Thorson
patent: 6064671 (2000-05-01), Killian
patent: 6097718 (2000-08-01), Bion
patent: 6137781 (2000-10-01), Goto et al.
patent: 6230252 (2001-05-01), Passint et al.
patent: 6243760 (2001-06-01), Armbruster et al.
patent: 6256295 (2001-07-01), Callon
patent: 6295573 (2001-09-01), Bailey et al.
Whay C. Lee, “Topology Aggregation for Hierarchical Routing in ATM Networks.” Apr. 1, 1995, pp. 82-92, Computer-Communication Review.
IBM, “Clustering Algorithm for Computer Network Management Graphics,” Jun. 1988, pp. 71-79, IBM Technical Disclosure Bulletin, vol. 31, No. 1.
Peercy, M. et al., “Distributed Algorithms for Shortest-Path, Deadlock-Free Routing and Broadcasting in Arbitrarily Faulty Hypercubes,” International Symposium on Fault Tolerant Computing Systems (FTCS), US, Los Alamitos, IEEE Comp. Soc. Press, vol. Symp. 20, Jun. 26, 1990, pp. 218-225.
Fleury, E. et al., “A General Theory for Deadlock Avoidance in Wormhole-Routed Networks,” IEEE Trans. on Parallel and Distributed Systems, IEEE Inc., NY, vol. 9, No. 7, Jul. 1, 1998, pp. 626-638.
Pifarre G. D. et al., “Adaptive Deadlock-and Livelock-Free Routing in the Hypercube Network,” IEEE Trans. on Parallel and Distributed Systems, IEEE Inc., NY, vol. 5, No. 11, Nov. 1, 1994, pp. 1121-1138.

Affiliated with

Also associated with

Rating

Network topologies does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Network topologies, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Network topologies will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3097030