Capacity allocation for packet data bearers

Details Capacity allocation for packet data bearers Capacity allocation for packet data bearers

2001-02-06

2009-12-01

Sheikh, Ayaz R (Department: 2419)

Multiplex communications

Pathfinding or routing

Switching a message which includes an address header

C370S395420

Reexamination Certificate

active

07626989

ABSTRACT:
The present invention relates to a method in a radio communication system providing packet data services. A radio communication system providing packet data services and a packet data scheduler (PS) are also disclosed. In accordance with the method capacity is requested for a packet data bearer, whereafter capacity is allocated for the packet data bearer based on a first timing scheme. The allocated capacity may be modified based on a second timing scheme. The packet data scheduler (PS) comprises two timers (T1, T2) fore implementing the two different timing schemes.

REFERENCES:
patent: 3560660 (1971-02-01), Poretti et al.
patent: 4189622 (1980-02-01), Foshee
patent: 4418386 (1983-11-01), Vrielink
patent: 5914950 (1999-06-01), Tiedemann et al.
patent: 5953665 (1999-09-01), Mattila
patent: 6034960 (2000-03-01), Beshai et al.
patent: 6108553 (2000-08-01), Silventoinen et al.
patent: 6118787 (2000-09-01), Kalkunte et al.
patent: 6141336 (2000-10-01), Bauchot et al.
patent: 6201966 (2001-03-01), Rinne et al.
patent: 6404771 (2002-06-01), Gulick
patent: 6438134 (2002-08-01), Chow et al.
patent: 6469996 (2002-10-01), Dupuy
patent: 6470016 (2002-10-01), Kalkunte et al.
patent: 6628738 (2003-09-01), Peeters et al.
patent: 6665301 (2003-12-01), Wu
patent: 6693892 (2004-02-01), Rinne et al.
patent: 6718179 (2004-04-01), Forssell et al.
patent: 6731638 (2004-05-01), Ofek
patent: 6791944 (2004-09-01), Demetrescu et al.
patent: 6901066 (2005-05-01), Helgeson
patent: 6920128 (2005-07-01), Haugli et al.
patent: 6975613 (2005-12-01), Johansson
patent: RE39216 (2006-08-01), Worsley et al.
patent: 7483433 (2009-01-01), Simmons et al.
patent: 2004/0210705 (2004-10-01), Armstrong et al.
patent: 2005/0276256 (2005-12-01), Raitola et al.
patent: 0884864 (1998-06-01), None
patent: 9907170 (1999-02-01), None
patent: 9948255 (1999-09-01), None
patent: WO0163851 (2001-08-01), None
patent: WO03036881 (2003-05-01), None
Efficient distributed scheduling architecture for wireless ATMnetworks; Tse, C.H. Bensaou, B. Chua, K.C.; Center for Wireless Commun., Nat. Univ. of Singapore; This paper appears in: ATM Workshop, 1999. IEEE Proceedings; Publication Date: 1999 On pp. 415-425; Meeting Date: May 24, 1999-May 27, 1999; Location: Kochi, Japan.
Throughput analysis of a timer controlled token passing protocol under heavy load; Pang, J.W.M.; Tobagi, F.A.; Communications, IEEE Transactions on vol. 37, Issue 7, Jul. 1989 pp. 694-702.
Scalable timers for soft state protocols; Sharma, P.; Estrin, D.; Floyd, S.; Jacobson, V.; Infocom '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE; vol. 1, Apr. 7-11, 1997 pp. 222-229 vol. 1.
Staged refresh timers for RSVP; Ping Pan; Schulzrinne, H.; Global Telecommunications Conference, 1997. Globecom '97., IEEE; vol. 3, Nov. 3-8, 1997 pp. 1909-1913 vol. 3.

Affiliated with

Also associated with

Rating

Capacity allocation for packet data bearers does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Capacity allocation for packet data bearers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Capacity allocation for packet data bearers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4074434