Service curve mapping

Multiplex communications – Data flow congestion prevention or control – Control of data admission to the network

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S395210, C370S395430, C709S223000

Reexamination Certificate

active

07839781

ABSTRACT:
A method for configuring service curves for managing the output port of a networking device includes the following steps. A multitude of traffic classes is defined, each traffic class being characterized by a bandwidth and a delay priority. A multitude of traffic service curves is computed, each of the plurality of traffic service curves is associated with a different one of the multitude of traffic classes. At least one of the multitude of traffic classes service curves is characterized by a shifted two-piece linear function shifted such that the service curve limits service to during a nonzero time period prior to the start of the two-piece linear function.

REFERENCES:
patent: 6816903 (2004-11-01), Rakoshitz et al.
patent: 6973033 (2005-12-01), Chiu et al.
patent: 7010611 (2006-03-01), Wiryaman et al.
patent: 7068660 (2006-06-01), Suni
patent: 7075934 (2006-07-01), Chiussi et al.
patent: 7120666 (2006-10-01), McCanne et al.
patent: 7146425 (2006-12-01), Oottamakorn et al.
patent: 7457296 (2008-11-01), Kounavis et al.
patent: 7594006 (2009-09-01), Rolia et al.
patent: 2003/0169743 (2003-09-01), Chiussi et al.
patent: 2004/0215746 (2004-10-01), McCanne et al.
patent: 2005/0210245 (2005-09-01), Rolia et al.
patent: 2007/0237074 (2007-10-01), Curry
patent: 2007/0297348 (2007-12-01), Trac et al.
patent: 2007/0297414 (2007-12-01), Gupta et al.
International Search Report and Written Opinion mailed Jul. 7, 2008 of PCT/US07/70158 filed May 31, 2007.
International Search Report and Written Opinion mailed Sep. 22, 2008 of PCT/US07/71254 filed Jun. 14, 2007.
U.S. Appl. No. 11/756,584, filed May 31, 2007, now App. Pub No. US2007-0297348 A1, Office Action mailed Jun. 12, 2008.
U.S. Application No. 11/756,584, filed May 31, 2007, now App. Pub No. US2007-0297348 A1, Applicant Response to Office Action received by the USPTO on Sep. 12, 2008.
U.S. Application No. 11/756,584, filed May 31, 2007, now App. Pub No. US2007-0297348 A1, Office Action mailed Jun. 12, 2008.
U.S. Application No. 11/756,584, filed May 31, 2007, now App. Pub No. US2007-0297348 A1, Applicant Response to Office Action received by the USPTO on Aug. 1, 2008.
Bennet and Zhang, “Hierarchical Packet Fair Queuing Algorithms”, Proc. ACM SIGCOMM 1996.
R. L. Cruz, “Service burstiness and dynamic burstiness measures: a framework”, Journal of High Speed Networks, vol. 1, No. 2, 1992.
“Scheduling for Quality of Service Guarantees via Service Curves”, Proc. ICCCN Sep. 1995, authors H. Sariowan, R. Cruz, and G. Polyzos.
S. Floyd and V. Jacobson, Link-Sharing and Resource Management Models for Packet Networks, IEEE/ACM Transactions on Networking, vol. 3, No. 4, Aug. 1995.
I. Stoica, H. Zhang, and T. S. E. NG in an article entitles “A Hierarchical Fair Service Curve Algorithm for Link-Sharing, Real-Time and Priority Service”, Proc. ACM SIGCOMM, 1997, Cannes, France.
Balakrishnan, S., et al., “Improving reliable transport and handoff performance in cellular wireless networks,”Wireless Networks, vol. 1. No. 4, Dec. 1995. pp. 469-481.
Saltzer, J. H., et al., “End-to-End Arguments in System Design,”ACM Transactions on Computer Systems, vol. 2, No. 4, Nov. 1984, pp. 277-288.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Service curve mapping does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Service curve mapping, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Service curve mapping will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4201102

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.