Method and apparatus for policy-based dynamic preemptive...

Multiplex communications – Data flow congestion prevention or control – Flow control of data transmission through a network

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S230000, C370S395400, C370S395410, C370S468000

Reexamination Certificate

active

10603559

ABSTRACT:
To address the need for protecting the QoS of high priority flows in a communication network when network conditions vary, original queue weights (B) are modified by a bandwidth allocation adaptor. The modification of the original queue weights is based, in part, on channel conditions.

REFERENCES:
patent: 6317416 (2001-11-01), Giroux et al.
patent: 6820128 (2004-11-01), Firoiu et al.
patent: 6961307 (2005-11-01), Aweya et al.
patent: 6996062 (2006-02-01), Freed et al.
patent: 7046678 (2006-05-01), Jiang et al.
patent: 2002/0147022 (2002-10-01), Subramanian et al.
J. Liebeherr and D.E. Wrege, “Priority Queue Schedulers with Approximate Sorting in Output-Buffered Switches,” IEEE JSAC, Jun. 1999. ftp://ftp.cs.virginia.edu/pub/jorg/papers/jsac699.pdf.
H. Zhang, “Service disciplines for guaranteed performance service in packet-switching networks”, Proc. IEEE, 83(10):1374--96, Oct. 1995. http://citeseer.nj.nec.com/cache/papers/cs/16973/ftp:zSzzSzftp.cs.utexas.eduzSzpubzSztechreportszSztr96-02.pdf/goyal96starttime.pdf.
M. Shreedhar and G. Varghese, “Efficient Fair Queuing Using Deficit Round Robin”, 1995. http://citeseer.nj.nec.com/cache/papers/cs/365/http:zSzzSzwww.cs.wustl.eduzSzcszSztechreportszSz1994zSzwucs-94-17.pdf/shreedhar95efficient.pdf.
A. Demers, S. Keshav, and S. Shenker, “Analysis and simulation of a fair queuing algorithm”,Proc. SIGCOMM'89, pp. 1-12, Austin, Texas http://www.acm.org/sigcomm/ccr/archieve/1995/jan95/ccr-9501-shenker.pdf.
S. J. Golestani, “A Self-Clocked Fair Queuing Scheme for Broadband Applications”.
P. Goyal, H. M. Vin, and H. Cheng, “Start Time Fair Queuing: A Scheduling Algorithm for Integrated Services Packet Switching Networks”.
D. Stilliadis and A. Verma, “Latency-rate servers: A general model for analysis of traffic scheduling algorithms”,IEEE/ACM Transactions on Networking, 6(2):164--174, Apr. 1998. http://citeseer.nj.nec.com/cache/papers/cs/2814/http:zSzzSzwww.bell-labs.comzSzuserzSzstiliadizSzlr.pdf/stiliadis96latencyrate.pdf.
H. Wang, C. Shen, K. G. Shin, “Adaptive-Weighted Packet Scheduling for Premium Service”, http://www.merl.com/papers/TR2001-07/.
P. Bhagwat, P. Bhattacharya, A. Krishna and S. K. Tripathi, “Enhancing throughput over wireless LANs using Channel State Dependent Packet Scheduling” IEEE Infocom 1996 http://citeseer.nj.nec.com/cache/papers/cs/16896/ftp:zSzzSzftp.ccs.neu.eduzSzpubzSzpeoplezSzmattazSzWirelesszSzPravinInfo96.pdf/bhagwat96enhancing.pdf.
R. Kautz and A. L. Garcia, “A Distributed Self-Clocked Fair Queueing Architecture for Wireless ATM Networks”.
Wu, et al., “Fair Scheduling with Bottleneck Consideration in Wireless Ad-hoc Networks NS: Network Simulator”, http://www.isi.edu
snam
s.
A. K. Parekh and R.G. Gallager, “A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks”, inProc. IEEE Infocom'93, pp. 521-530, 1993. http://www.tecknowbasic.com/thesis.pdf http://www.comsoc.org/livepubs/50—journals/pdf/RightsManagement—eid=190987.pdf.
A. K. Parekh and R. G. Gallager, “A generalized processor sharing approach to flow control in integrated services networks”, inProc. IEEE Infocom'92, pp. 915-924, 1992.
Liu and Layland, “Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment,” J. of the ACM 20(1), 1973. * http://www.cs.wustl.edu/˜venkita/publications/class/LiuLayland.pdf.
Bennett and Zhang, “Worst case fair weighted fair queuing”, INFOCOM 96. http://citeseer.nj.nec.com/cache/papers/cs/2900/http:zSzzSzwww.cs.wisc.eduzSz˜lhlzSzcs740zSzpaperszSzwf2q.pdf/zhang96wfq.pdf.
Hui Zhang and Domenico Ferrari, “Rate-Controlled Static-Priority Queuing,” IEEE INFOCOM'93. http://citeseer.nj.nec.com/cache/papers/cs/16848/ftp:zSzzSzftp.icsi.berkeley.eduzSzpubzSztechreportszSz1992zSztr-92-003.pdf/zhang93ratecontrolled.pdf.
VIC: LBNL's video conferencing tool, http://www-nrg.ee.lbl.gov/vic/.
M. Podolsky, M. Vetterli, and S. McCanne, “Limited retransmission of real-time layered multimedia,” Proc. IEEE Workshop on Multimedia Signal Processing, Dec. 1998.
K. Nichols, S. Blake, F. Baker and D. Black, “Definition of the Differentiated Services Field (DS) in the IPv4 and Ipv6 headers”, RFC 2474, Dec. 1998. http://www.ietf.org/rfc/rfc2474.txt.
S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang and W. Weiss, “An Architecture for Differentiated Services”, RFC 2475, Dec. 1998. http://www.ietf.org/rfc/rfc2475.txt.
S. Shenker and J. Wroclawski, “General Characterization Parameters for Integrated Service Network Element”, RFC 2215, Sep. 1997 http://www.ietf.org/rfc/rfc2215.txt.
Sandeep Bajaj, Lee Breslau and Scott Shenker, “Is Service Priority Useful in Packet Networks?”,Proceedings of ACM Sigmetrics '98, pp. 66-77, Madison, Wisconsin, Jun. 1998. http://citeseer.nj.nec.com/cache/papers/cs/1710/http:zSzzSzwww.cs.wpi.eduzSz˜sigmet98zSzbajaj/pdf/bajaj98is.pdf.
Whay C. Lee and Michael G. Hluchyj, “Dynamic Connection Management for Call-Level QOS Guarantee in Integrated Communication Networks,” IEEE INFOCOM, 1994.

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

Method and apparatus for policy-based dynamic preemptive... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and apparatus for policy-based dynamic preemptive..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for policy-based dynamic preemptive... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3880238

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