CA2441320A1 - Edge-based per-flow qos admission control in a data network - Google Patents

Edge-based per-flow qos admission control in a data network Download PDF

Info

Publication number
CA2441320A1
CA2441320A1 CA002441320A CA2441320A CA2441320A1 CA 2441320 A1 CA2441320 A1 CA 2441320A1 CA 002441320 A CA002441320 A CA 002441320A CA 2441320 A CA2441320 A CA 2441320A CA 2441320 A1 CA2441320 A1 CA 2441320A1
Authority
CA
Canada
Prior art keywords
router
request
admission control
flow
link
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
Application number
CA002441320A
Other languages
French (fr)
Inventor
Lei Yao
Diana J. Rawlins
David E. Mcdysan
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Verizon Business Global LLC
Original Assignee
Individual
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Individual filed Critical Individual
Publication of CA2441320A1 publication Critical patent/CA2441320A1/en
Abandoned legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/02Topology update or discovery
    • H04L45/10Routing in connection-oriented networks, e.g. X.25 or ATM
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/30Routing of multiclass traffic
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/15Flow control; Congestion control in relation to multipoint traffic
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/20Traffic policing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/24Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2408Traffic characterised by specific attributes, e.g. priority or QoS for supporting different services, e.g. a differentiated services [DiffServ] type of service
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/24Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2441Traffic characterised by specific attributes, e.g. priority or QoS relying on flow classification, e.g. using integrated services [IntServ]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/70Admission control; Resource allocation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/70Admission control; Resource allocation
    • H04L47/72Admission control; Resource allocation using reservation actions during connection setup
    • H04L47/724Admission control; Resource allocation using reservation actions during connection setup at intermediate nodes, e.g. resource reservation protocol [RSVP]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/70Admission control; Resource allocation
    • H04L47/80Actions related to the user profile or the type of traffic
    • H04L47/805QOS or priority aware
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/70Admission control; Resource allocation
    • H04L47/82Miscellaneous aspects
    • H04L47/822Collecting or measuring resource availability data

Abstract

In one embodiment of the invention, a network system includes a boundary router, a second router, and an upstream link of the second router coupled between to the output port of the boundary router and an input port of the second router. The second router includes an admission control function and a data plane. In response to a request to reserve resources for a flow through the second router, the admission control function performs admission control for both the upstream link and its downstream link. In a preferred embodiment, the second router performs admission control for the upstream link only if the second router is a receiving edge router for the flow. Because the second router performs admission control for its upstream link, the boundary router transmits the request toward an upstream router without performing admission control for the link.

Description

