Abstract: Described are a method and system for establishing a secure communication session with third-party access at a later time. A first communication subsession is established between two original devices using a first key generated by a two-party key and security association protocol. At least one of the original devices is established as a group key server. A request from a joining device to join the secure communication session is received and a second communication subsession is established between the original devices using a second key generated by the two-party key and security association protocol. The second key is provided to the joining device to enable participation in the second communication subsession.

Abstract: Ethernet provider backbone transport (PBT) paths are controlled utilizing Generalized Multi-protocol Label Switching (GMPLS) signaling protocol. A path between edge nodes is identified by a combination of a VID and destination MAC address in a VID/MAC tuple populated in the forwarding tables of intermediary nodes. To establish the PBT path, a path calculation is performed from the originator node to the terminator node through the network. The originating node then sends a GMPLS label object with a suggested VID/MAC to identify the path to the terminator. The intermediary nodes or bridges forward the object to the terminating node. The terminating node then offers a VID/MAC tuple in a GMPLS label object in response. When the intermediary nodes forward the response from the terminating node to the originator, the appropriate forwarding labels are then installed in the forwarding tables of each node utilizing the associated VID/MAC tuples.

Abstract: Managing link bandwidth in a communication network having multiple routing devices is described. A connection path is requested across the network to establish communication from a sending process to a receiving device. Each device on the connection path is connected to a next device on the connection path by a link having an associated bandwidth. A connection admission control process is performed for at least one routing device on the connection path. A sending process reservation is determined as a function of sending process characteristics and QoS, network state, and admission policy. The application-aware reservation factor influences an amount of link bandwidth that is reserved for the sending process.

Abstract: CE devices of the present invention are enabled to make more judicious routing decisions in CE-based VPNs. In determining a next-hop in a path from a source CE to a destination subnet, CE-to-CE costs are associated with each next-hop CE in a plurality of next-hop CEs. Each CE-to-CE cost is a cost of a path from the source CE to the associated next-hop CE. CE-to-subnet costs are associated with each of the next-hop CEs. Each CE-to-subnet cost is a cost of a path from the associated next-hop CE to the destination subnet. Total-costs are associated with each of the next-hop CEs. Each total-cost is a sum of a CE-to-CE cost associated with a next-hop CE and a CE-to-subnet cost associated with the same next-hop CE. The next-hop in the path is set to be a next-hop CE associated with an associated total-cost.

Abstract: There is disclosed an apparatus and method for limiting tunnel traffic in a network. Traffic engineering tunnels are used to direct traffic along a predefined path, which may differ from the path that internet protocol (IP) routing would determine. Interior gateway protocol (IGP) cut through will allow the forwarding of all destinations downstream of a tunnel through the tunnel, without the operator needing to specify a forwarding equivalence class (FEC). But congestion in the tunnel and network instability may result from this approach. A solution to these problems is disclosed which limits the traffic in the tunnel to only that with destination addresses of the tunnel's egress router or nodes directly supported thereby. Other solutions are disclosed which allow tunnel traffic to nodes having destination addresses other than those being directly supported by the tunnel's egress router. All of these solutions are achieved in both pre-determined forwarding entry and dynamic packet-by packet embodiments.

Abstract: Sensor network routing uses distance information of sensors relative to a collector node, optionally along with non-unique key information, to route broadcasts from addressless sensors to a selected addressless collector. Distance calculation messages (DCMs) are used to set distance values on sensors relative to collectors. The distance values enable messages to propagate toward collectors to reduce the number of broadcasts. Self-assigned key information may be added to DCMs propagating in the network to enable routes to be determined through the network without assigning addresses to the participants. By storing the key information associated with the route, and causing sensors to only rebroadcast a message if the message contains a matching key at the matching distance position, broadcast paths may be created on the network. Optionally, diverse collectors and paths may be selected on the network by exchanging traffic condition indications and preferentially selecting paths with better traffic conditions.

