Abstract: The invention is directed to a flexible method of allocating groups of virtual circuits in a network as a virtual circuit bunch. A virtual circuit bunch of arbitrary number can be set up with the ease of setting up a single virtual circuit. A single virtual circuit bunch can have plural destinations. Further, a virtual circuit bunch can be routed to the same destination over different routes. Connections across the network can be initiated as separate virtual circuits and then be grouped together as a virtual circuit bunch. The implementation of virtual circuit bunches permits rapid setup of virtual circuits and reduced table sizes at individual nodes of the network. A fast connect service can be implemented using virtual circuit bunches without establishing a connection by assigning a fast connect packet to one virtual circuit of a virtual circuit bunch. Virtual circuit bunches permit cell interleaving problems found in ATM switches to be circumvented in a particularly convenient way.

Abstract: The invention is a method and apparatus for determining an approximate network distance using one or more reference points. In accordance with an embodiment of the invention, the method comprises the steps of selecting at least one reference point positioned along a path between first and second points of a network, generating first distance metric information associated with at least one path associating a first point and the at least one reference point, generating second distance metric information associated with at least one path associating a second point and the at least one reference point, and determining a total approximate distance between the first point and the second point along one or more paths based on the first and second distance metric information.

Abstract: A method for load balancing including creating a network, having a plurality of servers, to service a single multicast address using a source specific join, where the source specific join allows each of the plurality of servers to specify a source internet protocol address range that each of the plurality of servers services. Further, method includes reallocating the source internet protocol address range specified for at least one of the plurality of servers using a load balancing policy and a control multicast channel while at least one of the plurality of servers is handling communications.

Abstract: Network and host efficiencies are improved by reducing the overhead associated with establishing virtual circuits. In one approach, a request for information from a client is sent to a server using a connectionless protocol such as UDP. If the requested information satisfies a policy for return by the connectionless protocol, the response is sent that way. If the policy is not satisfied, the server may reply with a message to try a connection oriented protocol such as TCP. If no response is received at all after a certain number of tries, the client will try a connection using a connection oriented protocol. In a second approach, when a request from a client is sent using a connectionless protocol, the state information for a transaction TCP (T/TCP) connection is set up in the client, giving the server the option of responding either using the connectionless protocol or using T/TCP.

Abstract: A routing engine for a node controller of a switch or for a router provides enhanced routing for unicast and multicast connections by representing preferred routing trees, associated with different bandwidths and quality of service indications, as tables having, for each entry, a node identification, a parent node identification, a link identifier and ah effective distance by which a node identified by the node identification is separated from the controller or router. The routing engine adapts quickly to changes in network configurations, such as link failure, by quickly patching a table affected by the failure in order to maintain service until a new preferred routing tree can be calculated. Recalculations of preferred routing trees are avoided by using said table to determine whether a new link or a restored link could possibly provide a more cost effective route than that specified in the existing table.

Abstract: Methods and apparatus for maintaining connectivity of nodes in a wireless LAN. Accordingly, the present invention provides a method and apparatus for maintaining connectivity in a wireless LAN. The LAN is divided into a plurality of cells. Each cell is occupied by at least one access point for communicating information between the cells, and at least one node for communicating via the LAN through the access points. To initiate a handoff from a first access point with which the node is currently communicating, the node first selects a second access point as a candidate for handoff. The node then communicates an instruction to the first access point instructing the first access point to relay a request to the second access point that the second access point accept a handoff of the node from the first access point. The first access point then relays the request to the second access point.

Abstract: A system for implementing flow control in an information network such as a local area network (LAN) utilizing a Carrier Sense Multiple Access with Collision Detection (CSMA/CD) as specified by the IEEE standard 802.03. The information network transmits computer information such as computer data between various computer systems coupled to the information network. The information network includes information network switches capable of routing information packets received via its input ports to its output ports. The received packets are held in buffers of the output ports before being transmitted via the output ports. A portion of each output port buffer is allocated to each input port. The information network switch provides a control packet such as a PAUSE frame to an upstream source operably coupled to the input port in response to the level occupancy of the portion of the buffer allocated to the input port exceeding a first level.

Abstract: In a communication network having a set of hosts and switch based label swapping communication nodes, each node has a control processor that is also a host that sends and receives messages via the switching apparatus in its associated node. At least one of the hosts includes a distribution tree set up procedure. That procedure stores source and destination data designating a set of source hosts and a set of destination hosts in the communication network, and defines a distribution tree of virtual connections. The designated source hosts and destination hosts may include the control processors of some or all the network nodes. The defined virtual connections include a virtual connection from each designated source host to all of the designated destination hosts, and message labels for all messages sent by the source hosts to be routed to the destination nodes.

Abstract: In a communication network having a set of hosts and switch based label swapping communication nodes, each node has a control processor that is also a host that sends and receives messages via the switching apparatus in its associated node. Each node's control processor also includes a virtual connection (VC) traversal procedure that implements the methodology of the present invention. The control processor of any node along an established connection can initiate the transmission of a VC traversal message to the control processors of all the nodes along the connection. The VC traversal message is transmitted as one or more ATM cells, where each cell includes a standard ATM header for routing the cell to a neighboring node's control processor, as well as a VC traversal header in the body of the cell that identifies the connection being traversed.

Abstract: A method and apparatus for implementing self-organization in a wireless local area network ("LAN"). Each LAN is divided into a plurality of cells. Each cell is occupied by a number of nodes and one or more relay points (RPs) for communicating information within and among cells. Two separate channels are provided. The first channel, the control channel, is common to all RPs and accessible by all nodes and is utilized for communication of control information such as signal strengths of the RPs and the operating parameters of the selected RP. The second channel, the data channel, is utilized for normal communications between the selected RP and the node, and is specific to the RP. To initiate the self-organization process, the node identifies relay points in the LAN by acquiring identification information transmitted by the relay points across a common control channel.

Abstract: A method and apparatus for implementing a protocol for controlling transmitter power in a wireless LAN. The LAN is assumed to include a number of nodes, each node including a transmitter and a receiver for communicating information between computers located at the node. To initiate the protocol, the transmitter of a data sending node first transmits a signal including a transmitter power signal to each of the receivers of the data receiving noes. The information contained in the transmitter power signal may be transmitted in one of the fields of the data packet of the signal. The receivers of the data receiving nodes individually transmit power control feedback signals back to the transmitter of the data sending node. Information in each of the power control feedback signals may occupy a field in the data packet transmitted from the receiver to the transmitter of the data sending node.