Link policy routing based on link utilization
원문보기
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
H04L-012/24
H04L-012/26
H04L-012/56
H04L-012/803
H04L-012/721
G01V-001/28
H04L-029/06
H04L-012/701
H04L-012/715
H04L-012/751
H04L-012/729
출원번호
US-0440712
(2012-04-05)
등록번호
US-9722928
(2017-08-01)
발명자
/ 주소
Patel, Rahul G.
Blair, Dana
출원인 / 주소
Cisco Technology, Inc.
대리인 / 주소
Polsinelli PC
인용정보
피인용 횟수 :
0인용 특허 :
99
초록▼
In one embodiment, a link utilization threshold is assigned to a first link. Link utilization of the first link and of one or more second links is monitored. The first link is considered to be out-of-policy (OOP) in the event that the link utilization of the first link surpasses the link utilization
In one embodiment, a link utilization threshold is assigned to a first link. Link utilization of the first link and of one or more second links is monitored. The first link is considered to be out-of-policy (OOP) in the event that the link utilization of the first link surpasses the link utilization threshold. In response to the first link being considered OOP, action is taken. An excess utilization of the first link is determined. One or more prefixes currently routed over the first link whose collective per prefix utilization exceeds the excess utilization are determined. Provided that the collective per prefix utilization of the one or more prefixes currently routed over the first link, if added to the link utilization of the one or more second links, would not cause the one or more second links to be considered OOP, the one or more prefixes are redirected over them.
대표청구항▼
1. A method comprising: calculating, by a processor, a first link utilization of a first link and a second link utilization of one or more second links, wherein the first link utilization is calculated based on first traffic associated with a plurality of first prefixes routed through the first link
1. A method comprising: calculating, by a processor, a first link utilization of a first link and a second link utilization of one or more second links, wherein the first link utilization is calculated based on first traffic associated with a plurality of first prefixes routed through the first link, and wherein the second link utilization is calculated based on second traffic associated with one or more second prefixes routed through the one or more second links;determining that the second link utilization is lower than a second link utilization threshold associated with the one or more second links;determining that the first link is out-of-policy (OOP) with respect to a first link policy when the first link utilization surpasses a first link utilization threshold of the first link;determining an overall excess utilization of the first link, the overall excess utilization corresponding to a difference between the first link utilization and the first link utilization threshold;receiving a configurable utilization amount such that the first link is in-policy with respect to the first link policy when the first link utilization is lower than the first link utilization threshold and the configurable utilization amount;identifying a subset of prefixes, from the plurality of first prefixes routed through the first link, having a total utilization that is: greater than the overall excess utilization of the first link and the configurable utilization amount; andlower than the second link utilization threshold associated with the one or more second links; andredirecting the subset of prefixes through the one or more second links. 2. The method of claim 1, further comprising: determining that the subset of prefixes is reachable by the one or more second links. 3. The method of claim 1, wherein each of the subset of prefixes are redirected over a particular link of the one or more second links, and wherein each of the plurality of first prefixes is obtained by applying a respective subnet mask to a respective network address. 4. The method of claim 1, wherein the first link utilization threshold is a percentage of total capacity. 5. The method of claim 1, wherein the first link utilization threshold of the first link differs from the second link utilization threshold of the one or more second links. 6. The method of claim 1, wherein the first link utilization threshold is a relative threshold with respect to one or more other links. 7. The method of claim 1, wherein the first link and the one or more second links are load balanced links, and the subset of prefixes are redirected through the one or more second links to load balance the first traffic routed through the first link and the second traffic routed through the one or more second links. 8. The method of claim 1, wherein at least one of the first link or the second link comprises a virtual link. 9. The method of claim 1, further comprising: determining that the first link is OOP with respect to a second link policy when the first link utilization exceeds a maximum difference between the first link utilization threshold and the second link utilization threshold. 10. An apparatus comprising: a processor; anda computer-readable storage medium having stored therein instructions which, when executed by the processor, cause the processor to perform operations comprising: calculating a first link utilization of a first link and a second link utilization of one or more second links, wherein the first link utilization is calculated based on first traffic associated with a plurality of first prefixes routed through the first link, and wherein the second link utilization is calculated based on second traffic associated with one or more second prefixes routed through the one or more second links;determining that the second link utilization is lower than a second link utilization threshold associated with the one or more second links;determining that the first link is out-of-policy (OOP) with respect to a first link policy when the first link utilization of the first link surpasses a first link utilization threshold;determining an overall excess utilization of the first link, the overall excess utilization corresponding to a difference between the first link utilization and the first link utilization threshold;receiving a configurable utilization amount such that the first link is in-policy with respect to the first link policy when the first link utilization is lower than the first link utilization threshold and the configurable utilization amount;identifying a subset of prefixes, from the plurality of first prefixes routed through the first link, having a total utilization that is: greater than the overall excess utilization of the first link and the configurable utilization amount; andlower than the second link utilization threshold associated with the one or more second links; andredirecting the subset of prefixes over the one or more second links. 11. The apparatus of claim 10, wherein each of the subset of prefixes is obtained by applying a respective subnet mask to a respective network address. 12. The apparatus of claim 11, wherein the computer-readable storage medium stores additional instructions which, when executed by the processor, cause the processor to perform operations comprising: determining that the subset of prefixes is reachable by the one or more second links. 13. The apparatus of claim 11, wherein each of the subset of prefixes is routed over only one link of the one or more second links. 14. The apparatus of claim 10, wherein the first link utilization threshold is a percentage of total capacity. 15. The apparatus of claim 10, wherein the first link utilization threshold of the first link differs from the second link utilization threshold of the one or more second links. 16. The apparatus of claim 10, wherein the first link utilization threshold is a relative threshold with respect to one or more other links. 17. The apparatus of claim 10, wherein the first link and the one or more second links are load balanced links, and wherein the first link utilization threshold and the second link utilization threshold are relative to each other based on a load balancing scheme. 18. The apparatus of claim 10, wherein the first link is a virtual link. 19. A non-transitory computer readable storage medium having stored therein instructions which, when executed by a processor, cause the processor to perform operations comprising: determining a first link utilization of a first link and a second link utilization of one or more second links, wherein the first link utilization is calculated based on first traffic associated with a plurality of first prefixes routed through the first link, and wherein the second link utilization is calculated based on second traffic associated with one or more second prefixes routed through the one or more second links;determining that the second link utilization is lower than a second link utilization threshold associated with the one or more second links;determining that the first link is out-of-policy (OOP) with respect to a first link policy when the first link utilization surpasses a first link utilization threshold of the first link;determining an overall excess utilization of the first link, the overall excess utilization corresponding to a difference between the first link utilization and the first link utilization threshold;receiving a configurable utilization amount such that the first link is in-policy with respect to the first link policy when the first link utilization is lower than the first link utilization threshold and the configurable utilization amount;identifying a subset of prefixes, from the plurality of first prefixes routed through the first link, having a total utilization that is: greater than the overall excess utilization of the first link and the configurable utilization amount; andlower than the second link utilization threshold associated with the one or more second links; andredirecting the subset of prefixes over to the one or more second links.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (99)
Blair, Dana; Metzger, Larry R., Active probe path management.
Thubert, Pascal; Molteni, Marco; Wetterwald, Patrick; Levy-Abegnoli, Eric M., Arrangement in a router for generating a route based on a pattern of a received packet.
Kelly, Timothy Gene; Taft, Nina Anne; Edwards, William Lee; Ogier, Richard G.; Bellur, Bhargav, Communications network system and method for routing based on disjoint pairs of paths.
Zavalkovsky, Arthur; Zlotkin, Gilad, Method and apparatus for adapting enforcement of network quality of service policies based on feedback about network conditions.
Warkhede, Priyank Ramesh; Eatherton, William N.; Maniyar, Shyamsundar N.; Marimuthu, Peram, Method and apparatus for allocating and using range identifiers as input values to content-addressable memories.
Colby, Steven; Krawczyk, John J.; Nair, Raj Krishnan; Royce, Katherine; Siegel, Kenneth P.; Stevens, Richard C.; Wasson, Scott, Method and apparatus for directing a flow of packets based on request and server attributes.
Agarwal, Puneet; Menezes, Vivek; Basturk, Erol, Method and apparatus for distributing and providing fault tolerance to path-vector routing protocols within a multi-processor router.
McCloghrie Keith ; Gai Silvano,ITX ; Mohaban Shai, Method and apparatus for identifying network data traffic flows and for applying quality of service treatments to the flows.
Kloth, Raymond J.; Edsall, Thomas J.; Fine, Michael; Dutt, Dinesh G., Method and apparatus for implementing a quality of service policy in a data communications network.
Kloth, Raymond J.; Edsall, Thomas J.; Fine, Michael; Dutt, Dinesh G., Method and apparatus for implementing a quality of service policy in a data communications network.
Kloth, Raymond J.; Edsall, Thomas J.; Fine, Michael; Dutt, Dinesh G., Method and apparatus for implementing a quality of service policy in a data communications network.
Oren, Eyal; Belz, David E.; Ratinsky, Alon, Method and apparatus for maintaining netflow statistics using an associative memory to identify and maintain netflows.
Roden, Thomas; Shively, Darrell; Nguyen, Dan; Nadeau, Larry; Truong, Tina; Still, David N., Method and apparatus for managing a network using link state information.
Warkhede, Priyank Ramesh; Bryant, Stewart Frederick, Method and apparatus for mapping prefixes and values of a hierarchical space to other representations.
Arad Naveh ; Itzhak Parnafes ; Shai Mohaban ; Steven M. Woo, Method and apparatus for policy-based management of quality of service treatments of network data traffic flows by integrating policies with application programs.
Shai Mohaban ; Itzhak Parnafes ; Yoram Ramberg IL; Yoram Snir IL; John Strassner, Method and apparatus of storing policies for policy-based management of quality of service treatments of network data traffic flows.
Claude Galand FR; Pierre-Andre Foriel FR; Aline Fichou FR; Marcus Enger DE, Method and system for implementing congestion detection and flow control in high speed digital network.
Olivier Bertin FR; Gerard Brun FR; Claude Galand FR; Olivier Maurel FR; Laurent Nicolas FR, Method and system for minimizing the connection set up time in high speed packet switching networks.
Guerin,Roch; Rajan,Rajendran, Method and system for topology construction and path identification in a routing domain operated according to a link state routing protocol.
Christopherson, Thomas Dean; Dykes, Pernell James; Hammersley, Scott; Kiel, Harvey Gene; Lankow, Christopher John; Romon, Raymond Francis; Slavin, Timothy James, Method, system and program for sharing the ability to set configuration parameters in a network environment.
Natarajan, Shankar; Harvey, Andrew G.; Lee, Hsuan-Chung; Rawat, Vipin; Pereira, Leo, Policy engine which supports application specific plug-ins for enforcing policies in a feedback-based, adaptive data network.
Savage, Donnie Van; Slice, Jr., Donald Earl; Brooks, Roy Michael; Birkner, Matthew Henry, Router configured for outputting update messages specifying a detected attribute change of a connected active path according to a prescribed routing protocol.
Natarajan, Shankar; Harvey, Andrew G.; Lee, Hsuan-Chung; Rawat, Vipin; Pereira, Leo, Technique for collecting operating information from network elements, and for controlling network element behavior in a feedback-based, adaptive data network.
Natarajan, Shankar; Harvey, Andrew G.; Lee, Hsuan-Chung; Rawat, Vipin; Pereira, Leo, Technique for providing automatic event notification of changing network conditions to network elements in an adaptive, feedback-based data network.
Ahlstrom John K. ; Schleimer Stephen I., Verifying that a network management policy used by a computer system can be satisfied and is feasible for use.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.