Multiplex communications – Data flow congestion prevention or control
Reexamination Certificate
2005-05-20
2009-12-22
Yao, Kwang B (Department: 2416)
Multiplex communications
Data flow congestion prevention or control
C370S395200, C370S462000, C370S468000
Reexamination Certificate
active
07636302
ABSTRACT:
A technique avoids unnecessary preemption of resource reservations along a requested flow between nodes in a computer network. A node receives priority-based resource reservation requests and determines conditions of reservation eligibility by comparing the requested resources to the amount of available resources at the node. Specifically, the node maintains a “held resources” state where available requested resources are held prior to their being assigned or reserved (confirmed) for the requested flow, such as, e.g., during an initial Resource reSerVation Protocol (RSVP) Path message. The node includes the held resources in calculations of available resources in such a way as to prevent resources from being assigned or reserved if the resources would be subsequently preempted by a request of higher priority, or if an earlier request would first utilize the resources. The node (e.g., an end node) also prevents resources from being reserved or preempted in a duplex (bi-directional) reservation on a first flow in a first direction when resources available for a second flow in a second direction indicate a failure of the second flow.
REFERENCES:
patent: 5473599 (1995-12-01), Li et al.
patent: 6195705 (2001-02-01), Leung
patent: 6400681 (2002-06-01), Bertin et al.
patent: 6493317 (2002-12-01), Ma
patent: 6643260 (2003-11-01), Kloth et al.
patent: 6728365 (2004-04-01), Li et al.
patent: 6788647 (2004-09-01), Mohaban et al.
patent: 6798746 (2004-09-01), Kloth et al.
patent: 6847827 (2005-01-01), Helm et al.
patent: 6868065 (2005-03-01), Kloth et al.
patent: 6870812 (2005-03-01), Kloth et al.
patent: 6876668 (2005-04-01), Chawla et al.
patent: 6973035 (2005-12-01), Seddigh et al.
patent: 6999436 (2006-02-01), Zheng et al.
patent: 7013338 (2006-03-01), Nag et al.
patent: 7069337 (2006-06-01), Rawlins et al.
patent: 7076540 (2006-07-01), Kurose et al.
patent: 7106756 (2006-09-01), Donovan et al.
patent: 2003/0005130 (2003-01-01), Cheng
patent: 2003/0097460 (2003-05-01), Higashiyama et al.
patent: 2003/0161322 (2003-08-01), Shaheen et al.
patent: 2003/0223431 (2003-12-01), Chavez et al.
patent: 2006/0056291 (2006-03-01), Baker et al.
U.S. Appl. No. 10/875,985, filed Jun. 24, 2004, Dhesikan et al.
Perlman, Radia, Interconnections Second Edition: Bridges, Routers, Switches, and Internetworking Protocols, Addison Wesley, 1999, Section 1.1—Layers, pp. 1-7.
Herzog, S., RFC 2750 entitled, RSVP Extensions for Policy Control, Jan. 2000, pp. 1-13.
Herzog, S., RFC 3181 entitled, Signaled Preemption Priority Policy Element, Oct. 2001, pp. 1-12.
Braden, R. et al., RFC 2205, entitled Resource ReSerVation Protocol (RSVP), Version 1 Functional Specification, Sep. 1997, pp. 1-112.
Dhesikan Subhasri
Tyagi Satyam
Cesari and McKenna LLP
Cisco Technology Inc.
Elpenord Candal
Yao Kwang B
LandOfFree
Avoiding unnecessary RSVP-based preemptions does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Avoiding unnecessary RSVP-based preemptions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Avoiding unnecessary RSVP-based preemptions will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4096043