CA2217277A1 - Automatic link establishment for distributed servers in atm networks - Google Patents
Automatic link establishment for distributed servers in atm networks Download PDFInfo
- Publication number
- CA2217277A1 CA2217277A1 CA002217277A CA2217277A CA2217277A1 CA 2217277 A1 CA2217277 A1 CA 2217277A1 CA 002217277 A CA002217277 A CA 002217277A CA 2217277 A CA2217277 A CA 2217277A CA 2217277 A1 CA2217277 A1 CA 2217277A1
- Authority
- CA
- Canada
- Prior art keywords
- servers
- spanning tree
- computers
- network
- links
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/28—Routing or path finding of packets in data switching networks using route fault recovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0805—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability
- H04L43/0811—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability by checking connectivity
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/18—Loop-free operations
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/48—Routing tree calculation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L2012/5625—Operations, administration and maintenance [OAM]
- H04L2012/5627—Fault tolerance and recovery
Abstract
The invention relates to distributed computer or server networks and to methods of automatically establishing communication links between individual servers in the network. The servers in the network are all members of an overlay spanning tree where the tree is comprised of servers as nodes and communication links as edges.
Discovery and hunt addressing protocols are implemented to locate peer servers in the network and communication links are set up as required.
Discovery and hunt addressing protocols are implemented to locate peer servers in the network and communication links are set up as required.
Description
-AUTOMATIC LINK ESTABLISHMENT
FOR DISTRIBUTED SERVERS IN ATM NETWORKS
Field Of The Invention The present invention generally relates to a spanning tree methodology and, in particular, to automatically establishing links between distributed data processing servers connected to an asynchronous transfer mode (ATM) network.
Background Of The Invention In computer networks it is often advantageous to provide a distributed computer system consisting of multiple computers which work with each other in an automated and controlled manner, in order to improve system reliability or increase system performance, for instance, when compared to a single computer effecting similar functionality.
A key requirement for such distributed computing systems is the need to maintain communication links between the individual computers, which are commonly referred to as servers. Frequently this is accomplished by creating a mesh of connections whereby each server has a link to every other server in the group or cluster manifesting the distributed system, but this is often impractical due to the large number of links for even moderately sized clusters.
Known problems concerning the communications infrastructure to link the various servers include:
l) Discovery of servers;
FOR DISTRIBUTED SERVERS IN ATM NETWORKS
Field Of The Invention The present invention generally relates to a spanning tree methodology and, in particular, to automatically establishing links between distributed data processing servers connected to an asynchronous transfer mode (ATM) network.
Background Of The Invention In computer networks it is often advantageous to provide a distributed computer system consisting of multiple computers which work with each other in an automated and controlled manner, in order to improve system reliability or increase system performance, for instance, when compared to a single computer effecting similar functionality.
A key requirement for such distributed computing systems is the need to maintain communication links between the individual computers, which are commonly referred to as servers. Frequently this is accomplished by creating a mesh of connections whereby each server has a link to every other server in the group or cluster manifesting the distributed system, but this is often impractical due to the large number of links for even moderately sized clusters.
Known problems concerning the communications infrastructure to link the various servers include:
l) Discovery of servers;
2) Minimizing link cost;
3) Ensuring reliability; and
4) Avoiding looping.
A technique that solves one or more of these problems is desirable.
Summary Of The Invention It is an object of the present invention to provide a new and improved methodology for establishing links between multiple servers connected to a data communications switching network.
The invention, therefore, according to a first exemplary aspect provides in a distributed computer network having a plurality of computers a method of automatically establishing communication links between the computers in the network and a newly initialized computer. The method comprises the steps of: arranging the computers in an overlay spanning tree topology; initiating a discovery addressing protocol by the newly initialized computer to discover the computers in the spanning tree; and forming a communication link between the newly initialized computer and at least one computer in the spanning tree.
In accordance with a second exemplary aspect of the invention, there is provided in a distributed computer network having a plurality of servers, a method of automatically re-establishing communication links between the servers in the event of network failure. The method comprises the steps of: arranging the servers in an overlay spanning tree topology; initiating a hunt addressing protocol by all the servers in the spanning tree to locate peer servers; and establishing communication links between the located servers.
Distributed computing where the underlying communications infrastructure is an ATM network characterizes a preferred embodiment of the invention.
Advantages of the spanning tree technique include that it is self-healing in nature. This allows for automatic rebuilding of the cluster after a link or server failure. The repair is accomplished by the root node of each fragment hunting for nodes of all other fragments.
Also, the cost of the links is minimized both because no redundant links are required due to the self-healing nature, and because in general each server will be connected to its nearest peer at the time of connection.
The tree topology also eliminates problems with routing loops.
Brief Description Of The Drawings The invention will be better understood from the following description together with reference to the accompanying drawings, in which:
Figure 1 is a schematic diagram illustrating a plurality of servers connected to an ATM network; and Figure 2 is a schematic diagram representing a spanning tree methodology whereby a server discovers its peers.
Detailed Description Referring to Figure 1, shown is a particular implementation environment for the present invention comprising a plurality of servers 10, respectively labeled S1, S2, S3 .. Sn, which are connected to and may be interconnected through an ATM network 12. The plurality of servers 10 constitute a distributed computer system that can be accessed by any client device 14 through the network 12. The distributed system is not a static entity, but rather the number of servers 10 forming the distributed system may change dynamically. For example, if a particular server, say Sn, is newly initialized and/or connected to the network 12, it must discover its peer servers, S1, S2, S3, in order to be added to the distributed system.
To support discovery of a server by its peer servers, in accordance with the invention, all the servers 10 effectively are members of an overlay spanning tree, as shown in Figure 2. The tree is comprised of servers 10 as nodes 20 and communication links 22 as edges. The communications links 22 may be virtual circuits (VCs), such as a switched VC (SVC), through the ATM network 12 of Figure 1.
The attaching VC link 22 will be setup by every server 10 of the distributed system using a specific anycast address. Anycast addressing is a well know capability of ATM networks 12, that allows a user to request a point-to-point connection to a single ATM end system which may be a single data processing device or a group of such devices typically provisioned to share the processing workload. An ATM switching system, for example the Mainstreet 36170 provided by Newbridge Networks, permits an attached device to register an anycast address in addition to its unicast (regular) address. Once registered, these addresses are passed to other ATM
switches in the network 12. Several devices may register to the same anycast address. Each ATM switch within the scope of the registration is able to map the anycast address to the unicast address of the closest (or only) element in the ATM network 12 that provides the type of service associated with it. Refer to ATM User-Network Interface (UNI) Signaling Specification, Version 4, July, 1996, for more details on ATM anycast capability.
The servers 10 corresponding to the nodes 20 of the spanning tree are already known in the distributed system, in that each server has a VC connection or link 22 established to one of its peer servers. A new server is discovered by the distributed system (i.e., existing servers) when it first attaches itself to this tree. The very first server attempting to attach itself (i.e., no existing servers) becomes the root of the tree. This automatic discovery greatly eases administration of the cluster as new nodes can be added without reconfiguration of existing nodes 20. This process of a node attempting to attach itself to the tree is referred to herein as hunting, which is further described below.
The spanning tree is self-healing in nature. This allows for automatic rebuilding of the cluster after a link 22 or node 20 (server) failure. These failures would otherwise result in fragmentation of the tree, which would then require manual intervention to repair. In the case of the subject spanning tree methodology, the repair is accomplished by the root node of each fragment hunting for nodes of all other fragments.
A server 10 will go in this hunting mode if it detects loss of VC connection from its attachment point on the tree or if it cannot establish a VC at all during initialization. The latter case would apply to the very first server to come up in the ATM network 12 (or individual servers 10 which are first to be initialized in respective portions of a fragmented ATM fabric). A server 10 will come out of the hunting mode when it gets a successful VC connection on a hunt anycast address. This signifies that it has successfully attached itself as a child of the server on the other side of VC.
The hunt procedure consists of successive registration of a Hunt Anycast address by each hunting node followed by a period of de-registration and trying to connect a VC on that same Hunt address. The registered and de-registered phases of the hunt will occur in a semi-random fashion so as to allow overlap of registered phase with de-registered phase among other (i.e., multiple) hunting nodes. For instance, different time intervals may be used for the registered phase and the de-registered phase, as well as varying these at each server 10. The Hunt anycast address is not the same as the normal server anycast address that is typically used by the client devices 14.
In steady state, under normal conditions there will a single fragment, namely, the spanning tree itself with the root in hunting mode as described above.
Note that the cost of the links is minimized both because no redundant links are required (due to the self-healing nature), and because in general each server will be connected to its nearest peer at the time of connection.
The tree topology also eliminates problems with routing loops.
Those skilled in the art will recognize that various modifications and changes could be made to the invention without departing from the spirit and scope thereof. It should therefore be understood that the claims are not to be considered as being limited to the precise embodiments set forth above, in the absence of specific limitations directed to each embodiment.
A technique that solves one or more of these problems is desirable.
Summary Of The Invention It is an object of the present invention to provide a new and improved methodology for establishing links between multiple servers connected to a data communications switching network.
The invention, therefore, according to a first exemplary aspect provides in a distributed computer network having a plurality of computers a method of automatically establishing communication links between the computers in the network and a newly initialized computer. The method comprises the steps of: arranging the computers in an overlay spanning tree topology; initiating a discovery addressing protocol by the newly initialized computer to discover the computers in the spanning tree; and forming a communication link between the newly initialized computer and at least one computer in the spanning tree.
In accordance with a second exemplary aspect of the invention, there is provided in a distributed computer network having a plurality of servers, a method of automatically re-establishing communication links between the servers in the event of network failure. The method comprises the steps of: arranging the servers in an overlay spanning tree topology; initiating a hunt addressing protocol by all the servers in the spanning tree to locate peer servers; and establishing communication links between the located servers.
Distributed computing where the underlying communications infrastructure is an ATM network characterizes a preferred embodiment of the invention.
Advantages of the spanning tree technique include that it is self-healing in nature. This allows for automatic rebuilding of the cluster after a link or server failure. The repair is accomplished by the root node of each fragment hunting for nodes of all other fragments.
Also, the cost of the links is minimized both because no redundant links are required due to the self-healing nature, and because in general each server will be connected to its nearest peer at the time of connection.
The tree topology also eliminates problems with routing loops.
Brief Description Of The Drawings The invention will be better understood from the following description together with reference to the accompanying drawings, in which:
Figure 1 is a schematic diagram illustrating a plurality of servers connected to an ATM network; and Figure 2 is a schematic diagram representing a spanning tree methodology whereby a server discovers its peers.
Detailed Description Referring to Figure 1, shown is a particular implementation environment for the present invention comprising a plurality of servers 10, respectively labeled S1, S2, S3 .. Sn, which are connected to and may be interconnected through an ATM network 12. The plurality of servers 10 constitute a distributed computer system that can be accessed by any client device 14 through the network 12. The distributed system is not a static entity, but rather the number of servers 10 forming the distributed system may change dynamically. For example, if a particular server, say Sn, is newly initialized and/or connected to the network 12, it must discover its peer servers, S1, S2, S3, in order to be added to the distributed system.
To support discovery of a server by its peer servers, in accordance with the invention, all the servers 10 effectively are members of an overlay spanning tree, as shown in Figure 2. The tree is comprised of servers 10 as nodes 20 and communication links 22 as edges. The communications links 22 may be virtual circuits (VCs), such as a switched VC (SVC), through the ATM network 12 of Figure 1.
The attaching VC link 22 will be setup by every server 10 of the distributed system using a specific anycast address. Anycast addressing is a well know capability of ATM networks 12, that allows a user to request a point-to-point connection to a single ATM end system which may be a single data processing device or a group of such devices typically provisioned to share the processing workload. An ATM switching system, for example the Mainstreet 36170 provided by Newbridge Networks, permits an attached device to register an anycast address in addition to its unicast (regular) address. Once registered, these addresses are passed to other ATM
switches in the network 12. Several devices may register to the same anycast address. Each ATM switch within the scope of the registration is able to map the anycast address to the unicast address of the closest (or only) element in the ATM network 12 that provides the type of service associated with it. Refer to ATM User-Network Interface (UNI) Signaling Specification, Version 4, July, 1996, for more details on ATM anycast capability.
The servers 10 corresponding to the nodes 20 of the spanning tree are already known in the distributed system, in that each server has a VC connection or link 22 established to one of its peer servers. A new server is discovered by the distributed system (i.e., existing servers) when it first attaches itself to this tree. The very first server attempting to attach itself (i.e., no existing servers) becomes the root of the tree. This automatic discovery greatly eases administration of the cluster as new nodes can be added without reconfiguration of existing nodes 20. This process of a node attempting to attach itself to the tree is referred to herein as hunting, which is further described below.
The spanning tree is self-healing in nature. This allows for automatic rebuilding of the cluster after a link 22 or node 20 (server) failure. These failures would otherwise result in fragmentation of the tree, which would then require manual intervention to repair. In the case of the subject spanning tree methodology, the repair is accomplished by the root node of each fragment hunting for nodes of all other fragments.
A server 10 will go in this hunting mode if it detects loss of VC connection from its attachment point on the tree or if it cannot establish a VC at all during initialization. The latter case would apply to the very first server to come up in the ATM network 12 (or individual servers 10 which are first to be initialized in respective portions of a fragmented ATM fabric). A server 10 will come out of the hunting mode when it gets a successful VC connection on a hunt anycast address. This signifies that it has successfully attached itself as a child of the server on the other side of VC.
The hunt procedure consists of successive registration of a Hunt Anycast address by each hunting node followed by a period of de-registration and trying to connect a VC on that same Hunt address. The registered and de-registered phases of the hunt will occur in a semi-random fashion so as to allow overlap of registered phase with de-registered phase among other (i.e., multiple) hunting nodes. For instance, different time intervals may be used for the registered phase and the de-registered phase, as well as varying these at each server 10. The Hunt anycast address is not the same as the normal server anycast address that is typically used by the client devices 14.
In steady state, under normal conditions there will a single fragment, namely, the spanning tree itself with the root in hunting mode as described above.
Note that the cost of the links is minimized both because no redundant links are required (due to the self-healing nature), and because in general each server will be connected to its nearest peer at the time of connection.
The tree topology also eliminates problems with routing loops.
Those skilled in the art will recognize that various modifications and changes could be made to the invention without departing from the spirit and scope thereof. It should therefore be understood that the claims are not to be considered as being limited to the precise embodiments set forth above, in the absence of specific limitations directed to each embodiment.
Claims (2)
1. In a distributed computer network having a plurality of computers, a method of automatically establishing links between said computers and a newly initialized computer comprising:
arranging said computers in an overlay spanning tree topology;
initiating a discovery addressing protocol by said newly initialized to discover other computers within said spanning tree; and forming a communications link between said newly initialized computer and at least one of said discovered computers in said spanning tree.
2. In a distributed computer network having a plurality of servers, a method of automatically re-establishing links between said servers in the event of network failure, said method comprising:
arranging said servers in an overlay spanning tree topology;
initiating a hunt addressing protocol by all servers in said spanning tree to locate peer servers; and establishing communication links between said located servers.
We claim:
1. In a distributed computer network having a plurality of computers, a method of automatically establishing links between said computers and a newly initialized computer comprising:
arranging said computers in an overlay spanning tree topology;
initiating a discovery addressing protocol to discover other computers within said spanning tree; and forming a communications link between said newly initialized computer and said discovered computers in said spanning tree.
arranging said computers in an overlay spanning tree topology;
initiating a discovery addressing protocol to discover other computers within said spanning tree; and forming a communications link between said newly initialized computer and said discovered computers in said spanning tree.
2. In a distributed computer network having a plurality of servers, a method of automatically re-establishing links between said servers in the event of network failure, said method comprising:
arranging said servers in an overlay spanning tree topology;
initiating a hunt addressing protocol by all servers in said spanning tree to locate peer servers; and establishing communication links between said located servers.
arranging said servers in an overlay spanning tree topology;
initiating a hunt addressing protocol by all servers in said spanning tree to locate peer servers; and establishing communication links between said located servers.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CA002217277A CA2217277A1 (en) | 1997-10-03 | 1997-10-03 | Automatic link establishment for distributed servers in atm networks |
| US09/166,550 US6327252B1 (en) | 1997-10-03 | 1998-10-05 | Automatic link establishment between distributed servers through an NBMA network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CA002217277A CA2217277A1 (en) | 1997-10-03 | 1997-10-03 | Automatic link establishment for distributed servers in atm networks |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CA2217277A1 true CA2217277A1 (en) | 1999-04-03 |
Family
ID=4161569
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002217277A Abandoned CA2217277A1 (en) | 1997-10-03 | 1997-10-03 | Automatic link establishment for distributed servers in atm networks |
Country Status (2)
| Country | Link |
|---|---|
| US (1) | US6327252B1 (en) |
| CA (1) | CA2217277A1 (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB2381427A (en) * | 2001-10-27 | 2003-04-30 | Hewlett Packard Co | Spanning tree in peer to peer networks |
Families Citing this family (50)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP3786328B2 (en) * | 1998-07-27 | 2006-06-14 | 株式会社日立製作所 | Server and communication control method |
| US6633579B1 (en) * | 1998-10-21 | 2003-10-14 | Marconi Communications, Inc. | Efficient method for storing multicast trees |
| US7076783B1 (en) | 1999-05-28 | 2006-07-11 | Oracle International Corporation | Providing figure of merit vote from application executing on a partitioned cluster |
| US6871222B1 (en) * | 1999-05-28 | 2005-03-22 | Oracle International Corporation | Quorumless cluster using disk-based messaging |
| US7020695B1 (en) | 1999-05-28 | 2006-03-28 | Oracle International Corporation | Using a cluster-wide shared repository to provide the latest consistent definition of the cluster (avoiding the partition-in time problem) |
| US6735633B1 (en) * | 1999-06-01 | 2004-05-11 | Fast Forward Networks | System for bandwidth allocation in a computer network |
| US6724734B1 (en) * | 1999-06-15 | 2004-04-20 | Avaya Communication Israel, Ltd. | Creating a spanning tree of a network including clusters |
| US6415323B1 (en) * | 1999-09-03 | 2002-07-02 | Fastforward Networks | Proximity-based redirection system for robust and scalable service-node location in an internetwork |
| US6785704B1 (en) * | 1999-12-20 | 2004-08-31 | Fastforward Networks | Content distribution system for operation over an internetwork including content peering arrangements |
| AU4710001A (en) * | 1999-12-06 | 2001-06-12 | Warp Solutions, Inc. | System and method for enhancing operation of a web server cluster |
| US6977929B1 (en) | 1999-12-10 | 2005-12-20 | Sun Microsystems, Inc. | Method and system for facilitating relocation of devices on a network |
| US6798782B1 (en) | 1999-12-10 | 2004-09-28 | Sun Microsystems, Inc. | Truly anonymous communications using supernets, with the provision of topology hiding |
| US7336790B1 (en) | 1999-12-10 | 2008-02-26 | Sun Microsystems Inc. | Decoupling access control from key management in a network |
| US6970941B1 (en) | 1999-12-10 | 2005-11-29 | Sun Microsystems, Inc. | System and method for separating addresses from the delivery scheme in a virtual private network |
| US7765581B1 (en) | 1999-12-10 | 2010-07-27 | Oracle America, Inc. | System and method for enabling scalable security in a virtual private network |
| US6870842B1 (en) | 1999-12-10 | 2005-03-22 | Sun Microsystems, Inc. | Using multicasting to provide ethernet-like communication behavior to selected peers on a network |
| US7552233B2 (en) * | 2000-03-16 | 2009-06-23 | Adara Networks, Inc. | System and method for information object routing in computer networks |
| US7565450B2 (en) * | 2000-03-16 | 2009-07-21 | Adara Networks Inc. | System and method for using a mapping between client addresses and addresses of caches to support content delivery |
| US7162539B2 (en) * | 2000-03-16 | 2007-01-09 | Adara Networks, Inc. | System and method for discovering information objects and information object repositories in computer networks |
| US7343422B2 (en) * | 2000-04-28 | 2008-03-11 | Adara Networks, Inc. | System and method for using uniform resource locators to map application layer content names to network layer anycast addresses |
| US7725596B2 (en) * | 2000-04-28 | 2010-05-25 | Adara Networks, Inc. | System and method for resolving network layer anycast addresses to network layer unicast addresses |
| US7577754B2 (en) * | 2000-04-28 | 2009-08-18 | Adara Networks, Inc. | System and method for controlling access to content carried in a caching architecture |
| US7908337B2 (en) * | 2000-04-28 | 2011-03-15 | Adara Networks, Inc. | System and method for using network layer uniform resource locator routing to locate the closest server carrying specific content |
| US6681107B2 (en) | 2000-12-06 | 2004-01-20 | Xybernaut Corporation | System and method of accessing and recording messages at coordinate way points |
| US6377793B1 (en) | 2000-12-06 | 2002-04-23 | Xybernaut Corporation | System and method of accessing and recording messages at coordinate way points |
| US6914887B2 (en) * | 2001-01-04 | 2005-07-05 | Intel Corporation | Managing links between processor-based systems |
| AU2002232464A1 (en) * | 2001-02-09 | 2002-08-28 | Microsoft Corporation | Distribution of binary executables and content from peer locations/machines |
| CA2438776A1 (en) * | 2001-02-19 | 2002-08-29 | British Telecommunications Public Limited Company | Forwarding tree generation in a communications network |
| US8156223B2 (en) * | 2001-03-20 | 2012-04-10 | Microsoft Corporation | Distribution of binary executables and content from peer locations/machines |
| US20020154635A1 (en) * | 2001-04-23 | 2002-10-24 | Sun Microsystems, Inc. | System and method for extending private networks onto public infrastructure using supernets |
| US7096356B1 (en) * | 2001-06-27 | 2006-08-22 | Cisco Technology, Inc. | Method and apparatus for negotiating Diffie-Hellman keys among multiple parties using a distributed recursion approach |
| AU2003212151A1 (en) * | 2002-03-18 | 2003-09-29 | Nortel Networks Limited | Resource allocation using an auto-discovery mechanism for provider-provisioned layer-2 and layer-3 virtual private networks |
| US20040153700A1 (en) * | 2003-01-02 | 2004-08-05 | Nixon Mark J. | Redundant application stations for process control systems |
| US7577150B2 (en) * | 2003-11-12 | 2009-08-18 | Avaya, Inc. | Peer discovery |
| US7710881B2 (en) * | 2003-11-25 | 2010-05-04 | International Business Machines Corporation | Apparatus for scalable reliable group communication |
| US7698459B2 (en) * | 2006-03-16 | 2010-04-13 | Tellabs Operations, Inc. | Method and system for identifying a device address |
| US8782178B2 (en) * | 2007-06-14 | 2014-07-15 | Cisco Technology, Inc. | Distributed bootstrapping mechanism for peer-to-peer networks |
| US8533280B1 (en) * | 2008-05-02 | 2013-09-10 | BitGravity, Inc. | Distributed origin content delivery network |
| US8954548B2 (en) * | 2008-08-27 | 2015-02-10 | At&T Intellectual Property Ii, L.P. | Targeted caching to reduce bandwidth consumption |
| US9426213B2 (en) * | 2008-11-11 | 2016-08-23 | At&T Intellectual Property Ii, L.P. | Hybrid unicast/anycast content distribution network system |
| US20100153802A1 (en) * | 2008-12-15 | 2010-06-17 | At&T Corp. | System and Method for Anycast Transport Optimization |
| TWI364218B (en) * | 2008-12-16 | 2012-05-11 | Ind Tech Res Inst | Real-time image monitoring and recording system and method |
| US8560597B2 (en) * | 2009-07-30 | 2013-10-15 | At&T Intellectual Property I, L.P. | Anycast transport protocol for content distribution networks |
| US8966033B2 (en) * | 2009-08-17 | 2015-02-24 | At&T Intellectual Property I, L.P. | Integrated proximity routing for content distribution |
| US8296458B2 (en) | 2009-08-24 | 2012-10-23 | At&T Intellectual Property I, Lp | Adaptive routing of content requests using multiple anycast addresses |
| US9450804B2 (en) | 2009-09-03 | 2016-09-20 | At&T Intellectual Property I, L.P. | Anycast aware transport for content distribution networks |
| US8560598B2 (en) | 2009-12-22 | 2013-10-15 | At&T Intellectual Property I, L.P. | Integrated adaptive anycast for content distribution |
| US8856281B2 (en) | 2010-03-22 | 2014-10-07 | At&T Intellectual Property I, L.P. | Internet protocol version 6 content routing |
| WO2015172293A1 (en) * | 2014-05-12 | 2015-11-19 | 华为技术有限公司 | Data transmission method and apparatus, and switch |
| CN110971528B (en) * | 2019-12-12 | 2021-11-12 | 天地伟业技术有限公司 | Method for automatically networking middleware server |
Family Cites Families (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5574860A (en) * | 1993-03-11 | 1996-11-12 | Digital Equipment Corporation | Method of neighbor discovery over a multiaccess nonbroadcast medium |
| US6016319A (en) * | 1995-10-31 | 2000-01-18 | Lucent Technologies, Inc. | Communications system for transmission of datagram packets over connection-oriented networks |
| JP2728064B2 (en) * | 1995-11-20 | 1998-03-18 | 日本電気株式会社 | Address resolution method |
| US5854901A (en) * | 1996-07-23 | 1998-12-29 | Cisco Systems, Inc. | Method and apparatus for serverless internet protocol address discovery using source address of broadcast or unicast packet |
| JP2845208B2 (en) * | 1996-08-15 | 1999-01-13 | 日本電気株式会社 | Address resolution device |
| US6069895A (en) * | 1997-08-29 | 2000-05-30 | Nortel Networks Corporation | Distributed route server |
| US6032194A (en) * | 1997-12-24 | 2000-02-29 | Cisco Technology, Inc. | Method and apparatus for rapidly reconfiguring computer networks |
-
1997
- 1997-10-03 CA CA002217277A patent/CA2217277A1/en not_active Abandoned
-
1998
- 1998-10-05 US US09/166,550 patent/US6327252B1/en not_active Expired - Lifetime
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB2381427A (en) * | 2001-10-27 | 2003-04-30 | Hewlett Packard Co | Spanning tree in peer to peer networks |
Also Published As
| Publication number | Publication date |
|---|---|
| US6327252B1 (en) | 2001-12-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2217277A1 (en) | Automatic link establishment for distributed servers in atm networks | |
| US5583991A (en) | Method for providing for automatic topology discovery in an ATM network or the like | |
| US5586267A (en) | Apparatus for providing for automatic topology discovery in an ATM network or the like | |
| US5400325A (en) | Method and apparatus providing for hunt groups in an ATM network of the like | |
| US6434612B1 (en) | Connection control interface for asynchronous transfer mode switches | |
| US5390170A (en) | Method and apparatus providing for bootstrapping of switches in an ATM network or the like | |
| US5581552A (en) | Multimedia server | |
| US6292463B1 (en) | Method and apparatus for recovering from a signalling failure in a switched connection data transmission network | |
| US6470013B1 (en) | Use of enhanced ethernet link—loop packets to automate configuration of intelligent linecards attached to a router | |
| US5694547A (en) | System for registration of clients in an ATM network providing for communication of client registration messages to a central manager | |
| US5936936A (en) | Redundancy mechanisms for classical internet protocol over asynchronous transfer mode networks | |
| WO1998059462A1 (en) | Architecture for network manager | |
| US6791948B1 (en) | Distributed switch and connection control arrangement and method for digital communications network | |
| WO1996021985A1 (en) | Maintaining database integrity throughout a communication network | |
| CN112491984B (en) | Container editing engine cluster management system based on virtual network bridge | |
| US5974048A (en) | Distributed data processing system | |
| JP3953532B2 (en) | Asynchronous network system | |
| US6671253B1 (en) | Method and system for providing peer redundancy to asynchronous transfer mode emulated local-area networks | |
| Cisco | Designing APPN Internetworks | |
| Cisco | Designing APPN Internetworks | |
| Cisco | Designing APPN Internetworks | |
| Cisco | Designing APPN Internetworks | |
| Cisco | Designing APPN Internetworks | |
| Cisco | Designing APPN Internetworks | |
| CN114629790B (en) | Method and system for configuring server network cluster |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| FZDE | Discontinued |