Browse Prior Art Database

DYNAMIC BUSY QUEUE

IP.com Disclosure Number: IPCOM000007225D
Original Publication Date: 1994-Jun-01
Included in the Prior Art Database: 2002-Mar-06
Document File: 2 page(s) / 106K

Publishing Venue

Motorola

Related People

Hsia Huang: AUTHOR [+3]

Abstract

Since any radio can initiate any call at any time, it's possible that many radios may require RF resources (i.e. channels) in the same cell at the same time. The current busy queuing algorithm in the MIRS system will wait for resources indefinitely.

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

MOTOROLA Technical Developments Volume 22 June 1994

DYNAMIC BUSY QUEUE ~

by Hsia Huang, Bin Lo and Glenn Lubin

INTRODUCTION

  Since any radio can initiate any call at any time, it's possible that many radios may require RF resources (i.e. channels) in the same cell at the same time. The current busy queuing algorithm in the MIRS system will wait for resources indefinitely.

  The dynamic busy queuing algorithm provides flexibility and allows the busy queuing time to be changed dynamically. With this invention, the traf- fic between the ACG and the DAP can be mini- mized and throughput can be increased at peak traf- fic time. Also dynamic busy queuing algorithm will be able to break up the software or hardware dead- lock and free up the resource. With this invention, the customer can choose how long a call should be queued. Some ofthe more critical users will want to have their calls to be queued indefinitely. However, some of the less critical users will be very happy to have a call queued for just a short period of time. Also some other customers may prefer to have simi- lar features as telephony, where a call is never queued.

increased incrementally;, If the idle resource timer timeout count is less than or equal to the maxi- mum number of idle resource timer timeout count, the idle resource timer twill be started again. The change priority message will be sent to the ACG (Audio Control Gateway). Ifthe idle resource timer timeout count is greater than the maximum idle resource timer timeout #count, the call will be ter- minated. Termination data will be collected. In this way, after waiting for a certain period of time (maxi- mum idle resource timer timeout count * time of the idle resource timer)! if no server becomes avail- able, the request will be denied.

  By adding an idle resource timer timeout count in the call data and comparing the idle resource timer timeout count with the global maximum time- out count each time the idle resource timer times out, the infinite busy queuing can convert to finite busy queuing.

  By choosing the different value of maximum idle resource timer timeout count, the customer can choose how long a call should be queued. By chang- ing the maximum idle resource timer timeout count to zero, the finite busy 'queuing can convert to no busy queuing. And by updating the maximum idle resource timer timeout 'count to...