EDGE-BASED PER-FLOW QoS ADMISSION CONTROL IN A DATA NETWORK
[0I] The present invention relates to communication networks and, in particular, providing an enhanced quality of service (QoS) to selected traffic flows within a networ [02) For network service provide rs, a key consideration in network design and management is the appropriate allocation of access capacity and network resources between traffic originating from network service customers and traffic originating from outside the service provider's network (e.g., from the Internet). This consideration is particularly significant with respect to the traffic of network customers whose subscription includes a Service Level Agreement (SLA) requiring the network service provider to provide a minimum communication bandwidth or to guarantee a particular Quality of Service (QoS) for certain flows. Such service offerings require the network service provider to implement a network architecture and protocol that achieve a specified QoS and that enforce admission control to ensure sufficient access capacity and network resources are available for customers.
[~3] In Internet Protocol (IP) networks, a straightforward approach to aclueving QoS and implementing admission control comparable to that of connection-oriented network services, such as voice or Asynchronous Transfer Mode (ATM), is to emulate the same hop -by-hop switching paradigm of signaling resource reservations for the flow of IP
packets requiring QoS.
In fact, the IP signaling standard developed by the Internet Engineering Task Force (IETF) for Integrated Services (Intserv or IS) adopts precisely this approach. As described in IETF RFC
1633 [R. Branden et al., "Integrated Services in the Internet Architecture: an Overview" June 1994, Intserv is a per-flow IP QoS architecture that enables applications to choose among multiple, controlled levels of delivery service for their data packets. To support this capability, Intserv permits an application at a transmitter of a packet flow to use the well- known Resource ReSerVation Protocol (RSVP) defined by IETF RFC 2205 [R. Branden et al., "Resource ReSerVation Protocol (RSVP) - Version 1 Functional Specification" Sept: 1997]
to initiate a flow that receives enhanced QoS from network elements along the path to a receiver of the packet flow.
[04] RSVP is a QoS signaling protocol on the control plane of network devices that is utilized to request resources for a simplex flows (i.e., RSVP requests resources for a unidirectional flow).
RSVP does not have routing functions, but is instead designed to operate with unicast and multicast routing protocols to ensure QoS for those packets that are forwarded in accordance with routing (i.e., RSVP consults the forwarding table (as populated by routing) in order to decide the downstream interface on which policy and admission control for QoS
are applied).
[05] Figure 1 is a block diagram of an Intserv nodal processing rriodel that utilizes RSVP to achieve QoS in accordance with RFC 2205. As illustrated, a transmitting host 100 executes an application 104, which transmits data (e.g., video distribution or voice-over-IP (VoIP)) that requires a higher QoS than the "best effort" QoS generally accorded Internet traffic. Between transmitting host 100 and a receiving host 118 are coupled one or more additi onal nodes, such as router 102, which implements a routing process 116.
[06~ In the control plane, each network node includes an RSVP process 106 that supports inter-node communication of RSVP messages, a policy control block 108 that determines if a user has administrative permission to make a resource reservation for an enhanced QoS flow, and an admission control block 110 that determines whether or not the node has sufficient outgoing bandwidth to supply the requested QoS. Tn the data plane, each node fiu th er includes a packet classifier 112, which identifies packets of a flow and determines the QoS class for each packet, and a packet scheduler 114, which actually achieves the QoS required for each flow in accordance with the packet classification performed by packet classifier 112 .
[07] To initiate an RSVP session, application 104 transmits a PATH message, which is sequentially passed to the RSVP process 106 at each node between transmitting host 100 and receiving host 118. Although transmitting host 100 initiates the RSVP session, receiving host 118 is responsible for requesting a specified QoS for the session by sending a RESV message containing a QoS request to each network node along the reverse path between receiving host 118 and transmitting host 100. In response to the receipt of the RESV message, each RSVP
process 106 passes the reservation request to its Local policy control module 108 and admission control block 110. As noted above, policy control block 108 determines whether the user has administrative permission to make the reservation, and admission control block 110 determines whether the node has sufficient available resources (i.e., downstream link bandwidth) to supply the requested QoS. If bothchecks succeed at all nodes between transmitting host 100 and receiving host 118, each RSVP process 106 sets parameter s in the local packet classifier 112 and packet scheduler 114 to obtain the desired QoS, and RSVP process 106 at transmitting host 100 notifies application 104 that the requested QoS has b een granted. If, on the other hand, either check fails at any node in the path, RSVP process 106 at transmitting host 100 returns an error notification to the application 104.
[08j Although conceptually very simple, Intserv QoS provisioning has limited scalab ility because of the computationally intensive RSVP processing that is required at each network node.
In particular, RSVP requires per-flow RSVP signaling, per-flow classification, per -flow policing/shaping, per-flow resource management, and the periodic refreshing of the soft state information per flow. Consequently, the processing required by Intserv RSVP
signaling is comparable to that of telephone or ATM signaling and requires a high performance (i.e., expensive) processor component within each IP rou ter to handle the extensive processing required by such signaling.
[09] In recognition of the scalability and other problems associated with implementing IP QoS
utilizing conventional IntservRSVP signaling, the IETFpromulgated the Differentiated Services (Diffserv or DS) protocol defined in RFC 2475 [S. Blake et al., "An Architecture for Differentiated Services" Dec. 1998]. Diffserv is an IP QoS architecture that achieves scalability by conveying an aggregate traffic classification within a DS field (e.g., the IPv4 Type of Service (TOS) byte or IPv6 traffic class byte) of each IP -layer packet header. The first six bits of the DS
field encode a Diffserv Code Point (DSCP) that requests a specific class of service or Per Hop Behavior (PHB) for the packet at each node along its path within a Diffserv domain.
[10] In a Diffserv domain, network resources are allocated to packet flows in accordance with service provisioning policies, which govern DSCP~marking and traffic conditioning upon entry to the Diffserv domain and traffic forwarding within the Diffserv domain. The marking and conditioning operations need be implemented only at Diffserv network boundaries. Thus, rather than requiring end-to-end signaling between the transmitter and receiver to establish a flow having a specified QoS, Diffserv enables an ingress boundary router to provide the QoS to aggregated flows simply by examining and/or marking each IP packet's header.
[:11] As described in IETF RFC 2998 [Y. Bernet et al., "A Framework for Integrated Services Operation Over Diffserv Networks" Nov. 2000] and as illustrated in Figure 2, Integrated Services can be implemented over a Differentiated Services domain. In the network model illustrated in Figure 2, edge routers (ERs) 120, 128 connect Integrated Services-aware customer LANs (not shown) to boundary routers (BRs) 122, 126 of a Diffserv network 124.
To reflect a unidirectional traffic flow from LAN-TX (transmitting) to LAN-RX (receiving), edge router 120 and boundary muter 122 are labeled ER-TX and BR-TX, respectively, at the transmitter or ingress side, and edge router 128 and boundary router 126 are labeled ER-RX
and BR-RX, respectively, at the receiver or egress side.
[12j Viewed logically, each of routers 120, 122, 126 and 128 has control and data planes, which are respectively depicted in the upper and lower halves of each router.
The data plane includes all of the conventional hardware components in the forwarding path of the router (e. g., interface cards and switching fabric), and the control plane includes control hardware (e.g., a control processor) and control software (e.g., routing, signaling and protocol stacks) that support and direct the operation of the data plane.
[ 13] In the data plane, packets are marked by data plane 120b of ER-TX 120 with the appropriate DSCP (e.g., based upon the Intserv 5- tuple of source address, destination address, protocol id, sotu~ce port and destination port) and forwarded to Diffserv network 124. The packets are then solely Diffserv forwarded across Diffserv network 124 to data plane 128b of ER-RX 128. In the control plane, each of edge routers 120, 128 and boundary routers 122, 126 has a control plane that performs Intserv (IS) processing by reference to policies implemented in policy decision points (PDPs) 130a, 130b. In ER-TX 120, control plane 120a performs Intserv per-flow classification and per-flow policing. In boundary routers 122 and 126, the Intserv interfaces facing edge routers 120, 128 manage RSVP signaling, perform Intserv policy and admission control functions, and maintain per-flow state with path state blocks and reservation state blocks. Control plane 128a of ER-RX 128 performs Intserv per-flow shaping before outgoing packets are forwarded to LAN-RX.
[:1.4] As discussed above, before sending a traffic flow, a tr ansmitting host in LAN-TX
initiates a RSVP PATH message. When the receiving host in LAN-RX receives the PATH
message, the receiving host returns a RESV message along the reverse data path to request reservation of resources to provide the desired QoS. After receiving the RESV
message, each intermediate router having an Intserv control plane performs admission control for only its downstream link. Thus, ER-RX 128 performs admission control for LAN -RX, BR-RX

performs admission control for the link betty een itself and ER-RX 128, BR-TX
122 performs admission control for the path across Diffserv network 124 to BR-RX 126, and performs admission control for the link between itself and BR-TX 122. The RSVP
admission control process verifies resource availability on each link and accordingly adjusts the remaining resource count for the link.
[1 s] Although Intsem per-flow admission control is perfomned on-the control plane, the actual delivery of QoS for a traffic flow is accomplished on the data plane. E R-TX
X20 performs Intserv operations (i. e., per-flow classification, per-flow policing, and per-flow DSCP marking) on data packets received at its Intserv input interface (IS IN). At the Diffserv output interface (DS OUT) of ER-TX 120, datapackets are identified and class-based queued based on only their DSCP values. BR-TX 122 then performs per-class policing for each customer at its input interface (DS IN) and class-based queuing at its output interface (DS OUT). At BR-RX 126, no operation is performed at the input interface (DS IN), and class-based queuing and optionally per-class shaping are performed for each customer port at the output interface. ER-RX 128 forwards packets received at its input interface (DS IN) and may perform per -flow scheduling or shaping at its Intserv output interface (IS OUT).
[16] Although the Diffserv standard improves upon Intserv's scalability by replacing Intserv's processing-intensive signaling in the Diffserv domain with a simple class -based processing, implementation of the Diffserv protocol introduces a different problem. In particular, because Diffserv allows host marking of the service class, a Diffserv network customer link (e.g., the outgoing link of BR-RX 126) can experience a~Denial of Service (DoS) attack if a numb er of hosts send packets to that link with the DS field set to a high priority, as discussed in detail in Application Serial No. 10/023,331 cross-referenced above.
j:17] Furthermore, despite some improvements in scalability within the Diffserv domain, Intserv admission control utilizing RSVP still requires per- flow state installation, per-flow state refreshment, per-flow traffic management and resource reservation on each edge and boundary muter of a service provider's networks. Because boundary routers process thousands of traffic flows as network aggregation points, many vendors' boundary routes s cannot install flow state for such a large number of flows. As a result, RSVP per-flow admission control has been rarely implemented and supported by routes vendors. Thus, conventional Intserv per-flow admission control using RSVP remains undesirable due to its lack of scalability.
[18] The present invention addresses the for egoing and additional shortcomings in the prior art by introducing an improved method, apparatus and system for performing admission control [1t)] In accordance with one embodiment of the invention, a network system includes a boundary router, a second router, and an upstream link of the second router coupled between to the output port of the boundary rou ter and an input port of the second muter.
The second router includes a data plane coupled between the input port and the output port and an admission control function. In response to a request to reserve resources for a flow through the second router, the admission control function performs admission control for both the upstream link and its downstream link. In a preferred embodiment, the second router performs admission control for the upstream link only if the second muter is an edge router for the flow.
Because the second router performs admission control for its upstream link, the boundary router transmits the request toward an upstream router without performing admission control for the link.
(20] Additional objects, features, and advantages of the present invention will become apparent from the following detailed written description.
[2I j The novel features believed characteristic of the invention are set forth in the appended claims. The invention itself however, as well as a preferred mode of use, further objects and advantages thereof, will best be understood by reference to the following detailed description of an illustrative embodiment when read in conjunction with the accompanying drawings, wherein:
[22] Figure 1 depicts a conventional Integrated Services (Intserv) nodal processing model in which per-flow QoS is achieved utilizing RSVP signaling in accordance with RFC
2205;
(23.] Figure 2 illustrates a conventional network model in which Integrated Services (Intserv) are implemented over a Differentiated S ervices (Diffserv) domain in accordance with RFC 2998;

_ 8_ [~4] Figure 3 is a high-level network model that, in accordance with a preferred embodiment of the present invention, implements Intserv over a Diffserv domain while eliminating Intserv processing in the boundary routers of the Diffserv domain;
[25~ Figure 4 illustrates one method by which the receiving edge router of a traffic flow can be identified within the network model of Figure 3 ;
[26] Figure 5 is a more detailed block diagram of a transmitting edge router i n accordance with a preferred embodiment of the present invention;
(Z7~ Figure 6 is a more detailed block diagram of a receiving boundary router and receiving edge router in accordance with a preferred embodiment of the present invention;
(28] Figure 7 is a block diagram of an exemplary server computer system that may be utilized to implement a Policy Decision Point (PDP) in accordance with a preferred embodiment of the present invention;
[29j Figure 8A depicts a preferred method of installing policies on a receiving boundary router and receiving edge router during service initialization;
(30] Figure 8B illustrates a preferred method of installing policies on a receiving boundary router and receiving edge router in response to a service update; and [3:1~ Figure 8C depicts a preferred method of policy synchronization following a direct service update to a receiving boundary router.
I. Network Model Overview [,32] With reference again to the figures and, in particular, with reference to Figure 3, there is depicted a high level block diagram of an scalable network model that provides enhanced QoS to selected traffic by implementing edge-based Intserv over a Diffserv domain in accordance with the present invention. Specifically, as described in detail below, the illustrated network model improves network scalability by eliminating Intserv per-flow admission control from network devices in the Diffserv domain using a mechanism that maps per-flow bandwidth requirements to class-based resource pools for resource reservation and management. For ease of understanding, Figure 3 employs the same receiver/transmitter and data plane/control plane notation utilized in Figure 2 .
[33j In Figure 3, Integrated Services-aware LAN-TX and LAN-RX, which may each contain one or more hosts, are connected to customer premises equipment (CPE) edge routers (ERs) 150, 158. Edge routers 150,158 are in turn coupled by access networks (e.g., LZ
access networks) to boundary routers (BRs) 152, 156 of Diffserv network 124. The network service provider configures routers 150, 152, 156 and 158 and installs admission control and other policies on ,150, 152,156 and 158 utilizing one or more PDPs 160.
[34 j Utilizing this configuration, the network model of Figure 3 supports unidirectional traffic flow from transmitting hosts in LAN-TX to receiving hosts in LAN -RX. As is typical, such communication is preferably conducted utilizing a layered protocol architecture in which each protocol layer is independent of the higher layer and lower layer protocols.
In one preferred embodiment, communication employs the well-known Internet Protocol (IP) at the network .
level, which corresponds to Layer 3 of the ISO/OSI (International Organization for Standardization/Open Systems Interconnect) reference model. Above the network layer, communication may employ TCP (Transmission Control Protocol) or LJDP (User Datagram Protocol) in the transfer layer corresponding to Layer 4 of the OSI/ISO
reference model.

[35j Above the transfer layer, communication may employ any of a number of different ,protocols, as determined in part by the required QoS and other requirements of a flow. For example, the International Telecommunication Union (ITU) H.323 protocol and the IETF
Session Initiation Protocol (SIP) are commonly utilized to provide signaling for voice, video , multimedia and other types of enhanced QoS sessions over an IP network. As an end -to-end protocol, SIP advantageously permits the end nodes with the capability to control call processing utilizing various call features (e.g., Find-me/Follow-rne).
[36j In contrast to the prior art network model illustrated in Figure 2, which requires an Intserv control plane that performs Intserv processing in at least each edge and Diffserv boundary router, the network model illustrated in Figure 2 employs Intserv processing only at the extreme edge of the network, that is, on network-managed CPE edge routers 150,158 . Thus, for the illustrated unidirectional packet flow, edge routers 150, 158 perform Intserv admission control utilizing RSVP signaling to provide enhanced QoS for a flow sent from LAN-TX to LAN-RX. Because edge routers 150, 158 perform Intserv admission control for Diffserv network 154 (and assuming that Diffserv network 154 has been well traffic engineered), there is no need to implement any additional admission control for Diffserv network 154. Consequently, in accordance with the present invention, none of the routers in Diffserv network 154, including boundary routers 152, 156 and unillustrated core routers, is required to have an Intserv control plane, as indicated at reference numerals 152a'and 156a. Consequently, boundary routers 152 and 156 can be significantly simplified to promote enhanced scalability of the service provider network.
[37j To achieve this advantageous simplification in boundary routers 152,156, the network model of Figure 3 implements modifications to the conventional Intserv RSVP
signaling model, which, as described above, always performs symmetric processing at each node to perform admission control for the downstream link. In the network model illustrated in Figure 3, the RSVP RESV message returned by the receiving host is processed only by the Intserv control planes 150x, 158a of edge routers 150, 158, which verify the availability of the requested resources and adjust resource counts accordingly. In particular, Intserv control plane 150a of ER-TX 150 performs downstream admission control for the link between itself and BR- TX 152.
Intserv control plane 158a of ER-RX 158, however, performs admission control not only for its downstream link (i.e., LAN-RX), but also for the upstream link itself and BR-RX 156 because boundary routers 152, 156 are not RSVP -aware.
[38] Although conceptually elegant, this network model shown in Figure 3 has a number of non-trivial challenges that must be addressed in order to obtain operative network implementations. For example, because conventional Intserv RSVP signaling is symmetrical at each node, no conventional mechanism is provided to inform ER-RX 156 that it is the "receiving" edge router and must therefore perform admission control for its upstream link. In addition, conventional Intserv RSVP signaling does not provide ER- RX 156 with any information regarding the resource capacity and resource availability of the upstream link for which admission control must be performed. Moreover, RFC 2998 (and the art generally) does not provide any guidance regarding how to implement Diffserv/Intserv interworking at ER-TX
150 and, in particular, does not' disclose how to map Intserv classes to Diffserv classes.
Preferred solutions to these and other issues concerning an implementation of the network model shown in Figure 3 are described in detail below.
II. Receiving Edge Router Identification (39~ ~ Referring now to Figure 4, there is depicted one preferred method by which an edge router, such as ER-RX 158, can determine that it is the receiving edge router.
In the depicted operating scenario, each of the customer LANs, edge routers 150,158 and boundary routers 152, ' 156 has a different IP address, and the customer LANs coupled to ER- RX 158 are each assigned an IP address that is a subnet of the IP address assigned to ER-RX 158.

(40 J As noted above, a transmitting host in LAN-TX initiates an enhanced QoS
session with a receiving host in LAN-RX by transmitting an RSVP PATH message. Based upon the destination address (DestAddress) specified in the PATH message, which in the illustrated example is a.b.p.d, the PATH message is routed to across Diffserv network 154 to LAN-RX. In response to the PATH message, the receiving host tran smits an RSVP RESV
message containing a SESSION object that specifies the destination address. Upon receipt of the RESV message, the RSVP process in Intserv control plane 158a of ER-RX 158 can determine whether ER-RX
158 is the receiving edge roister by comparing the destination address with the IP subnet address of each attached customer LANs. If and only if the destination address falls into one of its attached customer subnets, ER-RX 158 "knows" it is the receiving edge roister for the traffic flow. For example, when ER-RX 158 receives a RESV message having a SESSION
object containing destination address a.b.p.d, ER- RX 158 knows that it is the receiving edge roister since the IP address of LAN-RX (i.e., a.b.p.d) is an IP subnet address of a.b.p.Ol24. ER-RX 158 therefore performs Intserv admission control for its upstream link for the enhanced QoS flow.
[41] Although this method of identifying the receiving edge roister has the advantage of simplicity, it requires that each destination address specify a subnet of the receiving edge router's 1P address. In implementations in which this restriction is not desirable, alternative methods of identifying the receiving edge roister may be employed. For example, as described below in detail with respect to Figure 6, the receiving edge roister may alternatively be identified through an Edge Point Identification table configured on edge roisters 150, 158 by PDPs 160. These policy data structures specify one or more ranges of IP addresses for which a roister is the receiving edge roister.

III. Resource Management [42] To track resource availability (including the resotuce availability utilized to perform upstream admission control), each Intserv-aware edge router maintains a separate or shared virtual pool in its control plane for each Intserv class, where each virtual pool represents the resource availability for the associated Intserv classes) on a link for which the router performs admission control. Whenever an edge router receives an RSVP RESV message, the edge router performs admission control on the link by checking the requested bandwidth against the appropriate virtual pool to determine resource availability in the requested Intserv class. If the virtual pool indicates the requested bandwidth is less than the available bandwidth, the reservation request is approved and the reservable resources of virtual pool are reduced by the amount of reserved bandwidth. If, however, the requested bandwidth exceeds the virtual pool's available bandwidth the QoS request is denied.
[43~ Interworking between the Intserv admission control and Diffserv data plane functions is achieved by association of the virtual pools utilized to perform Intserv admission control with the logical queues employed by Diffserv to deliver class -based QoS on the data plane. In particular, each Intserv class is uniquely associated with one and only one Diffserv logical queue. However, like the virtual pools utilized to perform Intserv admission control, a separate logical queue can be implemented for each of one or more Intserv classes, and one or more logical queues may be implemented as shared queues that are associated with multiple Intserv classes.
[~~] Table I below summarizes the possible combinations of logical queues and virtual pools that may be implemented within the boundary and edge routers of a service provider network.

Table I
Logical Queue Virtual pool Separate Shared Separate Case 1 , Not Applicable Shared Case 3 Case 2 (45j As shown in Table I, three cases are possible: separate virtual pools with sep agate logical queues, shared virtual pools with shared logical queues, and separate virtual pools with shared logical queues. The case of a virtual pool shag ed by multiple Intserv classes is not applicable to an implementation having separate logical queues for each Intserv class, since no virtual pool information would be available on an individual class basis. Importantly, boundary and edge routers in the same network may be configured to concurrently implement different cases, as long as marking is correctly performed.
[4&j With reference now to Figures 5 and 6, there are depicted more detailed block diagrams of edge and boundary routers of the network model of Figure 3 in which traffic in each Intserv service class is assigned a separate virtual pool in the control plane and separate logical queue in the data plane in accordance with Case 1 of Table I. Referring first to Figure 5, a more detailed block diagram of ER-TX 150 is depicted. As noted above, ER-TX 150 has an Intserv control plane 150a, which manages RSVP signaling and implements Intserv policy and admission control, and a data plane 150b, which provides the link level delivery of Diffserv class-based QoS. Control plane 150a includes an RSVP process 180, an admission control block 182 having associated virtual pools 184, a policy control block 188, an IS-DS
interworking function (IWF) configuration block 186, and a Policy Configuration Interface (PCI) 190 through which ER-TX
150 communicates policy information with PDP 160a. Data plane 150b has an input port 200, a forwarding function 208, and an output port 210 having a number of queues 212 that each corresponds to a Diffserv class.

[47) As described above, RSVP process 180 in control plane 150a handles RSVP
signaling (e.g., PATH and RESV messages) utilized to reserve (and release) resources for enhanced QoS
flows. In response to receiving a RESV message requesting resources for an enhanced QoS
flow, RSVP process 180 interrogates admission control block 182 and policy control block 188 to verify that the requestor has administrative permission to establish the QoS flow and that the downstream interface has sufficient available resources to support the requested QoS. In addition to determining administrative permission, policy control block 188 can execute additional policies, such as authentication based on certificates or signatures, management of bandwidth distribution among the authorized r equestors, and preemption of allocated resources for a pending, higher-priority flow.
[48] In' the illustrated embodiment, each supported Intserv class (e.g., Guaranteed Service (GS) and Controlled Load (CL)) has a separate virtual pool 184a, 184b.
Admission control block 182 monitors the availability of resources on the downstream link for each Intserv class using virtual r esource pools 184. Thus, admission control block 182 grants reservation requests when sufficient available bandwidth is available in the virtual pool associated with the requested Intserv class and otherwise denies the reservation request. Admission control block 182 reduces the available resources in a virtual pool by the amount requested by each successful reservation, and increases the reservable resources in a virtual pool by the amount of resources freed upon termination of a flow. Importantly, the number of virtual pools, the bandwidth allocated to each virtual pool 184, and the mapping between the virtual pools and Diffserv classes are not fixed, but are instead expressed as policies that are installed at ER-TX 150 (and other network elements) by a PDP 160. Utilizing Common Open Policy Service (COPS) or other protocol, such policies rnay be pushed onto network elements by PDP 160 or pulled from PDP 160 by a network element, for example, in response to receipt of an RSVP RESV message.
[4~~ PDP 160a configures the mapping between Intserv classes and Diffserv classes (and DSCPs) on IS-DS IWF configuration block 186 (e.g., GS to DSCP 100011, CL to DSCP

010011). IS-DS IWF configuration bloclc 186 may also receive configurations from RSVP
process 180. Based upon these configurations, IS- DS IWF configuration block 186 dynamically provisions a packet classifier 202, politer 204, and marker 206 on input port 200 for each Intserv flow. (In some implementations, packet classifier 202, politer 204, and marker 206 may be implemented as a single integrated module, such as a Field Programmable Gate Array (FPGA) or Application Specific Integrated Circuit (ASIC).) (50] In accordance with this provisioning, packets within each Intserv flow, whose service class is indicated by an Intserv 5-tuple, are classified and marked by packet classifier 202 and marker 206 with the appropriate DSCP of the aggregate Diffserv class (e.g., with one of the 16 code points (Pool 2 xxxxl l) reserved for experimental or local use). In this manner, Intserv flows having enhanced QoS are aggregated into preferential Diffserv classes.
Because the embodiment shown in Figure 5 reflects Case 1 from Table I, a separate logical queue 212 is provided on port 210 for each supported Intserv class (GS and CL) in addition to the logical queues assigned to other Diffserv classes (e.g., the Expedited Forwarding (EF), Assured Forwarding (AF) and default Best Effort (BE) classes). Scheduler 214 then provides the appropriate QoS to the packets within each to gical queue 212 by scheduling packet transmission from logical queues 212 in accordance with scheduler weights assigned to each logical queue 212 by PDP 160a.
(51] Because the illustrated embodiment of ER-TX 150 is managed by the network service provider, ER-TX 150 can be trusted by the network service provider to' correctly mark packets with DSCPs so that no "theft" of QoS occurs. In alternative embodiments in which ER-TX is not managed by the network service provider, PDP server 160a may provide the Diffserv classification policies to BR-TX 152 instead of ER-TX 150. It should also be noted that core routers of Diffserv network 154 need not implement separate Diffserv queues for Intserv flows, even if separate queues are implemented on edge and boundary routers.

(52] Referring now to Figure 6, there are illustrated more detailed block diagrams of BR -RX
156 and ER-RX 158 in accordance with a preferred implementation of Case 1 of Table I. As noted above, BR-RX 156 and ER-RX 158 have respective control planes 156a, 158a and data planes 156b, 158b. Control plane 158a of ER-RX ,158 is an enhanced Intserv control plane including a PCI 190, an RSVP process 180 having associated admission and policy control blocks 182 and 188, and an edge point identification table 252 and upstream virtual pools 250 by which admission control block 182 performs upstream admission control. BR-RX
156a, .by contrast, has no Intserv control plane, but instead includes only a PCI 190 through which the components of data plane 156b are configured by PDP 160b .
[53 j Within control plane 158a of ER-RX 158, PDP 160b installs policies by which local policy control 188 determines which customers having administrative permission to request resource reservations for enhanced QoS flows. In addition, PDP 160b installs an edge point identification table 252 that specifies one or more ranges of destination IP
addresses for which ER-RX 158 is the receiving edge router. Thus, upon receipt of a RESV message requesting an enhanced QoS flow for which the customer is granted administrative permission by policy control 188, admission control 182 interrogates edge point identification table 252 to determine if ER-RX 158 is the receiving edge router for the requested flow. If not, ER-RX 158 performs only conventional downstream admission control. However, if edge point identification table 252 indicates that ER-RX 158 is the receiving edge router for the requested flow, admission control block 182 performs upstream admission control by reference to the upstream virtual pool capacities allocated by PDP 160b to each Intserv class within virtual pools 250. As described generally above, each virtual pool 250a, 250b is utilized by admission control block 182 to ascertain the availability of sufficient bandwidth for a reques ted flow of a particular Intserv class on the upstr eam link between ER-RX 158 and BR-TX 152. As indicated at reference numeral 252, PDP 160b obtains periodic or solicited feedback regarding virtual pool usage on ER-RX
158 and dynamically coordinates any operator-initiated adjustments to the capacities of the virtual pools with updates to the logical queues) and scheduler weights) implemented in the data plane to ensure that the Intserv bandwidth actually utilized is less than the operator-specified capacity.
(~4] Referring now to the data plane, data plane 158b of ER-RX 158 may be implemented with conventional classification, forwarding and Intserv queuing, the details of which are omitted to avoid obscuring the present invention. Data plane 156b of BR-RX 156 includes an input port 220 having a classifier 222, an output port 240 having a plurality of Diffserv physical queues 242 and a scheduler 244, and a forwarding function 230 that switches packets from the input port to the appropriate physical queues 242 on output port 240 in accordance with the classification performed by classifier 222. As indicated, classifier 222 and physical. queues 242 are configured by PDP 160b in a coordinated manner to reflect the configuration of upstream Intserv virtual pools on control plane 158a of ER-RX 158. In particular, in the illustrated embodiment, classifier 222 is configured to identify packets belongXng to the separate Diffserv classes into which Intserv traffic are aggregated, such the packets in each Diffserv class representing an Intserv traffic type are forwarded to separate physical queues 242 for Intserv GS
and CL classes on output port 240. PDP 160b also configures the scheduling weight scheduler 244 gives each of queues 242. In addition, PDP 160 coordinates the sum of the virtual pool capacities on ER-RX 158 with the resource pool capacity dictated by queue capacities and weights in data plane 156b of BR-RX 156 to ensure that the virtual pool capacity does not exceed the actual resource pool capacity. Thus, in essence, ER-RX performs upstream admission control as a proxy for BR-RX.
(S~~ Mapping different Intserv classes to separate virtual pools and Diffserv queues as shown in Figures 5 and 6 permits better tr affic management than mapping all Intserv classes to a single Diffserv queue. By preserving the distinction between Tntserv classes over the Diffserv network in this manner, different traffic types (e.g., VoIP, VideoIP and file transfer) can be provided optimal handling, and enterprise resource planning is simplified. However, as noted above, some or all routers in a service provider network may alternatively be implemented in accordance with Cases 2 and 3. To implement Case 2 instead of Case 1, ER-TX
150 and ER -RX 158 are configured with a single shared virtual pool for multiple Intserv classes, and ER -TX
150 and BR-RX 156 are configured with a single shared logical queue for the multiple Intserv classes. Alternatively, to implement Case III, ER- TX 150 and ER-RX 158 are configured with separate virtual pools, and ER-TX 150 and BR-RX 156 are each configured with a single shared queue for multiple Intserv classes.
[56] It should be noted that no flow-specific network configuration of control plane 152a or data plane 152b of BR-TX 152 is required in order to provide enhanced QoS to particular flows.
This is because the admission control provided by downstream ER-RX 158 ensures that the downstream link of BR-TX 152 has sufficient bandwidth to support each admitted enhanced QoS flow, and the mapping of Intserv flows to particular Diffserv classes ensures that data plane 152b achieves the requested QoS.
IV. PDP
[57] With reference now to Figure 7, there is depicted a high level block diagram of a server computer system that may be employed as a PDP 160 in accordance With a preferred embodiment of the present invention. PDP 160 includes one or more processors 262 coupled by an interconnect 264 to a storage subsystem 268, which may comprise random access memory (RANI), read only memory (ROM), magnetic disk, optical disk and/or other storage technology.
Storage subsystem 268 provides storage for data (e.g., tables 280-290) and instructions (e.g.
configuration manager 292) processed by processors) 262 to configure network elements and to install and determine network policies. Also coupled to interconnect 264 may be one or more input devices (e.g., a keyboard and/or graphical pointing device) 270 and one or more output devices (e.g., a display) 272, as well as a communication interface 274 through which computer system 260 may communicate with network devices, such as routers 150, 152, 156 and 160.

-2o-[58J To configura and install policies on routers 150,156,160 inthe manner described above, each PDP 160 preferably implements a number of Policy Rule Class (PRC) tables within stora ge subsystem 268. In one preferred embodiment, these PRC tables include at least an Admission Control Virtual Pool Table 280, Intserv'Capacity Table 282, Intserv-to-Diffserv Interworking Function Table 284, Edge Point Identification Table 286, Pool Usage Feedback Table 288, and Boundary Resource Pool Table 290.
[59] Admission Control Virtual Pool Table 280 determines the capacities of the virtual pools on edge routers 150, 158 that are utilized to perform admission control for various Intserv classes. In Admission Control Virtual Pool Table 280, the sum of the capacities assigned to the virtual pools associated with all Intserv classes is set to be less than the data plane queue capacity of the associated boundary routes to ensure that the requested QoS of each admitted flow cari be achieved in the data plane. The table further specifies whether the admission control will accept reservations and the logical interface name of the boundary routes associated an edge routes. In an exemplary embodiment, Admission Control Virtual Pool Table 280 may be defined as follows:
AdmCtlVirtualPoolTable Logical Interface Name Description: This SNMP string identifies the logical interface associated with the AdmCtlVirlualPool entry.
Object Type: SNMP string Direction Description: This attribute indicates the relationship of the traffic stream to the interface as either (1) inbound or (2) outbound. This attribute is used in combination with the BoundaryLogicalInterfaceName to differentiate ER-RX virtual resource pools and ER-TX virtual resource pools. An ER-RX upstream virtual resource pool has an inbound Direction and non-empty BoundaryLogicalInterfaceName. An ER-TX
downstream virtual resource pool has an outbound Direction and a non -empty BoundaryLogicalInterfaceName ath~i bute. An ER-RX downstream virtual resource pool has an outbound Direction and an empty BoundaryLogicallnterfaceName attribute.

IntSrvClass Description: This bit string indicates the Intserv class or classes that have resources allocated by admission control from this virtual pool.
Object Type: bits Controlled Load Service (1) Guaranteed Services (2) Null Service (3) Other (4) VirtualPoolMaxAbsRate Description: the maximum absolute rate in kilobits that this pool may allocate to Intserv sessions defined by the AdmCtlIntSrvClass. The sum of ER-RX upstream virhzal resource pools is not to exceed the ResourcePoolMaxAbsRate for the associated BoundaiyInterfaceName.
Object Type: Unsigned 32 BoundaryLogicalInterfaceName Description: identifies the adjacent boon dary router and resource pool that governs the capacity of the local virtual pool defined by this entry. An empty attribute signifies that the VirtualPoolMaxAbsRate is governed by a local ResourcePoolMaxAbsRate defined for the LogicalInterfaceName of this entry. A non-empty attribute indicates that a remote virtual pool capacity defined for this BoundaryLogicalInterfaceName governs the value of the VirtualPoolMaxAbsRate of this entry.
Object Type: SNMP string AcceptReservations Description: This value ind icates whether Admission Control will attempt to process RSVP RESV requests. A value of 0 indicates that reservations are not to be processed. A value of 1 indicates reservations are to be processed.
Object Type: Unsigned 32 [fmOj Intsem Capacity Table 2~2 defines the data plane data rate capacity allocated to Intserv classes in terms of both Diffserv queue weights and shaper parameters. These rate capacities are also associated by the table with one or more edge router victual pools. This Policy Rule Class, according to one preferred embodiment, is contained in the Differentiated Services Policy Information Base (PIB).

[61] Intserv-to-Diffserv IVJF Table 284 defines the attributes used for interworking between the RSVP process in the control plane and Diffserv in the data plane. These attributes are used by classifier 202, policer 204, and marker 206 on input port 200 of ER-TX 150 to classify, police and mark Intserv traffic flows so that Diffserv achieves the appropriate QoS
for each flow. In addition, the table specifies the specific scheduler instance to be used for flows having particular Intserv classes. An exemplary embodiment of Intserv -to-Diffserv IWF Table 284 is as follows:
Intserv-to-Diffserv Interworking Function Table IwII'rid Description: This is the unique identifier of the PktIwffable entry.
Object Type: Instance ID (unsigned 32) IwfIntSrvClass Description: The value of the Intserv Class associated with the attributes of this specific interworking function entry. (It must have a corresponding bit set in AdmCtlIntSrvClass) Object Type: unsigned 32 IwfDSCP
Description: The value of the DSCP to assign the data steam for the session with the Intserv class type matching the value of PktIwfIntSrvClass.
Obj ect Type: integer value 0 - 63 IwfOutOfProfile Description: This value indicates the policing behavior when the data stream is out of profile. The profile can be defined by the associated MeterTableEntry. A value of 1 indicates out-of-profile packets are to be dropped. A value of 2 indicates out-of profile packets are to be remarked with the DSCP defined in IwfRemarkValue.
Object Type: Unsigned 32 IwfRemarkValue Description: The value of the DSCP to remark an out-of profile packet.
This value is only used if the IwfOutOfProfile is set to 2.
Object Type: Unsigned 32 value 0-63 IwfS chedulerPrid Description: The value of the instance ID of the specific scheduler to be used by data streams of the sessions with an Intserv class matching the value of attribute IwfIntSrvClass.
Object Type: Unsigned 32 [62] Edge Point Identification Table 286 defines a range or ranges of addresses for which an edge muter is a receiving edge router. This information may be configur ed on PDP 160 initially or may be learned locally. Admission control block 182 on ER-RX 158 performs upstream admission control for reservation requests that specify a destination address within the RSVP
SESSION Obj ect that falls within one of these address ranges. The values for a particular edge router may be pushed down by PDP 160 to the local Edge Point Identification Table 252 utilizing COPS or other policy protocol. According to one embodiment, Edge Point Identification Table 286 may be defined as follows:
End Point Identification Table ReceiverDomainPrid Description: unique identifier of an entry of this policy rule class Object Type: Instance ID, a 32 bit unsigned integer.
ReceiverAddrType Description: The enumeration value that specifies the address type as defined in RFC 2851 [M. Daniele et al., "Textual Conventions for Internet Network Addresses" Feb. 2000]
Object Type: INET Address Type as defined by RFC 2851 ReceiverAddr Description: The IP address for the Session Object Destination Address to match Object Type: INET Address as defined by RFC 2851 ReceiverAddrlVlask Description: the length of the mask for matching the INET Address Object Type: unsigned 32 [63] Pool Usage Feedback Table 288 contains entries that specify the current resources consumed by Intserv flows. This PRC table, which is used by PDP 160 to determine when to complete provisioning an operator-initiated capacity update, may in an exemplary embodiment be defined as follows:

Pool Usage Feedback Table Usage Feedback Prid Description: unique identifier of the Virtual Pool Usage Feedback entry.
Object Type: Instance Id. (unsigned 32) PoolPrid Description: value of the instance ID of the specific AdmCtlVirtualPool entry that usage is describing.
Object Type : Unsigned 32 ResourceAbsRateInUse Description: current total value of the Intserv resources in use.
[6~] Boundary Resource Pool Table 290 defines the total rate capacity that may be assigned by PDP 160 to the various admission control virtual pools associated with a given egress boundary router (BR-RX). This PRC table may be defined in an exemplary embodiment as follows:
Boundary Resource Pool Table BoundaryResourcePool TableBoundaryResourcePoolPrid Description: unique identifier of the Virtual Pool Usage Feedback entry Object Type: Instance Id. (unsigned 32) BoundaryLogical Interface Name Description: identifies the adjacent boundary router and resource pool that governs that capacity of the local virtual pools associated with this entry in the AdmissionCtlVirtualPool Table Object Type: SNMP string ResourcePoolMaxAbsRate Description: maximum absolute rate in kilobits that may be allocated to IntServ sessions defined by the AdmCtlIntSrvClass. The sum of ER -RX
upstream virtual pools is not to exceed the ResourcePoolMaxAbsRate for the associated BoundaryInterfaceName.
Object Type: Unsigned 32 V: Network Configuration [65] With reference now to Figures 8A-8C, a number of network diagrams are depicted, which together illustrate preferred techniques by which PDP 160b configures and installs policies on BR-RX 156 and ER-RX 158. The illustrated functions may be implemented, for example, through the execution by PDP 160 of configuration manager software 292. In each figure, it is assumed that communication between PDP 160b and routers 156, 158 is conducted utilizing COPS, although it should be understood that other proto cots may be employed.
[66~ Figure 8A specifically illustrates PDP 160b synchronizing virtual pool capacities on ER-RX 158 with Diffserv logical queue bandwidths on BR -RX 152 during service initialization. As indicated at reference numeral 300 of Figure 8A, a Network Management System (NMS) may initiate the configuration of Intserv capacity for a customer, for example, during service initialization. In response, PDP 160b pushes the configuration of Intserv virtual pool capacities onto each network-managed edge router (of which only ER-RX 158 is shown) that is downstream of a boundary router of Diffserv network 154. For example, in the depicted embodiment, PDP 160b pushes the virtual pool capacity for each Intserv class supported by LP 1 at interface l .m.n.b/30 onto ER-RX 158 with a message allocating 10 megabits to the Intserv GS
class and 25 megabits, to the Intserv CL class. If the configuration is successfully installed on ER-RX 158, ER-RX 158 replies with an acknowledgement (ACK) .message, as shown at reference numeral 304. PDP 160b, as indicated at reference numeral 306, then pushes the corresponding configuration of Diffsem queues) and scheduler weights) onto BR-RX 156.
BR-RX 156 also returns an ACK 308 to PDP 160b if the configuration is successfully in stalled.
[67:] If ER-RX 158 fails tb install the virtual pool capacities pushed down by PDP 160b, ER-RX 158 returns a negative acknowledgement (HACK) to PDP 160b. PDP 160b accordingly sends a warning message to a network operator, such as "Fail to configure In tegrated Services virtual pool on ER XX!" Similarly, if the queues) and scheduler weights) cannot be installed on BR-RX 156, BR-RX 156 returns an NACK to PDP 160b. Iii response, PDP 160b transmits a message to ER-RX 158 to release the configuration of the virtual pools and may also send a warning message to a network operator stating: "Fail to configure Queue and Scheduler on BR
n~
XX.
[68] It should be noted that PDP 160b may not directly communicate with network elements, such as BR-RX 156 and ER-RX 158, but may instead communicate through other network elements. For example, messages between PDP 160b and BR-RX 156 may be communicated through ER-RX 158.
[69] Attention is now turned to a scenario in which a service update (i.e., an increase or decrease in subscribed Intserv capacity) is performed for an existing network service customer.
Increasing or decreasing the BR-RX capacity when the currently reserved bandwidth is below the new subscribed capacity is a straightforward process because the new capacity can accommodate all ongoing customer traffic, meaning no service impact will be observed.
However, decreasing the BR-RX capacity when the currently reserved bandwidth is greater than the newly requested capacity requires coordination among PDP 160b, BR-RX 156, and ER-RX
158, as described below with respect to Figure 8B.
[70] In Figure 8B, the NMS may initiate the reconfiguration of Intserv capacity for an existing network service customer, as depicted at reference numeral 320. As shown at reference numeral 322, PDP 160b installs the new virtual pool capacity values) on ER-RX
158.
Admission control block 182 of ER-RX 158 compar es each new virtual pool capacity value with the amount of resources currently reserved within each virtual pool. If the new virtual pool capacity values) are greater than the amount of resources currently reserved from each virtual pool, admission control block 182 of ER-RX 158 overwrites the virtual pool capacity values) with the new values) and immediately sends an ACK 324 to PDP 160b. However, if the new virtual pool capacity values) are less than the amount of currently reserved resources, admission control block 182 of ER-RX 158 saves the new capacity values) without overwriting the old ones. Admission control block 182 of ER-RX 158 accepts no new reservations from a virtual pool to which an update is to be performed until the amount of reserved resources falls below the new virtual pool capacity. Once the reserved resources fall below the new virtual pool capacity, admission control block 182 of ER-RX 158 overwrites the old virtual pool capacity values) with the new value(s), and acknowledges acceptance of the new virtual pool capacity values) by sending an ACK 324 to PDP 160b.
['71] PDP.160b defers installation of new scheduler weights) on BR-RX 156 until PDP 160b receives ACK 324 from ER-RX 158. In response to ACK 324, PDP 160b pushes queue configurations) and scheduler weights) onto BR- RX 156, as illustrated at reference numeral 326. After successful installation of the new queue configurations) and scheduler weight(s), BR-RX 156 xeturns an ACK 328 to PDP 160b .
[72,[ In an alternative embodiment, PDP 160b determines when to perform a virtual pool capacity update instead of ER-RX 158. In this embodiment, PDP 160b solicits reports of or programs periodic unsolicited reporting by ER- RX 158 of the currently reserved Intserv bandwidth. If the currently reserved bandwidth is greater than the new capacity specified by the NMS, PDP 160b pushes a policy to ER-RX 158 to stop accepting new reservations until the reserved bandwidth is below the new capacity. To further reduce the amount of messaging, PDP
160b may push a policy on ER-RX 158 that instructs ER-RX 158 to send a single unsolicited report to PDP 160b only after the reserved bandwi dth is less than the new capacity. In response to a message from ER-RX 158 indicating that the currently reserved Intserv bandwidth is less than.the new virtual pool capacity, PDP 160b pushes the new Intserv virtual pool policy onto ER-RX 158 and pushes the corresponding new scheduler queues and weights to BR-RX 156 in the manner described above.

[73] If PDP 160b fails to successfully update either ER-RX 158 or BR-RX 156, PDP 160b may roll back to the old virtual pool capacities and queue and scheduler weight configuration.
Additionally, PDP 160b may send warning messages to the network operator to describe the reason of the failure (e.g., "Failure to configure the updated Integrated Services virtual pool capacity on ER XX!" ox "Failure to configure the update d scheduler weight on BR X~~!").
['74] To prevent a PDP (e.g., PDP server 160b) from Becoming a single point of failure, a backup PDP may be utilized for one or more primary PDPs. In the event that a primary PDP
fails, the Intserv service control may be switche d to the backup PDP, and each ER-RX controlled by the primary PDP may report its current reservation state to the backup PDP.
However, each ER-RX should stop accepting new reservations until the switch to the backup PDP is completed.
After the primary PDP is restored, the backup PDP first synchronizes state with the primary PDP and then informs each ER-RX to switch back to the primaiy PDP. After switching back to the primary PDP, each ER-RX synchronizes its reservation state with the primary PDP.
f75] In the event of a failed ER or BR, IP routing and RSVP refresh messages are used to discover a new route and reroute flows around the failed ER or BR. Upon successful rerouting, PDP' 160b may push a policy to the corresponding BR-RX 156 to release the Diffserv queues allocated to Intserv trafftc for the failed ER-RX or push policies to all downstream ER-RXs of a failed BR-RX to release the configured virtual pools) for the failed BR -RX.
[76~ Referring now to Figure 8C, there is illustrated an exemplary scenario in w hich an NMS
or network service provider operator directly alters the configuration of queues) and scheduler weights) on BR-RX 156. In response to the update, BR-RX 156 notifies PDP 160b of the changes. If not contained in the notification, PDP 160b pulls the configuration update from BR
RX 156, as indicated at reference numeral 342, and then, as depicted at reference numeral 344, pushes the new configuration of virtual pool capacities onto all affected ER-RX(s) (of which only ER-RX 158 is shown).

VI. Conclusion [77J As has been described, the present invention provides a scalable IP
network model that provides end-to-end QoS for selected flows by implementing edge-based Intserv over a Diffseiv domain. The network model supports a number of functions, including per -flow admission control utilizing Intserv RSVP processing only at the CPE edge routers, receiving edge router identification, upstream admission control at the receiving edge router, pool-based resource management, and synchronization' of bandwidth usage information between the receiving boundary router and receiving edge router by policy management. Despite introducing additional functionality, the network model of the present invention is consistent with existing Intserv, COPS and Diffserv models, and the Diffserv policy provisioning model using policy and management information bases. The network model of the present invention advantageously enhances scalability while maintaining a standardized architecture and can therefore be readily adopted for implementation.
[7S] While various embodiments of the present invention have been described above, it should be understood that they have been presented by way of example only, and not limitation. Thus, the breadth and scope of the present invention should not be limited by any of the above-described exemplary embodiments, but should be defined only in accordance with the following claims and their equivalents, For example, although the present invention has been primarily discussed with respect to implementations employing Resource Reservation Protocol (RSVP) and Internet Protocol (IP), it should be appreciated the present invention has applicability to other communication protocols, including Session Initiation Protocol (SIP) and ITU H.323, which may be used to perform admission control by the selective admission or denial of an enhanced QoS flow based uponpolicy and available resources. Moreover, although the present invention has been described with respect to various hardware elements that perform various functions in order to achieve end-to- end QoS for selected network flows, it should be understood that such functions can be realized through the execution of program code embodied in a -3o-computer-readable medium. The term "computer-readable medium" as used herein refexs to any medium that participates in providing instructions to a data processing system for execution.
Such a medium may take many forms, including but not limited to non -volatile media, volatile media-, and transmission media.

Claims (53)

What is claimed is:
1. A router, comprising:
a data plane having an input port connectable to an upstream link and an output port connectable to a downstream link and an admission control function that, responsive to a request to reserve resources fo ra flow through said data plane, performs admission control for both the upstream link and the downstream link.
2. The roter of Claim 1, wherein said admission control function includes means for determining whether said router is an edge router of a network, and wherein said admission control block performs admission control for the upstream link only in response to a determination that said router is an edge router for the flow.
3. The router of Claim 2, wherein said means for determining whether said router is an edge router for the flow comprises means for comparing a destination address of the flow with an address assigned to the router.
4. The router of Claim 2, wherein said means for determining whether said router is an edge router for the flow comprises means for interrogating a data structure that specifies one or more destination addresses for which the router is the edge router.
5. The router of Claim 1, and further comprising a policy control that determines whether a source of the flow is authorized to request resource reservation.
6. The router of Claim 1, and further comprising a Resource Reservation Protocol (RSVP) function in communication with said admission control function, wherein said RSVP function receives said request and provides said request to said admission control function.
7. The router of Claim 1, and further comprising one or more resource pools for the upstream link, wherein said admission control function performs admission control for said upstream link by reference to resource availability within said one or more resource pools.
8. The routes of Claim 7, wherein said one or more resource pools each indicate resource availability in a respective associated Differentiated Services service class.
9. A network system, comprising:
a first routes having an output port;
an upstream link coupled to the output port of the first router;
a second router, including:
a data plane having an input port connected to the upstream link and an output port connectable to a downstream link ; and an admission control function that, responsive to a request to reserve resources for a flow through said data plane, performs admission control for both the upstream link and the downstream link.
10. The network system of Claim 9, wherein said admission control function includes means for determining whether said second router is an edge router of a network, and wherein said admission control block performs admission control for the upstream link only in response to a determination that said second router is an edge router for the flow.
11. The network system of Claim 10, wherein said means for determining whether said second router is an edge routes for the flow comprises means for comparing a destination address of the flow with an address assigned to the second router .
12. The network system of Claim 10, wherein said means for determining whether said second router is an edge router for the flow comprises means for interrogating a data structure that specifies one or more destination addresses for which the second router is an edge router.
13. The network system of Claim 9, said second router further comprising a policy control that determines whether a source of the flow is authorized to request resource reservation.
14. The network system of Claim 9, said second router further comprising a Resource Reservation Protocol (RSVP) function in communication with said admission control function, wherein said RSVP function receives said request and provides said request to said admission control function.
15. The network system of Claim 9, said second router including one or more resource pools for the upstream link, wherein said admission control function performs admission control for said upstream link by reference to resource availability within said one or more resource pools.
16. The network system of Claim 15, wherein said one or more resource pools each indicate resource availability in a respective associated Differentiated Services service class.
17. The network system of Claim 9, and further comprising a service provider network having a plurality of first routers including said first router.
18. The network system of Claim 17, wherein said service provider network comprises a Differentiated Services network and said request comprises a Resource Reservation Protocol (RSVP) request to reserve resources for, an Integrated Services flow.
19. The network system of Claim 18, wherein said first router comprises a data plane including a forwarding function and a plurality of queues that each provide a different quality of service, wherein said forwarding function switches packets of Integrated Services flows into multiple different ones of said plurality of queues for transmission to said second router.
20. The network system of Claim 9, and further comprising:

the downstream link connected to said output port; and a customer network coupled to the downstream link.
21. A method of operating a router having an input port connected to an upstream link and an output port connected to a downstream link, said method comprising:
receiving a request to reserve resources for a flow through said router onto said downstream link; and in response to receipt of said request, said router performing admission control for both the upstream link and the downstream link.
22. The method of Claim 21, and further comprising determining whether said router is an edge router for the flow, wherein said router performs admission control for the upstream link only in response to a determination that said router is an edge router for the flow.
23. The method of Claim 22, wherein said determining comprises comparing a destination address of the flow with an address assigned to the router.
24. The method of Claim 22, wherein said determining comprises interrogating a data structure that specifies one or more destination addresses for which the router is an edge router.
25. The method of Claim 21, and further comprising implementing policy control by determining whether a source of the flow is authorized to request resource reservation.
26. The method of Claim 21, wherein said receiving comprises receiving a Resource Reservation Protocol (RSVP) request for an Integrated Services flow.
27. The method of Claim 21, wherein said router maintains one or more resource pools for the upstream link, and wherein performing admission control for said upstream link comprises performing admission control for said upstream link by reference to resource availability within said one or more resource pools.
28. The method of Claim 27, wherein said one or more resource pools each indicate resource availability in an associated Differentiated Services service class and wherein performing admission control comprises determining resource availability in a res ource pool associated with a service class specified by the request.
29. The method of Claim 21, wherein said edge router comprises a downstream edge router, and said method further comprises transmitting said request from said downstream edge router to an upstream edge router.
30. The method of Claim 29, wherein said transmitting comprises transmitting said request to said upstream edge router without performing admission control at any intervening router.
31. A program product for operating a router having an input port connected to an upstream link and an output port connected to a downstream link, said program product comprising:
a computer usable medium; and a control program including:
instructions for causing the router to receive a request to reserve resources for a flow through said router onto said downstream link; and instructions for causing the router, in response to receipt of said request, to perform admission control for both the upstream link and the downstream link.
32. The program product of Claim 31, said control program further comprising instructions for causing said router to determine whether said router is an edge router for the flow, wherein said router performs admission control for the upstream link only in response to a determination that said router is an edge router for the flow.
33. The program product of Claim 32, wherein said instructions for causing said router to determine whether said router is an edge router comprise instructions for comparing a destination address of the flow with an address assigned to the router.
34. The program product of Claim 32, wherein said instructions for causing said router to determine whether said router is an edge router comprise instructions for interrogating a data structure that specifies one or more destination addresses for which the router is an edge router.
35. The program product of Claim 31, and further comprising instructions for causing said router to implement policy control by determining whether a source of the flow is authorized to request resource reservation.
36. The program product of Claim 31, wherein said instructions for causing said router to receive a request comprise instructions for causing said router to receive a Resource Reservation Protocol (RSVP) request for an Integrated Services flow.
37. The program product of Claim 31, wherein said router maintains one or more resource pools for the upstream link, and wherein said instructions for causing said router to perform admission control for said upstream link comprise instructions for causing said router to perform admission control for said upstream link by reference to resource availability within said one or more resource pools.
38. The program product of Claim 37, wherein said one or more resource pools each indicate resource availability in an associated Differentiated Services service class and wherein said instructions for causing said router to perform admission control comprise instructions for determining resource availability in a resource pool associated with a service class specified by the request.
39. The program product of Claim 31, wherein said router comprises a downstream edge router, and said controller further comprises instructions for causing said downstream edge router to transmit said request from said downstream edge router to an upstream edge router.
40. A boundary router, comprising:

a data plane that routes data packets, said data plane having an input port connectable to a network core and an output port connectable to a downstream link ; and a control plane that, responsive to receipt of a request for resource reservation for a flow through the data plane from the input port onto the downstream link, transmits said request toward an upstream router via the network core without performing admission control for the downstream link.
41. The boundary router of Claim 40, wherein said boundary router comprises a Differentiated Services boundary router and wherein said request comprises a Resource Reservation Protocol request requesting resources for an Integrated Services flow.
42. The boundary router of Claim 40, wherein said boundary router comprises a data plane including a forwarding function and a plurality of queues that each provide a different quality of service, wherein said forwarding function switches packets of Integrated Services flows into multiple different ones of said plurality of queues for transmission on the downstream link.
43. A network system, comprising:
a network core;
a first boundary router coupled to said network core; and a second boundary router having an input port and an output port, wherein said input port is coupled to the Differentiated Services network core and said output port is connectable to a downstream link, wherein each of said first and second boundary routers has a data plane that routes data packets and a control plane, and wherein the control plane of the second boundary router, responsive to receipt of a request for resource reservation for a flow from the first boundary router to the second boundary router, transmits said request to said first boundary router without performing admission control for said downstream link.
44. The boundary router of Claim 43, wherein said boundary router comprises a data plane including a forwarding function and a plurality of queues that each provide a different quality of service, wherein said forwarding function switches packets of Integrated Services flows into multiple different ones of said plurality of queues for transmission on the downstream link.
45. The network system of Claim 43, wherein said first and second boundary routers comprise Differentiated Services boundary routers and said request comprises a Resource Reservation Protocol (RSVP) request requesting resources for an Integrated Services flow.
46. The network system of Claim 43, wherein said first boundary router has a control plane that, responsive to receipt of said request, transmits said request to an upstream router without performing admission control.
47. A method, comprising:
at a boundary router of a network, receiving a request for resource reservation for a flow through the boundary router onto a downstream link; and transmitting said request toward an upstream router without performing admission control for said downstream link.
48. The method of Claim 47, and further comprising said boundary router providing a plurality of different qualities of service to multiple Integrated Services flows destined for the downstream link.
49. The method of Claim 47, wherein said router comprises a Differentiated Services boundary router, and receiving said request comprises receiving a Resource Reservation Protocol (RSVP) request requesting resources for an Integrated Services flow.
50. The method of Claim 47, wherein said boundary router comprises a downstream boundary router and said upstream router comprises an upstream boundary router, said method further comprising:
receiving said request at the upstream boundary router; and in response to receipt of the request at the upstream boundary router, transmitting said request toward an upstream edge router without performing admission control at said upstream boundary router.
51. A program product for operating a router, said program product comprising:
a computer usable medium; and a control program, including:
instructions for causing said router to receive a request for resource reservation for a flow through the boundary router onto a downstream link of the router;
and instructions for causing said router to transmit said request toward an upstream router without performing admission control for said downstream link.
52. The program product of Claim 51, and further comprising instructions for causing said boundary router to provide a plurality of different qualities of service to multiple Integrated Services flows destined for the downstream link.
53. The program product of Claim 51, wherein said router comprises a Differentiated Services boundary router, and said instructions for causing said router to receive said request comprise instructions for causing said router to receive a Resource Reservation Protocol (RSVP) request requesting resources for an Integrated Services flow.
CA002441320A 2001-03-20 2002-03-20 Edge-based per-flow qos admission control in a data network Abandoned CA2441320A1 (en)

Applications Claiming Priority (11)

Application Number Priority Date Filing Date Title
US27695301P 2001-03-20 2001-03-20
US27692301P 2001-03-20 2001-03-20
US27695501P 2001-03-20 2001-03-20
US60/276,923 2001-03-20
US60/276,953 2001-03-20
US60/276,955 2001-03-20
US33121701P 2001-11-13 2001-11-13
US60/331,217 2001-11-13
US10/095,956 2002-03-12
US10/095,956 US7796608B2 (en) 2001-03-20 2002-03-12 Edge-based per-flow QoS admission control in a data network
PCT/US2002/008634 WO2002075577A1 (en) 2001-03-20 2002-03-20 EDGE-BASED PER-FLOW QoS ADMISSION CONTROL IN A DATA NETWORK

Publications (1)

Publication Number Publication Date
CA2441320A1 true CA2441320A1 (en) 2002-09-26

Family

ID=27536772

Family Applications (1)

Application Number Title Priority Date Filing Date
CA002441320A Abandoned CA2441320A1 (en) 2001-03-20 2002-03-20 Edge-based per-flow qos admission control in a data network

Country Status (8)

Country Link
US (2) US7796608B2 (en)
EP (1) EP1370970A4 (en)
JP (1) JP2004530340A (en)
CN (1) CN1701319A (en)
BR (1) BR0208267A (en)
CA (1) CA2441320A1 (en)
MX (1) MXPA03008475A (en)
WO (1) WO2002075577A1 (en)

Families Citing this family (46)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
AU2002310411A1 (en) * 2001-06-14 2003-01-02 Cariden Technologies Incorporated Methods and systems to generate and implement a changeover sequence to reconfigure a connection-oriented network
US7240124B2 (en) * 2001-06-20 2007-07-03 Silver Beech Networks, Inc. System and method for transferring data on a network using a single route optimizer to define an explicit route and transfer the information related to the explicit route to a plurality of routers and a plurality of optimized routers on the network
WO2003026229A2 (en) * 2001-09-20 2003-03-27 Siemens Aktiengesellschaft Traffic restriction by means of reliability check for a packet-oriented connectionless network with qos transmission
GB0130729D0 (en) * 2001-12-21 2002-02-06 Marconi Comm Ltd Communication network
US7428216B2 (en) * 2002-01-15 2008-09-23 Avaya Inc. Method and apparatus for policy and admission control in packet-based communication systems
EP1335535A1 (en) * 2002-01-31 2003-08-13 BRITISH TELECOMMUNICATIONS public limited company Network service selection
FR2835987B1 (en) * 2002-02-14 2005-04-29 Cit Alcatel ADMISSION CONTROL TO A DATA NETWORK FOR QUALITY OF SERVICE ASSURANCE
US7206324B2 (en) * 2002-05-03 2007-04-17 Telefonaktiebolaget Lm Ericsson (Publ) QoS translator
DE50313207D1 (en) * 2002-08-14 2010-12-02 Nokia Siemens Networks Gmbh ACCESS CONTROL FOR PACKET-ORIENTED NETWORKS
WO2004064310A2 (en) * 2003-01-11 2004-07-29 Omnivergent Communications Corporation Cognitive network
US7965717B2 (en) * 2003-01-17 2011-06-21 Nortel Networks Limited Multi-staged services policing
US8090805B1 (en) * 2004-02-17 2012-01-03 Cisco Technology, Inc. System and method for performing cascaded lookups to forward packets
US7411910B1 (en) * 2004-07-06 2008-08-12 Juniper Networks, Inc. Systems and methods for automatic provisioning of data flows
US20060006248A1 (en) 2004-07-06 2006-01-12 Chin-Chiang Wu Floating rotatable fountain decoration
IL167059A (en) * 2005-02-23 2010-11-30 Tejas Israel Ltd Network edge device and telecommunications network
US7715312B2 (en) * 2005-04-25 2010-05-11 Verizon Services Corp. Methods and systems for maintaining quality of service (QOS) levels for data transmissions
CN100474845C (en) * 2005-10-28 2009-04-01 上海交通大学 Method for admitting controlling integral service model
US8223642B2 (en) * 2006-04-28 2012-07-17 Tellabs San Jose, Inc. Differentiated services using weighted quality of service (QoS)
CN100571185C (en) * 2006-06-05 2009-12-16 华为技术有限公司 A kind of edge connection and channel selection method of striding networks in different management domains
CN100466621C (en) * 2006-06-27 2009-03-04 中国移动通信集团公司 Admission control system and admission control method in load supporting interface of communication network
US20080089324A1 (en) * 2006-10-13 2008-04-17 Cisco Technology, Inc Indicating or remarking of a dscp for rtp of a flow (call) to and from a server
US7738370B2 (en) * 2006-12-18 2010-06-15 Nokia Corporation Method, network element and modules therefore, and computer program for use in prioritizing a plurality of queuing entities
US8103773B2 (en) * 2007-01-19 2012-01-24 Cisco Technology, Inc. Transactional application processing in a distributed environment
US8374082B2 (en) * 2007-03-13 2013-02-12 Alcatel Lucent Advanced bandwidth management
US8320245B2 (en) * 2007-03-13 2012-11-27 Alcatel Lucent Policy enforcement points
US8446845B2 (en) * 2007-03-13 2013-05-21 Alcatel Lucent Advanced bandwidth management audit functions
CN101272317B (en) * 2007-03-19 2010-11-17 中国电信股份有限公司 System and method for implementing network and service amalgamation and unified control
KR20100112140A (en) * 2008-01-22 2010-10-18 톰슨 라이센싱 Method of aiding the reservation of resources for a packet switching network, and associated management device and aid device
US8503303B2 (en) * 2008-04-25 2013-08-06 Telefonaktiebolaget L M Ericsson (Publ) Congestion handling in multicast networks
US8000347B2 (en) * 2008-10-31 2011-08-16 Cisco Technology, Inc. Executing and supporting a multiple bandwidth reservation request
US8576857B2 (en) * 2010-01-22 2013-11-05 Cisco Technology, Inc. Automatically identifying an edge-facing router
US20120008573A1 (en) * 2010-07-08 2012-01-12 Apple Inc. Radio resource signaling during network congestion in a mobile wireless device
US8565076B2 (en) * 2010-09-24 2013-10-22 Movik Networks Destination learning and mobility detection in transit network device in LTE and UMTS radio access networks
US9397887B2 (en) * 2011-01-31 2016-07-19 Zte (Usa) Inc. System and method for cloud-based session border gateway implementation
KR101643829B1 (en) * 2011-09-30 2016-08-10 지티이 코포레이션 System and method for cloud-based implementation of control of focused overload of network element (cofo-ne)
KR101593350B1 (en) * 2011-10-27 2016-02-11 지티이 코포레이션 System and method for cloud-based implementation of control of focused overload of service element(cofo-se) via explicit (or virtualized) machine-to-machine (m2m) gateway element
WO2014186986A1 (en) * 2013-05-24 2014-11-27 华为技术有限公司 Stream forwarding method, device and system
CN104468406B (en) * 2013-09-13 2019-10-22 中兴通讯股份有限公司 Across host node method and device for business processing
EP3148140A1 (en) * 2015-09-28 2017-03-29 Alcatel Lucent Computing and network resource reservation
US10341185B2 (en) * 2015-10-02 2019-07-02 Arista Networks, Inc. Dynamic service insertion
US10778809B2 (en) * 2016-02-26 2020-09-15 Arista Networks, Inc. Per-input port, per-control plane network data traffic class control plane policing
US10334659B2 (en) * 2017-05-09 2019-06-25 Verizon Patent And Licensing Inc. System and method for group device access to wireless networks
US10771316B1 (en) * 2017-11-30 2020-09-08 Amazon Technologies, Inc. Debugging of a network device through emulation
US10200058B1 (en) 2018-04-24 2019-02-05 Sandisk Technologies Llc Analog-to-digital conversion with magnetic tunnel junctions
WO2020098908A1 (en) * 2018-11-12 2020-05-22 Telefonaktiebolaget Lm Ericsson (Publ) Technique for selecting a transport configuration for a data network
US20230123775A1 (en) * 2021-10-04 2023-04-20 Juniper Networks, Inc. Cloud native software-defined network architecture

Family Cites Families (79)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5130983A (en) * 1990-03-27 1992-07-14 Heffner Iii Horace W Method of polling to determine service needs and the like
JP3278865B2 (en) * 1991-06-28 2002-04-30 日本電気株式会社 Traffic control method
JP2693907B2 (en) 1993-12-27 1997-12-24 日本電気株式会社 Static routing method
JP2776301B2 (en) * 1994-08-30 1998-07-16 日本電気株式会社 Line reservation apparatus and method, line reservation receiving apparatus and method
US5659544A (en) 1994-10-17 1997-08-19 Lucent Technologies Inc. Method and system for distributed control in wireless cellular and personal communication systems
US5634012A (en) 1994-11-23 1997-05-27 Xerox Corporation System for controlling the distribution and use of digital works having a fee reporting mechanism
US5586121A (en) * 1995-04-21 1996-12-17 Hybrid Networks, Inc. Asymmetric hybrid access system and method
JP2891146B2 (en) 1995-10-23 1999-05-17 日本電気株式会社 Network server
JP3616682B2 (en) 1995-10-31 2005-02-02 富士通株式会社 ATM switch
US5684800A (en) * 1995-11-15 1997-11-04 Cabletron Systems, Inc. Method for establishing restricted broadcast groups in a switched network
US5867571A (en) 1996-02-23 1999-02-02 Lucent Technologies Inc. Method and arrangement for establishing call connections in a telecommunications network using a virtual transport server
US6385203B2 (en) * 1996-03-29 2002-05-07 Cisco Technology, Inc. Communication server apparatus and method
US6473404B1 (en) * 1998-11-24 2002-10-29 Connect One, Inc. Multi-protocol telecommunications routing optimization
US6151319A (en) 1996-11-15 2000-11-21 Lucent Technologies Inc. Connectionless message service using ATM routers
US6205148B1 (en) 1996-11-26 2001-03-20 Fujitsu Limited Apparatus and a method for selecting an access router's protocol of a plurality of the protocols for transferring a packet in a communication system
US6097722A (en) 1996-12-13 2000-08-01 Nortel Networks Corporation Bandwidth management processes and systems for asynchronous transfer mode networks using variable virtual paths
US5953338A (en) 1996-12-13 1999-09-14 Northern Telecom Limited Dynamic control processes and systems for asynchronous transfer mode networks
US6073160A (en) 1996-12-18 2000-06-06 Xerox Corporation Document communications controller
US5903559A (en) * 1996-12-20 1999-05-11 Nec Usa, Inc. Method for internet protocol switching over fast ATM cell transport
US5903735A (en) * 1996-12-24 1999-05-11 Intel Corporation Method and apparatus for transmitting data having minimal bandwidth requirements
US5883894A (en) 1996-12-30 1999-03-16 3Com Corporation Shared auto-negotiation logic for multiple port network devices
US5909430A (en) 1996-12-31 1999-06-01 Northern Telecom Limited Address assignment in an ATM switched network
US5960416A (en) 1997-02-27 1999-09-28 Block; Robert S. Real time subscriber billing at a subscriber location in an unstructured communication network
US6157648A (en) 1997-03-06 2000-12-05 Bell Atlantic Network Services, Inc. Network session management
US5991292A (en) 1997-03-06 1999-11-23 Nortel Networks Corporation Network access in multi-service environment
US5930348A (en) 1997-03-20 1999-07-27 Northern Telecom Limited Dynamically controlled routing of calls in intelligent networks
US6137777A (en) 1997-05-27 2000-10-24 Ukiah Software, Inc. Control tool for bandwidth management
SE519210C2 (en) * 1997-06-06 2003-01-28 Ericsson Telefon Ab L M Method of minimizing the connection delay for a mobile-directed message in cellular radio communication system
AU748468B2 (en) * 1997-09-16 2002-06-06 Transnexus, Inc. Internet telephony call routing engine
JP3649367B2 (en) * 1997-09-26 2005-05-18 ソニー株式会社 Packet transmission control method and apparatus
US6058113A (en) 1997-09-30 2000-05-02 Lucent Technologies, Inc. Method for enhancing resource reservation communication
US6216006B1 (en) * 1997-10-31 2001-04-10 Motorola, Inc. Method for an admission control function for a wireless data network
US6141686A (en) 1998-03-13 2000-10-31 Deterministic Networks, Inc. Client-side application-classifier gathering network-traffic statistics and application and user names using extensible-service provider plugin for policy-based network control
JP2002522962A (en) * 1998-08-04 2002-07-23 エイ・ティ・アンド・ティ・コーポレーション Network resource allocation method
US6584093B1 (en) * 1998-08-25 2003-06-24 Cisco Technology, Inc. Method and apparatus for automatic inter-domain routing of calls
US6108314A (en) * 1998-08-31 2000-08-22 Motorola, Inc. Method, subscriber device, wireless router, and communication system efficiently utilizing the receive/transmit switching time
US6539431B1 (en) * 1998-11-12 2003-03-25 Cisco Technology, Inc. Support IP pool-based configuration
US6487170B1 (en) * 1998-11-18 2002-11-26 Nortel Networks Limited Providing admission control and network quality of service with a distributed bandwidth broker
US6917617B2 (en) * 1998-12-16 2005-07-12 Cisco Technology, Inc. Use of precedence bits for quality of service
US6298383B1 (en) * 1999-01-04 2001-10-02 Cisco Technology, Inc. Integration of authentication authorization and accounting service and proxy service
US6643813B1 (en) * 1999-02-17 2003-11-04 Telefonaktiebolaget Lm Ericsson (Publ) Method and apparatus for reliable and efficient data communications
JP3743194B2 (en) * 1999-02-25 2006-02-08 株式会社日立製作所 Packet relay device
US6295532B1 (en) * 1999-03-02 2001-09-25 Nms Communications Corporation Apparatus and method for classifying information received by a communications system
US6581102B1 (en) * 1999-05-27 2003-06-17 International Business Machines Corporation System and method for integrating arbitrary isochronous processing algorithms in general media processing systems
EP1145519B1 (en) * 1999-06-10 2005-08-31 Alcatel Internetworking, Inc. System and method for policy-based network management of virtual private networks
US6678264B1 (en) * 1999-06-30 2004-01-13 Nortel Networks Limited Establishing connections with a pre-specified quality of service across a communication network
US6594277B1 (en) * 1999-07-22 2003-07-15 Avaya Technology Corp. Dynamic-rate, differential class-based quality of service agent for internet protocol exchange systems
US6801542B1 (en) * 1999-08-19 2004-10-05 Nokia Corporation Method and apparatus for providing an interworking unit between ATM networks and IP networks
US6728365B1 (en) * 1999-09-13 2004-04-27 Nortel Networks Limited Method and system for providing quality-of-service on packet-based wireless connections
US6708034B1 (en) * 1999-09-13 2004-03-16 Nortel Networks Ltd. End-to-end quality of service guarantee in a wireless environment
US6735630B1 (en) * 1999-10-06 2004-05-11 Sensoria Corporation Method for collecting data using compact internetworked wireless integrated network sensors (WINS)
US6578076B1 (en) * 1999-10-18 2003-06-10 Intel Corporation Policy-based network management system using dynamic policy generation
US6765927B1 (en) * 1999-10-20 2004-07-20 Alcatel RSVP proxy service for communication network
US6366577B1 (en) 1999-11-05 2002-04-02 Mci Worldcom, Inc. Method for providing IP telephony with QoS using end-to-end RSVP signaling
US6714987B1 (en) * 1999-11-05 2004-03-30 Nortel Networks Limited Architecture for an IP centric distributed network
US7478161B2 (en) * 1999-11-30 2009-01-13 Microsoft Corporation Network quality of service for qualitative applications
US6829221B1 (en) * 1999-12-27 2004-12-07 Nortel Networks Limited Border gateway protocol manager and method of managing the selection of communication links
US20010027490A1 (en) * 2000-01-25 2001-10-04 Gabor Fodor RSVP handling in 3G networks
US6910024B2 (en) * 2000-02-04 2005-06-21 Hrl Laboratories, Llc System for pricing-based quality of service (PQoS) control in networks
US6826613B1 (en) * 2000-03-15 2004-11-30 3Com Corporation Virtually addressing storage devices through a switch
WO2001071522A1 (en) * 2000-03-20 2001-09-27 Motient Communications Inc. Integrated real time and polled electronic messaging system and method
US6961318B2 (en) 2000-05-12 2005-11-01 International Business Machines Corporation Data transmission system for reserving a virtual connection over multiple IP networks by means of a reservation
US6714515B1 (en) 2000-05-16 2004-03-30 Telefonaktiebolaget Lm Ericsson (Publ) Policy server and architecture providing radio network resource allocation rules
US6823385B2 (en) * 2000-05-19 2004-11-23 Scientifc Atlanta, Inc. Allocating access across a shared communications medium to user classes
US6745207B2 (en) * 2000-06-02 2004-06-01 Hewlett-Packard Development Company, L.P. System and method for managing virtual storage
US7307954B1 (en) * 2000-06-23 2007-12-11 Nokia Corporation Differentiated service network and method of operating a differentiated service network
US7958251B2 (en) * 2000-08-04 2011-06-07 Goldman Sachs & Co. Method and system for processing raw financial data streams to produce and distribute structured and validated product offering data to subscribing clients
US6775701B1 (en) * 2000-08-15 2004-08-10 Nortel Networks Limited Oversubscribing network resources
US6970939B2 (en) * 2000-10-26 2005-11-29 Intel Corporation Method and apparatus for large payload distribution in a network
US6854014B1 (en) * 2000-11-07 2005-02-08 Nortel Networks Limited System and method for accounting management in an IP centric distributed network
US7046680B1 (en) * 2000-11-28 2006-05-16 Mci, Inc. Network access system including a programmable access device having distributed service control
US7146425B2 (en) * 2000-12-22 2006-12-05 Matsushita Electric Industrial Co., Ltd. Measurement-based admission control utilizing effective envelopes and service curves
US6914883B2 (en) * 2000-12-28 2005-07-05 Alcatel QoS monitoring system and method for a high-speed DiffServ-capable network element
US6973035B2 (en) * 2000-12-29 2005-12-06 Nortel Networks Limited Method and system for a routing mechanism to support two-way RSVP reservations
US7212495B2 (en) * 2001-02-21 2007-05-01 Polytechnic University Signaling for reserving a communications path
US7069337B2 (en) * 2001-03-20 2006-06-27 Mci, Inc. Policy-based synchronization of per-class resources between routers in a data network
US6801940B1 (en) * 2002-01-10 2004-10-05 Networks Associates Technology, Inc. Application performance monitoring expert
US7103729B2 (en) * 2002-12-26 2006-09-05 Intel Corporation Method and apparatus of memory management
US7046648B2 (en) * 2003-11-05 2006-05-16 Interdigital Technology Corporation Wireless communication method and apparatus for coordinating Node-B's and supporting enhanced uplink transmissions during handover

Also Published As

Publication number Publication date
CN1701319A (en) 2005-11-23
EP1370970A1 (en) 2003-12-17
BR0208267A (en) 2004-03-09
JP2004530340A (en) 2004-09-30
US7796608B2 (en) 2010-09-14
MXPA03008475A (en) 2004-06-30
EP1370970A4 (en) 2004-08-04
US20020194362A1 (en) 2002-12-19
US8811423B2 (en) 2014-08-19
US20100302943A1 (en) 2010-12-02
WO2002075577A1 (en) 2002-09-26

Similar Documents

Publication Publication Date Title
US7069337B2 (en) Policy-based synchronization of per-class resources between routers in a data network
US7209439B2 (en) Pool-based resource management in a data network
US7796608B2 (en) Edge-based per-flow QoS admission control in a data network
US7734796B2 (en) Method and arrangement for reserving resources to obtain a predetermined quality of service in an IP network
EP1312226B1 (en) DYNAMIC QoS MANAGEMENT IN DIFFERENTIATED SERVICES USING BANDWIDTH BROKERS, RSVP AGGREGATION AND LOAD CONTROL PROTOCOLS
US6714515B1 (en) Policy server and architecture providing radio network resource allocation rules
US20040081092A1 (en) Admission control method in Internet differentiated service network
WO2004093480A1 (en) Communication system and communication method
KR101471217B1 (en) System for reserving a pass band for different classes of traffic
Terzis et al. A prototype implementation of the two-tier architecture for differentiated services
KR100585229B1 (en) Method for providing quality of service guarantee, and home network system using the same
Jia et al. A new architecture of providing end-to-end quality-of-service for differentiated services network
AU2002244323A1 (en) Edge-based per-flow QoS admission control in a data network
AU2002248664A1 (en) Policy-based synchronization of per-class resources between routers in a data network
AU2002244313A1 (en) Pool-based resource management in a data network
KR100563663B1 (en) POLICY DECISION METHOD OF BANDWIDTHBROKER FOR INTERNET QoS
Xu ADMISSION CONTROL AND BANDWIDTH ALLOCATION FOR CLASSA TRAFFIC IN RPR NETWORKS
Crossing et al. D1. 1: Functional Architecture Definition and Top Level Design
Terzis et al. A Two-Tier Resource Management Model for Differentiated Services Networks

Legal Events

Date Code Title Description
FZDE Discontinued