Abstract: A generalized virtual router is disclosed. A routing and switching apparatus includes a switching fabric and a matrix of switching and routing elements. At least some of the elements are interconnected by the switching fabric. A router control provides control for the switching fabric. The apparatus has both cross-connect and routing functionality.

Abstract: A process for selecting the best possible route for an alternate communications path in connection-oriented networks takes into account the reserved network resources and the set of links and/or nodes used by a current communications path. Whenever a request for route selection includes the resources reserved by the current communications path, the alternate communications path is computed considering the network resources reserved by the current communications path as available, in addition to the available network resources existing in the topology database. In another embodiment of the invention, the topology database is initially modified such that the network resources reservations used by the current communications path are removed from the topology database. The alternate communications path is then computed. Finally, the topology database is restored to reflect again the network resources reservations used by the current communications path.

Abstract: Source-implemented constraint-based routing with source routing enables traffic engineering to be performed and reservations to be made within a domain without requiring constraint information and reservation information to be disseminated to all nodes in the domain. In one embodiment, a focal node maintains a table containing metrics of links and connection reservations through the domain. When a connection is to be added, the focal node determines a path, given the constraints reflected in the table, and allocates resources on the links forming the path. The table is updated, and the path is used to generate headers for traffic associated with the connection. Traffic from the nodes toward the focal point follow the reverse path. If a node or link fails, connections carried through the failure are identified, reservations on links associated with the connections are released, and new reservations are made taking into account the new network topology.

Abstract: Refresh and filtering mechanisms for LDP based VPLS and L2VPN solutions are disclosed. A method for improving information communication in a network is achieved by these refresh and filtering mechanisms. The network includes provider edge devices which can communicate with each other. The provider edge devices run a communications protocol. The method includes a step of using the communications protocol in providing a first of the provider edge devices with a list of layer-2 virtual private network instances to which a second of the provider edge devices belongs. Another step in the method is filtering layer-2 virtual private network information to be communicated to the second provider edge device from the first provider edge device by reference to the layer-2 virtual private network instances to which the second provider edge device belongs.

Abstract: A router can consider two color vectors for a path including multiple links through a network. One color vector indicates colors that all of the multiple links include. Another color vector indicates the colors that none of the multiple links include. In setting up a constraint-based label switched path (LSP), a router can use a program that includes a logical process. With the process, the router can automatically compute the color vectors for the path whenever the path of an LSP changes and/or the characteristics (colors) of one or more of the multiple links constituting the LSP changes. Computing whether the path is eligible for inclusion in the LSP includes calculating whether the path includes all colors that must be included in an LSP and calculating whether the path includes any of the colors that must be excluded from the LSP.

Abstract: A technique for resource distribution using an auto-discovery mechanism for Provider-Provisioned Layer-2 and Layer-3 Virtual Private Networks. In one particular exemplary embodiment, the technique may be realized by a method for establishing a Virtual Private Network (VPN) tunnel between a first provider edge (PE) device and a second (PE) device of a provider-provisioned VPN. The method may comprise advertising at least one tunnel-based parameter to one or more PE devices over a network backbone using an auto-discovery mechanism, the one or more PE devices including at least one of the first and second PE devices. The method further may comprise configuring a VPN tunnel between the first and second PE devices based at least in part on the at least one tunnel-based parameter.

Abstract: An apparatus and method of forwarding a first message from a source to a destination via a link state routing network utilizes point-to-point feedback messages when the quality of a first path from the source to the destination meets some prescribed condition. To that end, the first path is initialized within the link state routing network. A feedback message having data relating to a quality of the first path then is received as a point-to-point message that is forwarded to the source. In response to receipt of the feedback message, a second path is initialized from the source to the destination. The first message then is forwarded to the destination via the second path.

Abstract: An optical medium containing a transport signal that has a plurality of sub-signals, each sub-signal being characterized by a known wavelength of light and a known bandwidth, the bandwidth of the sub-signals being non-uniform. Optionally, the spacing between the sub-signals (spacing in the optical frequency domain) is non-uniform as well. The spacing between two adjacent sub-signals can be varied on the basis of the bandwidth of the sub-signals.