Packet data queuing and processing

Details Packet data queuing and processing Packet data queuing and processing

2008-06-10

2008-06-10

Pham, Chi (Department: 2616)

Multiplex communications

Pathfinding or routing

Switching a message which includes an address header

C370S395530

Reexamination Certificate

active

07385994

ABSTRACT:
A method of processing queued data packets in a packet data communication system is provided. The method includes allocating a tier of service for substantially each of a plurality of individual packet data queues and determining a total number of data packets that can use an available communication resource. A proportion of a total number of data packets is allocated to a number of the tiers of service to allow individual packet data queues on a number of tiers to share a communication resource. A communication resource is provided to queued packet data users on a tier-by-tier basis, such that the communication resource is made available to substantially all tiers.

REFERENCES:
patent: 6317416 (2001-11-01), Giroux et al.
patent: 6614790 (2003-09-01), Veres et al.
patent: 6912225 (2005-06-01), Kohzuki et al.
patent: 6977930 (2005-12-01), Epps et al.
patent: 7206282 (2007-04-01), Goldman et al.
patent: 2001/0033581 (2001-10-01), Kawarai et al.
patent: 2002/0163922 (2002-11-01), Dooley et al.
patent: 2002/0172156 (2002-11-01), Sandbote
patent: 19907085 (2000-04-01), None
patent: 1124356 (2001-08-01), None
patent: 2338372 (1999-12-01), None
patent: 2341751 (2000-03-01), None
patent: 2361147 (2001-10-01), None
patent: WO-0174027 (2001-10-01), None
Chaskar et al. (2003). “Fair Scheduling with Tunable Latency: A Round-Robin Approach,” IEEE/ACM Transactions on Networking, 11(4)592-601, 6 pages.
International Search Report mailed Apr. 29, 2003 for PCT Application No. PCT/GB02/04823 filed Oct. 24, 2002, 3 pages.
Keshav, S. “Stop-and-Go Service Using Hierarchical Round Robin.” Downloaded on Jul. 31, 2007, from <http://cm.bell-labs.com/cm/cs/doc/91/2-15.ps.gz>, 10 pages.
“Understanding Weighted Fair Queuing on ATM.” Downloaded on Jul. 31, 2007, from <http://www.cisco.com/warp/public/121/wfq—illustrated.pdf>, 10 pages.
Zhang et al. (1993). “Rate Controlled Static-Priority Queueing,” In Proceedings of IEEE IFOCOM '93. Downloaded on Jul. 31, 2007, from <http://www.cs.cmu.edu/˜hzhang/papers/INFOCOM93.pdf>, 11 pages.
Bennett et al. (Oct. 1997). “Hierarchical packet fair queueing algorithms,” IEE/ACM Transactions on Networking (TON), 5(5):675-689.
Semeria, C. (2001). “Supporting Differentiated Service Classes: Queue Scheduling Disciplines,” Juniper Network, Inc. Downloaded on Jul. 31, 2007, from <http://www.juniper.net/solutions/literature/white—papers/200020.pdf ×, pp. 1-25.
Search Report dated May 10, 2002, for GB Application No. GB 0125502.5, one page.
Held, G. (1997).Understanding Data Communications: From Fundamentals to Networking. John Wiley & Sons Ltd: West Sussex, England, 16 pages (Table of Contents).
Zhang, H. (Oct. 1995). “Service Disciplines for Guaranteed Performance Service in Packet-Switching Networks,”Proceedings of the IEEE83(10):1374-1396.

Affiliated with

Also associated with

Rating

Packet data queuing and processing does not yet have a rating. At this time, there are no reviews or comments for this patent.

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

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2802184