JPH0828738B2 - Call control task hunt method - Google Patents
Call control task hunt methodInfo
- Publication number
- JPH0828738B2 JPH0828738B2 JP5104639A JP10463993A JPH0828738B2 JP H0828738 B2 JPH0828738 B2 JP H0828738B2 JP 5104639 A JP5104639 A JP 5104639A JP 10463993 A JP10463993 A JP 10463993A JP H0828738 B2 JPH0828738 B2 JP H0828738B2
- Authority
- JP
- Japan
- Prior art keywords
- call control
- control task
- hunt
- empty
- area
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Lifetime
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Communication Control (AREA)
Description
【０００１】[0001]
【産業上の利用分野】本発明は、呼制御タスクを用いて
呼制御を行う交換システムに関し、特に、呼制御タスク
ハント方式に関する。BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a switching system for performing call control using a call control task, and more particularly to a call control task hunt system.
【０００２】[0002]
【従来の技術】従来、この種の呼制御タスクハント方式
は、排他処理を行わない方式であった。2. Description of the Related Art Conventionally, this type of call control task hunt system has been a system in which exclusive processing is not performed.
【０００３】即ち、従来の方式では、発呼側／着呼側か
らの呼制御タスクハント指示受信時の排他処理は、同一
プライオリティのタスクから要求すること、更に呼制御
タスクハント処理中に中断処理を行わないことを条件と
していたので、排他処理は考慮されていなかった。この
ために、呼制御タスクハント要求する側は、発呼側／着
呼側がそれぞれ同一プライオリティのタスクから呼制御
タスクハント要求を行わなければならなかった。また、
異なるプライオリティからハント要求をされることを考
えたときには、呼制御タスクハント処理をマスクをかけ
て行うという処理方式が考えられるが、マスクをかける
とその分処理能力が低下するという問題がある。That is, according to the conventional method, the exclusive processing when the call control task hunt instruction is received from the calling side / the called side is requested from the task of the same priority, and the interruption processing is performed during the call control task hunt processing. The exclusion process was not taken into consideration because the condition was not to do. For this reason, on the call control task hunt request side, the caller / callee must make a call control task hunt request from tasks having the same priority. Also,
Considering that a hunt request is issued from a different priority, a processing method in which a call control task hunt process is masked is conceivable, but there is a problem that the masking reduces the processing capability by that amount.
【０００４】[0004]
【発明が解決しようとする課題】上述した従来の管理方
式では、呼制御タスクハントを要求する発呼側／着呼側
のタスクは同一のプライオリティでなければならず、ま
た呼制御タスクハント処理に中断処理があってはならな
いという条件を設けなければならないという欠点があ
る。In the above-mentioned conventional management method, the tasks of the calling side / the called side requesting the call control task hunt must have the same priority, and the call control task hunt processing must be performed. There is a drawback in that the condition that there must be no interruption processing must be provided.
【０００５】本発明は従来の技術に内在する上記欠点を
解消する為になされたものであり、従って本発明の目的
は、交換システムに収容される回線に対応したパスを通
して、端末あるいは対向交換システムから送られてくる
回線制御情報の分析や、回線の状態遷移の管理の処理を
行う呼制御タスクにおいて、発呼者／着呼者毎に割り当
てられる呼制御タスクの空塞管理を行うための呼制御タ
スクハントを、異なるプライオリティの状態からマスク
せずに排他処理を行うことを可能とした新規な呼制御タ
スクハント方式を実現することにある。The present invention has been made in order to solve the above-mentioned drawbacks inherent in the prior art. Therefore, an object of the present invention is to provide a terminal or an opposite switching system through a path corresponding to a line accommodated in the switching system. In the call control task that analyzes the line control information sent from the device and manages the state transition of the line, a call for performing the open / close management of the call control task assigned to each caller / callee. It is to realize a new call control task hunt method that enables exclusive processing without masking control task hunts from different priority states.
【０００６】[0006]
【課題を解決するための手段】上記目的を達成するため
に、本発明に係る呼制御タスク管理方式は、呼制御タス
クの空塞管理を行うために、交換システムが提供する呼
制御タスク実装数分のビット数を有する呼制御タスク空
塞テーブルと、発呼側／着呼側それぞれ最新の呼制御タ
スク番号をセーブする呼制御タスクビットアドレスエリ
アと、発呼側／着呼側の内いずれかプライオリティの低
い側からの呼制御タスクハント時の現呼制御タスク空塞
テーブルアクセスエリアとを備えて構成され、プライオ
リティの低い側からの呼制御タスクハント処理では前記
現呼制御タスク空塞テーブルアクセスエリアを更新して
から空き呼制御タスクをサーチし、プライオリティの高
い側からの呼制御タスクハント処理では空き呼制御タス
クをサーチしたときにその呼制御タスク空塞テーブルア
クセスエリアがプライオリティの低い側の前記現呼制御
タスク空塞テーブルアクセスエリアにセーブされている
エリアと同じ場合には次エリア以降の空き呼制御タスク
を再びサーチする処理を行うことにより、呼制御タスク
をハントする利用者が異なるプライオリティであっても
制限を与えずに、排他処理を実現することを特徴として
いる。In order to achieve the above object, a call control task management system according to the present invention is provided with a number of call control task implementations provided by a switching system in order to manage call control task availability. A call control task empty / busy table having the number of bits per minute, a call control task bit address area for saving the latest call control task number for each of the calling side and the called side, and one of the calling side / the called side The current call control task empty / busy table access area at the time of the call control task hunt from the low priority side and the current call control task empty / busy table access area in the call control task hunt process from the low priority side. It is said that the idle call control task is searched after updating the call, and the idle call control task is searched for in the call control task hunt process from the higher priority side. In the case where the call control task empty / busy table access area is the same as the area saved in the current call control task empty / busy table access area on the lower priority side, processing for re-searching for an empty call control task in the next area and thereafter By performing the above, even if the user who hunts the call control task has different priorities, exclusive processing is realized without imposing restrictions.
【０００７】[0007]
【実施例】次に、本発明をその好ましい一実施例につい
て図面を参照して具体的に説明する。DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Next, the present invention will be described in detail with reference to the accompanying drawings with reference to the accompanying drawings.
【０００８】図１は本発明の一実施例を示すブロック構
成図である。FIG. 1 is a block diagram showing an embodiment of the present invention.
【０００９】図１を参照するに、本発明の一実施例にお
いては、発呼／着呼毎に呼制御タスクを割り当てるため
に、８ビットを１ｒｏｗとし、システムが提供する呼制
御タスク実装数分をｒｏｗ単位に用意した呼制御タスク
空塞テーブル１と、発呼側／着呼側それぞれ最新の呼制
御タスク番号（ビットアドレス）をセーブする発呼側呼
制御タスクビットアドレスエリア２（初期値は０）と、
着呼側呼制御タスクビットアドレスエリア３（初期値は
システムの呼制御タスク実装数−１を設定）と、発呼側
／着呼側互いにハント処理を起動されたときの排他処理
を実現するために、プライオリティの低い方（ここでは
発呼側）からの呼制御タスクハント時の発呼側現呼制御
タスク空塞テーブルアクセスエリア４（ｃｈａｒ型のポ
インタ）とにより呼制御タスクハントを管理する。Referring to FIG. 1, in one embodiment of the present invention, 8 bits are set to 1 row in order to allocate a call control task for each call / call, and the number of call control task implementations provided by the system is set. For each call control task, and the call control task bit address area 2 for the calling side that saves the latest call control task numbers (bit addresses) for each of the calling side and the called side (the initial value is 0),
To implement the call control task bit address area 3 of the called side (initial value is set to the number of system call control tasks implemented-1) and the exclusive processing when the calling side / called side hunt processing is activated by each other In addition, the call control task hunt is managed by the calling side current call control task empty / busy table access area 4 (char type pointer) at the time of the call control task hunt from the lower priority side (here, the calling side).
【００１０】発呼側からの呼制御タスクハント時には発
呼側呼制御タスクビットアドレスエリア２にセーブされ
ている呼制御タスク番号から後方に呼制御タスク空塞テ
ーブル１の中の空き呼制御タスクをサーチし、着呼側か
らの呼制御タスクハント時には、着呼側呼制御タスクビ
ットアドレスエリア３にセーブされている呼制御タスク
番号から前方に呼制御タスク空塞テーブル１の中の空き
呼制御タスクをサーチする。During a call control task hunt from the calling side, an empty call control task in the call control task free / busy table 1 is placed backward from the call control task number saved in the calling side call control task bit address area 2. When the call control task from the called side is hunted, the empty call control task in the call control task free / busy table 1 is moved forward from the call control task number saved in the called side call control task bit address area 3. Search for.
【００１１】ここで、発呼側（プライオリティの低い
側）の呼制御タスクハント処理では、空き呼制御タスク
をサーチする前に発呼側現呼制御タスク空塞テーブルア
クセスエリア４（ｃｈａｒ型のポインタ）を更新して、
その後空きビット（呼制御タスク）をサーチする。ま
た、着呼側（プライオリティの高い側）からの呼制御タ
スクハント処理では、先に空き呼制御タスクをサーチ
し、空き呼制御タスクが見つかったときに、その着呼側
呼制御タスクビットアドレスエリア３が発呼側（プライ
オリティの低い側）の現呼制御タスク空塞テーブルアク
セスエリア４にセーブされているエリアと同じ場合に
は、付与する呼制御タスクが競合してしまう可能性があ
るので、ここではハントせず、次エリアヘポインタを移
し（前方へ１つポインタを進め）、つぎの空き呼制御タ
スクをサーチする処理を行う。Here, in the call control task hunt processing on the calling side (low priority side), the calling side current call control task empty / busy table access area 4 (char type pointer) is searched before searching for an idle call control task. ) Is updated,
After that, an empty bit (call control task) is searched. In the call control task hunt process from the called side (side with high priority), an empty call control task is searched first, and when an empty call control task is found, the called side call control task bit address area is searched. If 3 is the same as the area saved in the current call control task free / busy table access area 4 of the calling side (the side with low priority), the call control tasks to be given may conflict, so Here, without hunting, the pointer is moved to the next area (the pointer is moved forward by one), and the processing for searching for the next idle call control task is performed.
【００１２】[0012]
【発明の効果】以上説明したように、本発明によれば、
発呼側／着呼側の設計時に制限を与えることなく、呼制
御タスクハント処理を実現することができるという利点
が得られる。As described above, according to the present invention,
There is an advantage that the call control task hunt process can be realized without giving restrictions in designing the calling side / the called side.
【００１３】また本発明によれば、異なるプライオリテ
ィからハント要求されることを考えたとき、呼制御タス
クハント処理をマスクをかけて行うという処理方式も考
えられるが、マスクをかけるとその分処理能力が低下す
るので、本発明の方が処理能力が高いという利点があ
る。Further, according to the present invention, when considering that a hunt request is made from different priorities, a processing system in which the call control task hunt processing is masked is also conceivable. Is lower, the present invention has the advantage of higher processing capacity.
【図１】本発明の一実施例を示すブロック図である。FIG. 1 is a block diagram showing one embodiment of the present invention.
１…呼制御タスク空塞テーブル ２…発呼側呼制御タスクビットアドレスエリア ３…着呼側呼制御タスクビットアドレスエリア ４…発呼側現呼制御タスク空塞テーブルアクセスエリア 1 ... Call control task empty / busy table 2 ... Calling side call control task bit address area 3 ... Called side call control task bit address area 4 ... Calling side current call control task empty / busy table access area
Claims (1)
たパスを通して、端末あるいは対向交換システムから送
られてくる回線制御情報の分析、回線の状態遷移の管理
の処理を行う、呼制御タスクをハントして呼制御を行う
交換システムにおいて、呼制御タスクの空塞管理を行う
ために、前記交換システムが提供する呼制御タスク実装
数分のビット数を有する呼制御タスク空塞テーブルと、
発呼側／着呼側それぞれ最新の呼制御タスク番号をセー
ブする呼制御タスクビットアドレスエリアと、発呼側／
着呼側の内いずれかプライオリティの低い側からの呼制
御タスクハント時の現呼制御タスク空塞テーブルアクセ
スエリアとを有し、プライオリティの低い側からの呼制
御タスクハント処理では前記現呼制御タスク空塞テーブ
ルアクセスエリアを更新してから空き呼制御タスクをサ
ーチし、プライオリティの高い側からの呼制御タスクハ
ント処理では空き呼制御タスクをサーチしたときにその
呼制御タスク空塞テーブルアクセスエリアがプライオリ
ティの低い側の前記現呼制御タスク空塞テーブルアクセ
スエリアにセーブされているエリアと同じ場合には次エ
リア以降の空き呼制御タスクを再びサーチする処理を行
うことを特徴とする呼制御タスクハント方式。1. A hunt call control task for analyzing line control information sent from a terminal or an opposite switching system through a path corresponding to a line accommodated in a switching system and managing a state transition of the line. In a switching system for performing call control by performing the call control task, in order to manage the availability of call control tasks, a call control task availability table having a number of bits corresponding to the number of call control task implementations provided by the switching system,
A call control task bit address area for saving the latest call control task number for each of the caller side / callee side and the caller side / callee side
The current call control task when the call control task hunts from one of the callee sides with a lower priority has an empty / busy table access area, and the call control task from the side with a lower priority has the current call control task in the hunt process. After updating the empty / busy table access area, an empty call control task is searched, and in the call control task hunt processing from the higher priority side, when an empty call control task is searched, the empty / busy table access area has priority. The call control task hunt method characterized in that when the area is the same as the area saved in the current call control task free / busy table access area on the lower side of the .
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP5104639A JPH0828738B2 (en) | 1993-04-30 | 1993-04-30 | Call control task hunt method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP5104639A JPH0828738B2 (en) | 1993-04-30 | 1993-04-30 | Call control task hunt method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| JPH06315035A JPH06315035A (en) | 1994-11-08 |
| JPH0828738B2 true JPH0828738B2 (en) | 1996-03-21 |
Family
ID=14386027
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| JP5104639A Expired - Lifetime JPH0828738B2 (en) | 1993-04-30 | 1993-04-30 | Call control task hunt method |
Country Status (1)
| Country | Link |
|---|---|
| JP (1) | JPH0828738B2 (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP5056661B2 (en) | 2008-08-07 | 2012-10-24 | 富士通株式会社 | Wireless control device |
-
1993
- 1993-04-30 JP JP5104639A patent/JPH0828738B2/en not_active Expired - Lifetime
Also Published As
| Publication number | Publication date |
|---|---|
| JPH06315035A (en) | 1994-11-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US5606719A (en) | Temporary state preservation for a distributed file service | |
| US5898760A (en) | Method and apparatus for automating the management of a database | |
| EP0766485A3 (en) | Improved data access for telecommunication networks | |
| CA2229447C (en) | Communication system and service controller for call handling | |
| US5327419A (en) | Communication system having a multiprocessor system serving the purpose of central control | |
| EP0749255B1 (en) | Mobile communications network and mobile communication method | |
| US6115734A (en) | Method of dynamically allocating tasks to events arriving on a set of queues | |
| US5479642A (en) | Method for maintaining low-overhead and non-coherent cache refresh mechanism with valid status monitoring on time period basis | |
| JPH0828738B2 (en) | Call control task hunt method | |
| JP3223953B2 (en) | Service logic program identification method | |
| JPH10303963A (en) | Transmission system | |
| JPS60253396A (en) | Routing control system | |
| US6330329B1 (en) | Method and apparatus within a switch for performing circular hunts with a window | |
| JP2716337B2 (en) | Call control processor | |
| JP3280676B2 (en) | Retrieval method of call processing task by providing purpose | |
| KR19980057407A (en) | How to assign a unique phone number for each individual at the exchange | |
| KR100288063B1 (en) | The method of call trace for V5.2 analog subscriber | |
| KR100298288B1 (en) | Method of Managing Call in the Exchange | |
| JP3830346B2 (en) | Call management method and server | |
| JP3564514B2 (en) | Distributed invisibility method | |
| JP2002252697A (en) | Service control system and method for changing accommodation site of customer data in service control system | |
| JPH05173868A (en) | Distributed data base management method | |
| KR20020044915A (en) | Number Translation Method In Exchange System | |
| JPH0832077B2 (en) | Channel control system | |
| JPH08116360A (en) | Automatic private branch exchange |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| S533 | Written request for registration of change of name |
Free format text: JAPANESE INTERMEDIATE CODE: R313533 |
|
| R350 | Written notification of registration of transfer |
Free format text: JAPANESE INTERMEDIATE CODE: R350 |
|
| FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20080321 Year of fee payment: 12 |
|
| FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20090321 Year of fee payment: 13 |
|
| FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20090321 Year of fee payment: 13 |
|
| S531 | Written request for registration of change of domicile |
Free format text: JAPANESE INTERMEDIATE CODE: R313531 |
|
| FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20090321 Year of fee payment: 13 |
|
| R350 | Written notification of registration of transfer |
Free format text: JAPANESE INTERMEDIATE CODE: R350 |
|
| FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20090321 Year of fee payment: 13 |
|
| FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20100321 Year of fee payment: 14 |
|
| FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20100321 Year of fee payment: 14 |
|
| FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20110321 Year of fee payment: 15 |
|
| FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20110321 Year of fee payment: 15 |
|
| FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20120321 Year of fee payment: 16 |
|
| FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20120321 Year of fee payment: 16 |
|
| FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20130321 Year of fee payment: 17 |
|
| FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20130321 Year of fee payment: 17 |
|
| FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20140321 Year of fee payment: 18 |
|
| EXPY | Cancellation because of completion of term |