Browse Prior Art Database

RESOURCES ALLOCATION ALGORITHM FOR INTRACELL CALLS

IP.com Disclosure Number: IPCOM000007917D
Original Publication Date: 1996-Nov-01
Included in the Prior Art Database: 2002-May-06
Document File: 2 page(s) / 93K

Publishing Venue

Motorola

Related People

Boris Spektor: AUTHOR [+3]

Abstract

When the cell receives a request for call from a requesting unit the current algorithm allocates a traf fit channel to the requesting unit and determines whether another tratftc channel is available for the requester's target unit. If no channels are available, the algorithm puts the target unit in a queue.

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 50% of the total text.

Page 1 of 2

Technical Developments

RESOURCES ALLOCATION ALGORITHM FOR INTRACELL CALLS

by Boris Spektor, Naum Spektor and Anatoly Belkin

  When the cell receives a request for call from a requesting unit the current algorithm allocates a traf fit channel to the requesting unit and determines whether another tratftc channel is available for the requester's target unit. If no channels are available, the algorithm puts the target unit in a queue.

  Modified resources allocation algorithm then examines the head of the queue to determine if the head is a target unit (termination part) of intracell call.

  When the head of the queue is a target unit of intracell call the modified algorithm searches from the tail to the head whether there is another target unit of an intracell call in the queue.

  If another target unit is found the modified algo- rithm removes the identified target unit from the queue and then releases the trahic channel allocated to the targer's associated requesting unit. The newly available traffic channel is then allocated to the tar- get unit at the head of the queue to complete the intracell call associated therewith.

  By using this allocation approach, the present invention permits completion at least one of an intracell calls, that might otherwise be rejected due to the unavailability of a tralhc channels during the queue time period, by releasing the resources of an another intracell call that all the same cannot be completed.

  To check whether or not the target in a queue is a part of intracell call a special message can be sent to the BSC or MSC querying the intmstructure about cell identifier oforiginator ofthis call.

  Another way to find the originator cell identifier is to put this information in the information ele- ment ofoutbound Set up message.

lNTRODUCTlON

  In existing iDEN systems current radio resources allocation algorithm ahocates tragic channels (TCHs) first to originating part of intracell Mobile to...