|Publication number||US7826364 B1|
|Application number||US 11/350,029|
|Publication date||Nov 2, 2010|
|Filing date||Feb 9, 2006|
|Priority date||Feb 9, 2006|
|Also published as||US8750117, US20100325271|
|Publication number||11350029, 350029, US 7826364 B1, US 7826364B1, US-B1-7826364, US7826364 B1, US7826364B1|
|Inventors||Roman Maria Krzanowski, William Arthur Bjorkman, Haidar Ahmed Chamas, Vincent Anthony Alesi|
|Original Assignee||Verizon Services Corp.|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (7), Referenced by (1), Classifications (18), Legal Events (3)|
|External Links: USPTO, USPTO Assignment, Espacenet|
The Open Systems Interconnection Model (OSI Model or just OSI) is a layered abstract description for communications and computer network protocol design. It is a hierarchical structure generally comprised of seven layers that defines the requirements for communications between two computers. The model was defined by the International Standards Organization and was conceived to allow interoperability across the various platforms offered by vendors. Each layer of the OSI Model has the property that it only uses the functions of the layer below, and only exports functionality to the layer above. The layers generally include a physical layer (Layer 1), a data link layer (Layer 2), a network layer (Layer 3), a transport layer (Layer 4), a session layer (Layer 5), a presentation layer (Layer 6), and an application layer (Layer 7).
The physical layer, or Layer 1, defines all electrical and physical specifications for devices. This includes the layout of pins, voltages, and cable specifications. Hubs and repeaters are physical-layer devices. Layer 1 networks, for example Next Generation Synchronous Optical Networks (NG-SONET), as are known in the art, are increasingly being used for transport of packet switched services. It is often desirable to use a lower speed (partial rate) transport link when connecting to a Packet Switched Network (PSN) to provide the required bandwidth at the least possible cost. An example of partial rate mapping is when Gigabit Ethernet interfaces are used on a NG SONET system (Ethernet over SONET) with an STS-3 provisioned across the SONET network, thus creating a speed mismatch condition (i.e., 1000 Mbps packet interface is mapped to 150 Mbps transport channel).
NG Add-Drop Multiplexers (ADMs), providing layer 1 transport are not typically Class of Service (CoS) aware—they also typically have limited queue sizes. While large queue sizes could help guarantee frame delivery performance, they introduce excessive delay and delay variation for premium (e.g., real-time) service classes. In addition, Layer 2 switch ports providing the connection from the PSN to the layer 1 transport network generally cannot perform the full set of traffic management functionality required (e.g., egress shaping, egress policing) to support the performance guarantees required for the enhanced service classes. As a result, when traffic from one or many PSN customers converges on one interface, it is highly probable that the layer 1 client interface will start dropping traffic indiscriminately, i.e., without regard to the priority or importance of the traffic being dropped. In such a condition, premium traffic (e.g., real-time) with strict Service Level Agreement (SLA) objectives will be dropped with the same probability as the low priority (best effort) traffic, a service class without any performance guarantees.
A common solution to this challenge is to substantially overprovision bandwidth across the Layer 1 transport system, (e.g. by mapping the packet interface bandwidth to a full-rate STS-n mapping). In the case of 1000 Mbps Gigabit Ethernet service, this equates to an STS-21 mapping at best. Needless to say, this is an expensive and inefficient solution for a customer desiring an aggregate committed information rate of only 150 Mbps.
The preferred embodiments implemented according to the present invention now will be described more fully with reference to the accompanying drawings, in which some, but not all possible embodiments of the invention are shown. Indeed, this invention may be embodied in many different forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will satisfy applicable legal requirements. Like numbers refer to like elements throughout.
As will be appreciated by one skilled in the art, the preferred embodiments may be implemented as a method, a data processing system, or a computer program product. Accordingly, preferred embodiments of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, implementations of the preferred embodiments may take the form of a computer program product on a computer-readable storage medium having computer-readable program instructions (e.g., computer software) embodied in the storage medium. More particularly, implementations of the preferred embodiments may take the form of web-implemented computer software. Any suitable computer-readable storage medium may be utilized including hard disks, CD-ROMs, optical storage devices, or magnetic storage devices.
The preferred embodiments according to the present invention are described below with reference to block diagrams and flowchart illustrations of methods, apparatuses (i.e., systems) and computer program products according to an embodiment of the invention. It will be understood that each block of the block diagrams and flowchart illustrations, and combinations of blocks in the block diagrams and flowchart illustrations, respectively, can be implemented by computer program instructions. These computer program instructions may be loaded onto a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions which execute on the computer or other programmable data processing apparatus create a means for implementing the functions specified in the flowchart block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including computer-readable instructions for implementing the function specified in the flowchart block or blocks. The computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process such that the instructions that execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart block or blocks.
Accordingly, blocks of the block diagrams and flowchart illustrations support combinations of means for performing the specified functions, combinations of steps for performing the specified functions and program instruction means for performing the specified functions. It will also be understood that each block of the block diagrams and flowchart illustrations, and combinations of blocks in the block diagrams and flowchart illustrations, can be implemented by special purpose hardware-based computer systems that perform the specified functions or steps, or combinations of special purpose hardware and computer instructions.
The preferred embodiments according to the present invention provide systems, methods and procedures for controlling the flow of traffic (data) into an aggregated trunk port. This control is performed on a at least one of a per-CoS and a per-communication path (e.g., Virtual Connection (VC)) basis. This applies to any packet switched network (PSN), such as, for example, Ethernet, Frame Relay (FR), asynchronous transfer mode (ATM) and multi-protocol label switching (MPLS), among others. In addition, it applies in Layer 1 networks utilizing Layer 2 switching, such as, for example, resilient packet ring (RPR)/IEEE 802.17 and Ethernet over SONET.
The proposed mechanism of a preferred embodiment is generally comprised of a centrally located Access Control System (ACS) with a data structure representing a set of control messages exchanged between network elements. An Access Control Algorithm (ACA) operates on the above data structures and determines and initiates the appropriate action. A communication system provides a control channel that enables flow control messages to be exchanged between the ACS and the packet switched network elements (e.g., UNI-N, Trunk Port, etc.).
For example, prior art
Computer or Computing Device
In the preferred embodiments referenced herein, a “computer” or “computing device” may referenced. Such computer may be, for example, a mainframe, desktop, notebook or laptop, a hand held device such as a data acquisition and storage device, or it may be a processing device embodied within another apparatus such as, for example, a set top box for a television system or a wireless telephone. In some instances the computer may be a “dumb” terminal used to access data or processors over a network. Turning to
The processor 1 also communicates with various peripherals or external devices using an I/O bus 6. In the present embodiment, a peripheral I/O controller 7 is used to provide standard interfaces, such as RS-232, RS422, DIN, USB, or other interfaces as appropriate to interface various input/output devices. Typical input/output devices include local printers 18, a monitor 8, a keyboard 9, and a mouse 10 or other typical pointing devices (e.g., rollerball, trackpad, joystick, etc.).
The processor 1 typically also communicates using a communications I/O controller 11 with external communication networks, and may use a variety of interfaces such as data communication oriented protocols 12 such as X.25, ISDN, DSL, cable modems, etc. The communications controller 11 may also incorporate a modem (not shown) for interfacing and communicating with a standard telephone line 13. Finally, the communications I/O controller may incorporate an Ethernet interface 14 for communicating over a LAN. Any of these interfaces may be used to access a wide area network such as the Internet, intranets, LANs, or other data communication facilities.
Finally, the processor 1 may communicate with a wireless interface 16 that is operatively connected to an antenna 15 for communicating wirelessly with another device, using for example, one of the IEEE 802.11 protocols, 802.15.4 protocol, or a standard 3G wireless telecommunications protocols, such as CDMA2000 1xEV-DO, GPRS, W-CDMA, or other protocol.
An alternative embodiment of a processing system that may be used is shown in
Those skilled in the art of data networking will realize that many other alternatives and architectures are possible and can be used to practice the preferred embodiments. The embodiments illustrated in
A preferred embodiment of logical architecture for implementing this mechanism is shown in
The ACS 302 is a software agent that may be located outside of the PSN 300. The ACS 302 is connected to the elements of the PSN 300 over the dedicated management network using standard network management interfaces 308. The aggregation packet switch 304 is a packet switch with a trunk port 312 requiring congestion management and one or more network ports 322. The CE 306 is customer equipment connecting to the packet switched network 300. The CE 306 is network dependent. It can be, for example, a router or a switch. The management interface 308 provides an interface between the ACS 302 and network elements used for carrying congestion control messages. The PSN 300 is a Layer 2 or Layer 3 network supporting packet switched services. The protected link 310 is an oversubscribed link requiring congestion management. The trunk port (TP) 312 is a port that aggregates traffic in the PSN 300. The trunk port 312 is connected to the protected link 310. Each CP 320 connects with the aggregation packet switch 304 through a network port 322 such that the CPs 320 are logically aggregated at the trunk port 312.
Each UNI 314 is a demarcation point between the responsibility of the service provider and the customer, each UNI-C 316 is a port on the customer equipment connecting directly to the UNI 314, and each UNI-N 318 is the functionality on the packet switched network element that provides the physical interface to the UNI 314 and service processing for the customer. The UNI-N 318 has data and management plane functionality that supports congestion management via the dynamic configuration of CoS policies per CP 320. Each communication path (CP) 320 transports customer traffic and in one embodiment may be a logical connection that is a virtual connection, though other communication paths are contemplated within the scope of this invention.
Referring again to
After this policing message is sent, the ACA requests the status updates from all UNI-N 318 and the trunk port 312. If the congestion condition is still detected, the ACA repeats the steps resulting in the policing of traffic through the UNI-N 318. Once the congestion condition on the trunk port 312 is no longer detected, and after waiting a specific amount of time (that is implementation dependent), the ACA starts reversing the policing process by reinstating the original CoS policies on UNI-Ns 318 that have been changed from their original status. The process of the reinstating CoS policies is implementation dependent.
Logical System Architecture
Messages and Data Structures
A UNIVC Interface Status Message (UNIVC-I) 412 is a message to the ACS 406 from a given UNI-N 402. This message 412 transmits the bandwidth per CoS on the CP 404. The frequency with which UNIVC-I 412 is pushed/pulled depends on the UNI-N bandwidth. The message format and transport encapsulation on the UNIVC-I message 412 are implementation dependent. Information provided in the UNIVC-I message 412 may include, for example, a UNI identifier, CP utilization (bytes transmitted) per class of service, and a time stamp. The transmission frequency of the UNIVC-I messages 412 may range from tens of milliseconds to seconds.
An ACS Control Message (ACS-D) 414 is a message from the ACS 406 to the UNI-N 402. This message 414 is a request to the UNI-N 402 to limit the bandwidth allowed on a specific CoS on a given CP 404 by changing certain traffic policing parameters. The choice of the specific traffic policing parameter(s) to change is implementation dependent. Traffic policing parameters that may be adjusted include, for example, committed information rate (CIR), committed burst size (CBS), excess information rate (EIR) and excess burst size (EBS).
An ACS decision table (ACS-T) 416 is at least partially stored in memory associated with the ACS 406. The ACS-T 406 contains the current status of each UNI-N 402 based on the UNIVC-I messages 412. The ACS-T 416 is updated every time the ACS 406 receives a UNIVC-I message 412. The current status of each UNI-N 402 includes the current bandwidth on this interface in each CoS for each CP 404.
A Forced Trunk Port Status (FTP-S) message 418 is sent from the ACS 406 to the trunk port 420 to get the current status of the interface. In response to the FTP-S message 418, the trunk port 420 will send a TP-C message. 410 The message format and transport encapsulation are implementation dependent. Information provided in the FTP-S message 418 includes, for example, a trunk port identifier and a TP-C request code.
A Forced VC Interface Status (FUNIVC-I) message 420 is sent from the ACS 406 to the UNI-N 402 to get the current status of the interface. In response to the message, the UNI-N 402 will send a UNIVC-I message 412 to the ACS 406. The message format and transport encapsulation are implementation dependent. Information provided in the FUNIVC-I message 420 includes, for example, a UNI identifier, a CP identifier and a UNIVC-I request code.
Access Control Algorithm (ACA)
As described herein, the ACS is controlled at least in part by an access control algorithm (ACA) executing on the ACS 406 (e.g., stored in the memory of the ACS 406 and executed by the processing facilities of the ACS 206). The ACA is provided with the initial configuration of the trunk port 420 and each of the UNI-Ns 402. The properties of these interfaces (buffers, policies) are also provided. Through the provisioning process, the ACA becomes aware of what UNI-Ns 402 are associated with a given trunk port.
The ACA maintains the current status (total bandwidth, per CoS bandwidth, etc.) of each UNI-N 402 interface via UNIVC-I messages 412 pushed/pulled from a given UNI-N 402, for example, at a specified time interval. The status of the trunk interface is also maintained through TP-C messages 410 pushed/pulled from the trunk port, for example, at a given time interval. The current status of all UNI-Ns 402 and trunk ports 420 is maintained in the ACS-T table 416. If the ACA detects the congestion condition on a trunk port 420, then the process illustrated in the flowchart of
If the trunk port is congested, then at Step 504, the ACA selects one or more CPs' UNI-N with the largest amount of traffic. In one embodiment the ACA may consider traffic in the lowest CoS class and take into account the level of importance of the CP (e.g., two CPs in the same CoS could have different levels of importance) assigned during the provisioning process when determining the traffic to limit. At Step 506, the ACA sends a message to the interfaces of the selected one or more CPs to police them in the specific CoS class to a specified amount of traffic on a specific CP. The decision may be taken to police one or more than one UNI-Ns. At Step 508, the ACA sends the request (e.g., using a FUNIVC-I message) to the policed UNI-Ns, and the request TP-C message to the trunk port requiring protection from congestion.
After receiving the reply messages from these interfaces, the process continues to Step 510 where the ACA updates the status of ACS-T to reflect any changes made to the UNIs controlling the CPs. The process then goes to Step 512 where it reevaluates the congestion at the trunk port. If, at Step 512, the trunk port is still congested, then the process returns to Step 502 and Steps 504, 506, 508 and 510 are repeated. If, at Step 512, no congestion is detected, then the ACA checks if there were any changes to UNI-Ns by referencing the ACS-T at Step 514. If any changes are found, the ACA starts the sequence of reversing changes by going to Step 516 to set the UNI-N back to it original configuration through Steps 516 and 518, as described below. Changes may be incrementally reversed so that the trunk port will not become congested once again.
Returning to Step 502, if at Step 502 no congestion is found, then the process goes to Step 514. At Step 514 it is determined whether any recent changes have occurred to the CPs by referencing the ACS-T. If there have been changes, then the process, as described above, goes to Step 516 where the recent CP changes are reversed or incrementally relaxed. At Step 518, the status of the CPs is determined. The process then returns to Step 514 where it is again determined if the UNI-Ns were changed in the ACS-T. If any changes are found, the ACA repeats the sequence of reversing changes by going to Step 516 to set the UNI-N back to it original configuration through Steps 516 and 518. If no changes to the UNI-Ns are found, then the process goes to Step 520, where it ends. This process may execute on a continual loop on the ACS to monitor the status of the trunk port and relieve congestion conditions.
To more fully characterize this exemplary application, assume that each EVC 612 is provisioned at the PSN 604 with the following Classes of Service (CoS): Real-time: committed information rate (CIR)=10 Mbps; Priority Data: CIR=20 Mbps, excess information rate (EIR)=20 Mbps; and Best effort: EIR=100 Mbps
As can be seen from the above, the aggregate CIR is equal to 150 Mbps (5 branch sites sending 30 Mbps each), but the total aggregate bandwidth at any given point in time could approach 500 Mbps (5 branch UNIs connected at 100 Mbps each). In this example, the Gigabit Ethernet interface on the ADM connecting the NG SONET network 606 to the PSN 604 has a single ingress queue 614 of limited size and is not CoS aware.
When traffic from the five branch sites converge on the trunk port 616, it is highly probable that at many times during the day, the Ethernet port on the ADM will drop traffic indiscriminately, (i.e. without regard to Class of Service). In such a scenario, premium traffic with the strict SLAs will be dropped with the same probability as the low priority traffic. SLA objectives would be impossible to meet. The only viable solution today is to substantially overprovision the Layer 1 network 606. In this example, an STS-12 (600 Mbps) would likely be required. Needless to say, this solution is expensive. From
To further elaborate the example, at a given point in time assume that branch UNIs 610 are well behaved, sending an aggregate flow of 120 Mbps to the UNI-HQ 602, including real-time and priority traffic. Also assume that one branch UNI (UNI 610-4) is not so well-behaved, sending 100 Mbps of best-effort traffic to UNI-HQ 602. The total of 220 Mbps of aggregate flow to the ADM would clearly result in many lost packets, given the provisioning of a 150 Mbps channel 606 in the Layer 1 network 606. In this example, a solution would allow the service to be provisioned using an STS-3 transport channel in the Layer 1 network. As described herein, the Access Control System (ACS) 618 provides a solution. The ACS 618 receives traffic utilization from the trunk port 616, it evaluates and makes a decision using the ACA described earlier. When the predefined utilization level is exceeded, the ACS 618 sends a message to re-configure the policer at branch UNI 610-4 to EIR=30 Mbps. The ACS 618 then learns when the congestion situation is alleviated, and then re-configures the policer at branch UNI 610-4 to allow the full EIR=100 Mbps.
In this manner, ACS 618 provides for guaranteed performance for the enhanced Classes of Service, while minimizing the capacity requirements in the Layer 1 network 606, resulting in decreased cost to the customer.
Many modifications and other embodiments of the invention will come to mind to one skilled in the art to which this invention pertains having the benefit of the teachings presented in the foregoing descriptions. For instance, traffic variables other than class of service may be used to determine traffic to be limited or the ACS may provide a notice to customers that traffic will be limited for their class of service and allow them the opportunity to voluntarily decrease traffic. Accordingly, it should be understood that the invention is not to be limited to the specific embodiments disclosed and that modifications and other embodiments are intended to be included within the scope of the appended exemplary inventive concepts. Although specific terms are employed herein, they are used in a generic and descriptive sense only and not for purposes of limitation.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US5313454 *||Apr 1, 1992||May 17, 1994||Stratacom, Inc.||Congestion control for cell networks|
|US6345038 *||May 12, 1998||Feb 5, 2002||International Business Machines Corporation||Improving access to congested networks|
|US7058015 *||Aug 4, 2000||Jun 6, 2006||Arbor Networks, Inc.||Distributed solution for regulating network traffic|
|US20050216584 *||Mar 24, 2004||Sep 29, 2005||Nortel Networks Limited||Method and apparatus for collecting management information on a communication network|
|US20050220022 *||Jun 1, 2004||Oct 6, 2005||Delregno Nick||Method and apparatus for processing labeled flows in a communications access network|
|US20060159016 *||Jan 14, 2005||Jul 20, 2006||Telefonaktiebolaget L M Ericsson (Publ)||Uplink congestion detection and control between nodes in a radio access network|
|US20070195694 *||Mar 16, 2005||Aug 23, 2007||Roland Schutz||System for dynamic control of an ip network|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|CN103532759A *||Oct 17, 2013||Jan 22, 2014||重庆邮电大学||Cloud service-oriented admission control method for converged flows|
|U.S. Classification||370/235, 709/230, 370/236, 709/232, 370/229|
|Cooperative Classification||H04L47/2425, H04L47/11, H04L47/20, H04L12/5602, H04L47/2408, H04L47/10|
|European Classification||H04L12/56A1, H04L47/24C, H04L47/11, H04L47/20, H04L47/24A, H04L47/10|
|Feb 9, 2006||AS||Assignment|
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:KRZANOWSKI, ROMAN MARIA;BJORKMAN, WILLIAM ARTHUR;CHAMAS,HAIDAR AHMED;AND OTHERS;SIGNING DATES FROM 20060202 TO 20060203;REEL/FRAME:017553/0204
Owner name: VERIZON SERVICES CORP., VIRGINIA
|Apr 2, 2014||FPAY||Fee payment|
Year of fee payment: 4
|Jul 28, 2014||AS||Assignment|
Effective date: 20140409
Owner name: VERIZON PATENT AND LICENSING INC., NEW JERSEY
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:VERIZON SERVICES CORP.;REEL/FRAME:033428/0605