Abstract: A technique enables resources to be shared among data flows that may have different senders (sources) and/or different receivers (destinations) in a data network. Identifiers are associated with data flows and used to indicate whether resources may be shared between data flows. The identifiers are carried in signaling messages used to reserve resources for data flows. An existing data flow that is associated with an identifier that matches an identifier associated with a new data flow is allowed to share resources its resources with the new data flow.

Abstract: A technique is provided for one or more network nodes to deterministically select data flows to preempt. In particular, each node employs a set of predefined rules which instructs the node as to which existing data flow should be preempted in order to admit a new high-priority data flow. The rules are precisely defined and are common to all nodes configured in accordance with the present invention. Illustratively, a network node not only selects a data flow to preempt, but additionally may identify other “fate sharing” data flows that may be preempted. As used herein, a group of data flows has a fate-sharing relationship if the application instance(s) containing the data flows functions adequately only when all the fate-shared flows are operational. In a first illustrative embodiment, after a data flow in a fate-sharing group is preempted, network nodes may safely tear down the group's remaining data flows.

Abstract: In one embodiment, an intermediate network device includes a communication facility configured to receive a reservation request message that includes a flow spec object. The flow spec object specifies one or more flow parameters that describe a given traffic flow that desires to pass through the intermediate network device. A flow is configured to compare the one or more flow parameters specified in the flow spec object to one or more constants stored in a memory, to determine a type of traffic of the given traffic flow. The flow analyzer determines the type of traffic independent of any differentiated services codepoint (DSCP) values in packets of the given traffic flow. A traffic scheduler is configured to assign the given traffic flow to a particular per hop behavior (PHB) based on the determined type of traffic for the given traffic flow.

Abstract: In one embodiment, a technique is provided to share resources among data flows. An apparatus receives a request for a new data flow where the new data flow is associated with a session group (ID). The apparatus determines that the session group ID of the new data flow matches a session group ID of one or more existing data flows, and that the one or more existing data flows are not already sharing resources with another data flow that has a session group ID different from the first session group ID. Provided this is true, the apparatus shares resources reserved for the one or more existing data flows with the new data flow.

Abstract: A system assigns network traffic flows to appropriate queues and/or queue servicing algorithms based upon one or more flow parameters contained in reservation requests associated with the traffic flows. The system may be disposed at an intermediate network device within a computer network. The intermediate network device includes a reservation engine, a packet classification engine, an admission control entity, a traffic scheduler, and a flow analyzer. The flow analyzer includes or has access to a memory that is preprogrammed with one or more heuristic sets for use in evaluating the flow parameters of reservation requests. When a reservation request that includes one or more flow parameters characterizing the bandwidth and/or forwarding requirements of the anticipated traffic flow is received, the flow analyzer applies the heuristic sets. Depending on which set of heuristics, if any, the parameters satisfy, the flow analyzer selects the appropriate queue and/or queue servicing algorithm for the flow.

Abstract: A technique is provided that correctly allocates resources among data flows while taking maximal advantage of resource sharing opportunities. In accordance with the inventive technique, data flows that share the same session group identifier (SGID) are allowed to share resources if no one data flow within the group is sharing its resources with another data flow that has a different SGID. In addition, resource sharing is allowed between data flows that share the same destination provided that none of the data flows are sharing resources with a data flow from another session.