Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2006-05-16
2006-05-16
Ngo, Ricky Q. (Department: 2664)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
C370S230000, C370S232000, C370S233000, C370S234000, C370S235000, C370S328000, C370S329000, C370S395210, C370S395420, C370S412000, C370S431000, C370S437000, C370S468000
Reexamination Certificate
active
07046678
ABSTRACT:
The present packet scheduling algorithm gives cellular network operators greater flexibility in adjusting the way resources are allocated among interactive best-effort data users. Best effort data users with different radio link qualities may have different amounts of data delivered to them using the same amount of radio resource. In the context of link adaptation, this characteristic complicates the fairness issue in cellular environments and has a profound impact on the overall system performance. As a result, the present packet scheduling algorithm is capable of allocating radio resource dynamically, not only based on channel conditions, but also to achieve different performance trade-offs among users with different link qualities. According to the algorithm, channel quality is determined for each user, channel efficiency is calculated and the channel efficiency value is used as the primary factor in weighting the delivery of packets to (or from) a given user. In a packet schedule weighting equation, a value of exponent may be varied from negative to positive to give good (or bad) users better service. However, performance of users with bad channel qualities degrades the performance of good channel users in a disproportionate manner. It is shown that it is frequently preferable to favor users with good channel qualities.
REFERENCES:
patent: 5726640 (1998-03-01), Jones et al.
patent: 5896561 (1999-04-01), Schrader et al.
patent: 6236656 (2001-05-01), Westerberg et al.
patent: 6393012 (2002-05-01), Pankaj
patent: 6501745 (2002-12-01), Turina et al.
patent: 6519233 (2003-02-01), Gutierrez
patent: 6570883 (2003-05-01), Wong
patent: 6584089 (2003-06-01), Honkasalo et al.
patent: 2002/0094815 (2002-07-01), Kanerva
P. Barford and M. Crovella, “Generating representative Web workloads for network and server performance evaluation,”SIGMETRICS '98/PERFORMANCE '98, Performance Evaluation Review, Jun. 1998, vol. 26, pp. 151-160.
P. Bhagwat et. Al, “Enchancing throughput over wireless LANs using channel state dependent packet scheduling,”Proceedings of INFOCOM '96, Mar. 1996, pp. 113-140.
V. Bharghavan et. Al, “Fair queuing in wireless networks: issues and approaches,”IEEE Personal Communications, Feb. 1999, vol. 6, pp. 44-53.
G. Bianchi et. Al, “On utility fair adaptive services in wireless networks,”1998 Sixth International Workshop on Quality of Service(IWQoS'98), Napa, CA, USA, May 18-20, 1998, pp. 256-267.
Justin Chuang and Shailender Timiri, “EDEG Compact and EDGE Classic Data Performance,”2000 Universal Wireless Communications Consortium Global summit, Apr. 2000.
C. Fragouli et. al, “Controlled multimedia wireless link sharing via enhanced class-based queuing with channel-state-dependent packet scheduling,”Proceedings of INFOCOM '98, Mar., 1998, pp. 572-580.
A. Furuskar et. al, “EDGE Enhanced Data Rates fro GSM and TDMA/136 Evolution,”IEEE Personal Communications, vol. 6, No. 3, Jun. 1999, pp. 56-66.
Z. Jiang, L. F. Chang, and N. K. Shankeranarayanan, “Providing multiple service classes for bursty data traffic in cellular networks,”ACG SIGCOMM 97 Conference, Computer Communication Review, Oct. 1997, vol. 27, pp. 63-74.
S. Khaunte, J. Limb, “Statistical characterization of a World Wide Web browsing session,” Georgia Institute of Technology, College of Computing Technical Report, GIT-CC-97-17, 1997. Unavailable from Georgia Tech website—access denied.
S. Lu et. al, “Fair scheduling in wireless packet networks,”ACM SIGCOMM 97 Conference, Computer Communication Review, Oct. 1997, vol. 27, pp. 63-74.
T. Nandagopal et. al, “A unifies architecture for the design and evaluation of wireless fair queuing algorithms,”Proceedings of ACM/IEEE MOBICOM '99, Aug. 1999, pp. 132-142.
T. S. E. Ng et. al, “Packet fair queuing algorithms for wireless networks with location dependent errors,”Proceedings of INFOSOM '98, Mar. 1998, pp. 1103-1111.
X. Qiu, and J. Chuang, “Link adaptation in wireless data networks for throughput maximization under retransmissions,”ICC '99.
P. Ramanathan and P. Agrawal, “Adapting packet fair queuing algorithms to wireless networks,”Proceedings on MOBICOM 1998, Oct. 1998, pp. 1-9.
H. Zhang, “Service disciplines for guaranteed performance service in packet-switching networks,”Proceedings of the IEEE, Oct. 1995, vol. 83, pp. 1374-1396.
ETSI. SMG2 EDGE 006-99, “EDGE: concept proposal for enhanced GPRS”. Unavailable—unable to locate version.
ETSI, “Digital cellular telecommunications system (Phase 2+), General Packet Radio Service(GPRS), service description,” v6.3.1, 1999.
Jiang Zhimei
Shankaranarayanan Nemmara K.
AT & T Corp.
Mew Kevin
Ngo Ricky Q.
LandOfFree
Channel efficiency based packet scheduling for interactive... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Channel efficiency based packet scheduling for interactive..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Channel efficiency based packet scheduling for interactive... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3629112