Abstract: Systems and methods are described for supporting Quality of Service assurances for communication by and between software applications over a best-efforts networks. Characteristic signatures are generated and referenced to segregate traffic on the network into discrete flows. Traffic engineering protocols, such as MPLS, are used to generate discrete paths in the best-efforts network, and flows are routed on such paths based on pre-set policies. The state of individual paths and the network at large are continuously monitored in order to re-map flows on paths and maintain the QoS assurances.

Abstract: Packet formats for routing protocols which combine link state and path vector routing techniques are described. Such protocols are referred to as Link State Path Vector (LSPV) protocols. Embodiments of the invention include extensions to protocols such as the Border Gateway Protocol (BGP) and Intermediate Standard to Intermediate Standard (IS-IS). Embodiments also include packet formats for LSPV protocols which align the bytes of the one or more LSPV protocols with bytes in formats for protocols in the prior art.

Abstract: Policy domains are introduced, which include methods and algorithms for ensuring policy consistency within defined regions of one or more communications networks. Examples of such policies include network functions such as routing, filtering, security, authentication, information summarization and expansion. These policies may be organized into hierarchies of policy categories. The policy domains include mechanisms for adding and deleting policies while preserving consistency, as well a mechanisms for allowing fast synchronization and convergence of policies between local databases resident different nodes/peers in the networks. Policy domains may be delineated by pre-existing logical topologies, such as autonomous systems, or may have evolving boundaries.

Abstract: Routing protocols and algorithms, referred to collectively as “Link State Path Vector” (LSPV) techniques, are described. The LSPV allows the application of link-state techniques, such as flooding, to path vector protocols. Routing peers may be organized to form multiple levels of hierarchy. The LSPV mechanisms enable these peers to (1) exchange routing information via virtual links and (2) calculate the best network routes in light of the routing information. Routes may be selected on the basis of both topological distance and network policy. Such metrics may be determined by combining otherwise orthogonal metrics for IGPs and EGPs.

Abstract: Protocols, data structures, algorithms, architectures, and methodologies are described for securing, compressing, and transmitting data in networks. The invention includes data structures for transmission in networks referred to as “network components.” Network components may form nested structures, and may be processed recursively. Features supported by network components, which perform multiple functions including (1) reducing the data exchanged in networks by replacing repeating information with identification numbers and (2) securing data sent in networks at a detailed level of granularity. Network components also allow the use of link-state protocols for supporting large Network Information Bases, such as BGP. Formats of network components may be constructed and/or altered in real-time, or determined from protocol definitions by automated techniques.