Multiplex communications – Data flow congestion prevention or control – Control of data admission to the network
Reexamination Certificate
2011-05-31
2011-05-31
Pham, Chi H (Department: 2471)
Multiplex communications
Data flow congestion prevention or control
Control of data admission to the network
C709S226000
Reexamination Certificate
active
07953000
ABSTRACT:
A technique is provided for one or more network nodes to deterministically select data flows to preempt. In particular, each node employs a set of predefined rules which instructs the node as to which existing data flow should be preempted in order to admit a new high-priority data flow. The rules are precisely defined and are common to all nodes configured in accordance with the present invention. Illustratively, a network node not only selects a data flow to preempt, but additionally may identify other “fate sharing” data flows that may be preempted. As used herein, a group of data flows has a fate-sharing relationship if the application instance(s) containing the data flows functions adequately only when all the fate-shared flows are operational. In a first illustrative embodiment, after a data flow in a fate-sharing group is preempted, network nodes may safely tear down the group's remaining data flows. In a second illustrative embodiment, when a data flow is preempted, all its fate-shared data flows are marked as being “at risk.” Because the at-risk flows are not immediately torn down, it is less likely that resources allocated for the at-risk flows may be freed then subsequently used to establish relatively lower-priority data flows instead of relatively higher-priority data flows.
REFERENCES:
patent: 6606301 (2003-08-01), Muller et al.
patent: 7035202 (2006-04-01), Callon
patent: 7453801 (2008-11-01), Taneja et al.
patent: 7536192 (2009-05-01), O'Neill
patent: 2002/0141345 (2002-10-01), Szviatovszki et al.
patent: 2003/0152029 (2003-08-01), Couturier
patent: 2003/0191828 (2003-10-01), Ramanathan et al.
patent: 2003/0223431 (2003-12-01), Chavez et al.
patent: 2004/0081104 (2004-04-01), Pan et al.
patent: 2004/0083287 (2004-04-01), Gao et al.
patent: 2004/0156313 (2004-08-01), Hofmeister et al.
patent: 2005/0078688 (2005-04-01), Sharma et al.
patent: 2005/0117512 (2005-06-01), Vasseur et al.
patent: 2006/0045132 (2006-03-01), Metke
Perlman, Radia, Interconnections Second Edition: Bridges, Routers, Switches, and Internetworking Protocols, Addison Wesley, 1999, Sections 1.1, pp. 1-7.
Braden, R. et al., Network Working Group RFC 2205, entitled Resource ReSerVation Protocol (RSVP)—Version 1 Functional Specification, Sep. 1997, pp. 1-105.
Herzog, S., Network Working Group RFC 3181, entitled Signaled Preemption Priority Policy Element, Oct. 2001, pp. 1-12.
Braden, R. et al., Network Working Group RFC 2209, entitled Resource ReSerVation Protocol (RSVP)—Version 1 Message Processing Rules, Sep. 1997, pp. 1-24.
Herzog, S., Network Working Group RFC 2750, entitled RSVP Extensions for Policy Control, Jan. 2000, pp. 1-13.
Baker Frederick
Davie Bruce S.
DiBiasio Michael V.
Iturralde Carol
Levesque Roger
Adhami Mohammad S
Cesari and McKenna LLP
Cisco Technology Inc.
Pham Chi H
LandOfFree
Mechanism to improve preemption behavior of resource... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Mechanism to improve preemption behavior of resource..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Mechanism to improve preemption behavior of resource... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2636296