JPH01200849A - Communication processing network - Google Patents

Communication processing network

Info

Publication number
JPH01200849A
JPH01200849A JP63025351A JP2535188A JPH01200849A JP H01200849 A JPH01200849 A JP H01200849A JP 63025351 A JP63025351 A JP 63025351A JP 2535188 A JP2535188 A JP 2535188A JP H01200849 A JPH01200849 A JP H01200849A
Authority
JP
Japan
Prior art keywords
communication processing
access point
processing center
terminal
line
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.)
Pending
Application number
JP63025351A
Other languages
Japanese (ja)
Inventor
Mitsuhiro Kubota
窪田　光裕
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nippon Telegraph and Telephone Corp
Original Assignee
Nippon Telegraph and Telephone Corp
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Nippon Telegraph and Telephone Corp filed Critical Nippon Telegraph and Telephone Corp
Priority to JP63025351A priority Critical patent/JPH01200849A/en
Publication of JPH01200849A publication Critical patent/JPH01200849A/en
Pending legal-status Critical Current

Links

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

PURPOSE:To reduce a line cost at the time of a high traffic demand by selecting an access point through an exchange in a block area by means of a terminal, and connecting through it to a communication processing center connected fixedly. CONSTITUTION:In a block area 6 where a terminal 1 is located, access points 2 to belong to communication processing centers 3 located in plural different other block areas 6 are installed in the same block area 6 as the terminal 1. For other communication processing centers 3 to which the terminal 1 executes the communication, by selecting the access point 2 to belong to the communication processing center 3, the generating point of a transmission delay in a paths between the said other communication processing centers 3 and the terminal 1 can be reduced to one point between the access point 2 and communication processing center 3. As a result, when a traffic is high to such an extent that the installing of plural access points 2 to belong to the different communication processing centers 3 in the same block area 6 is balanced from the viewpoint of the line cost, such a network constitution is executed.

Description

【発明の詳細な説明】 〔産業上の利用分野〕 本発明は電子メール、電子掲示板サービスなどの通信処
理サービスを提供する通信処理センタ、ユーザ端末、お
よび、ユーザ端末がアクセスするアクセスポイントの３
者からなる通信処理網に関する。[Detailed Description of the Invention] [Field of Industrial Application] The present invention relates to a communication processing center that provides communication processing services such as e-mail and electronic bulletin board services, a user terminal, and an access point accessed by the user terminal.
It relates to a communication processing network consisting of people.

〔従来の技術〕[Conventional technology]

第２図は従来の通信処理網の構成図である。図において
、１は端末、２はアクセスポイント、３は通信処理セン
タ、４は通信回線、５は電話回線である。通信処理サー
ビスを提供する全体地域をいくつかの区画地域に分割す
る。（電話網の交換局は夫々の区画地域内にある。）ア
クセスポイント２と通信処理センタ３は、通常同一区画
地域内に位置する。端末ｌは電話回線５によりアクセス
ポイント２に接続され、個々のアクセスポイント２は通
信回線４により同一区画地域内の１つの特定の通信処理
センタ３に接続され、他の区画地域の通信処理センタ３
間は、通信回線４により接続され、全体で通信処理網を
構成する。FIG. 2 is a configuration diagram of a conventional communication processing network. In the figure, 1 is a terminal, 2 is an access point, 3 is a communication processing center, 4 is a communication line, and 5 is a telephone line. The entire area for which communication processing services are provided is divided into several divided areas. (Telephone network switching centers are located within each zoning area.) The access point 2 and communication processing center 3 are typically located within the same zoning area. The terminal l is connected to an access point 2 by a telephone line 5, and each access point 2 is connected by a communication line 4 to one specific communication processing center 3 in the same sub-area, and to a communication processing center 3 in another sub-area.
They are connected by a communication line 4, and together constitute a communication processing network.

従来、通信処理網を利用する場合、端末１からのトラヒ
ックは、トラヒック量が専用線を用いるほど高くないと
、電話網等の電話回線を用いて最寄りのアクセスポイン
ト２に接続し、ついで、該アクセスポイント２が所属す
る通信処理センタ３に接続し、更に該通信処理センタ３
の有するルーチング機能を用いて、希望する他の区画地
域内にある通信処理センタ３と接続して通信を行い通信
処理ができるようになっている。Conventionally, when using a communication processing network, if the traffic volume from the terminal 1 is not high enough to use a dedicated line, the terminal 1 connects to the nearest access point 2 using a telephone line such as a telephone network, and then connects to the nearest access point 2 using a telephone line such as a telephone network. Connects to the communication processing center 3 to which the access point 2 belongs, and further connects to the communication processing center 3 to which the access point 2 belongs.
By using the routing function of , it is possible to connect to a communication processing center 3 located in another desired area to perform communication and perform communication processing.

〔発明が解決しようとする課題〕[Problem to be solved by the invention]

このような場合に、通信処理網の伝送遅延を基準値以下
とするためには、アクセスポイント２と通信処理センタ
３の間、および、通信処理センタ３と他の通信処理セン
タ３相互間の２箇所に、伝送遅延が生ずるため、回線数
の増加あるいは回線速度の高速化が必要になり、回線費
用の増加を生じていた。In such a case, in order to keep the transmission delay of the communication processing network below the standard value, it is necessary to Because transmission delays occur at certain locations, it is necessary to increase the number of lines or increase the line speed, resulting in an increase in line costs.

〔課題を解決するための手段〕[Means to solve the problem]

１つの特定のＪ（ｉ処理センタ３に個々のアクセスポイ
ントを通信回線４で直結して固定的に接続させ、ユーザ
の端末１が属する区画地域に前記アクセスポイント２を
設け、前記端末１はその属する区画地域内の交換機を介
して前記区画地域６に属する前記アクセスポイント２を
選択し、該アクセスポイント２を経由して固定的に接続
された特定の前記通信処理センタに接続させた。Each access point is fixedly connected directly to one specific J(i processing center 3) through a communication line 4, and the access point 2 is provided in the divided area to which the user terminal 1 belongs, and the terminal 1 The access point 2 belonging to the divided area 6 was selected via the exchange in the divided area to which the access point 2 belonged, and was connected to the specific communication processing center that was fixedly connected via the access point 2.

〔実施例〕〔Example〕

第１図は本発明の通信処理網の構成図である。 FIG. 1 is a configuration diagram of a communication processing network according to the present invention.

図において、６は区画地域で他の記号は前出のものを使
用する。In the figure, 6 indicates the divided area, and the other symbols used above are used.

■　端末１の位置する区画地域６内に、複数の異なる他
区画地域６内に位置する通信処理センタ３に属するアク
セスポイント２を端末１と同一区画地域６内に設置する
。(2) In the divided area 6 where the terminal 1 is located, access points 2 belonging to communication processing centers 3 located in a plurality of different different divided areas 6 are installed in the same divided area 6 as the terminal 1.

■　端末１が接続を行おうとする他通信処理センタ３を
、該通信処理センタ３に属するアクセスポイント２を選
択することにより、該他通信処理センタ３と端末１との
間の径路で伝送遅延の発生箇所をアクセスポイント２と
通信処理センタ３との間の１箇所のみに減少させること
ができる。この結果、異なる通信処理センタ３に属する
複数のアクセスポイント２を同一区画地域６に設置する
ことが回線費用的に見合うほどトラヒックが高い場合に
は本発明による網構成を行う。また、異なる通信処理セ
ンタ３に属する複数のアクセスポイント２を同−区画地
域６に設置することが回線費用的に見合わないようなト
ラヒックが低い場合には、従来の網構成を行うよう、網
構成手法を選択することができるので、通信処理網の伝
送遅延を基準値以下とするために必要となる回線費用を
削減できる。■ By selecting the access point 2 belonging to the other communication processing center 3 to which the terminal 1 attempts to connect, the transmission delay in the route between the other communication processing center 3 and the terminal 1 is reduced. The number of occurrence locations can be reduced to only one location between the access point 2 and the communication processing center 3. As a result, if the traffic is so high that installing a plurality of access points 2 belonging to different communication processing centers 3 in the same divided area 6 is worth the line cost, the network configuration according to the present invention is implemented. In addition, if the traffic is so low that it is not worth the line cost to install multiple access points 2 belonging to different communication processing centers 3 in the same zone area 6, the network configuration can be changed to a conventional network configuration. Since the configuration method can be selected, the line cost required to reduce the transmission delay of the communication processing network to a reference value or less can be reduced.

第３図は通信処理センタ３とアクセスポイント２を接続
する通信回線を持った通信処理網構成法のフロー図であ
る。FIG. 3 is a flow diagram of a method for configuring a communication processing network having a communication line connecting the communication processing center 3 and the access point 2. In FIG.

■　通信処理サービスを提供する全体のエリアを、アク
セスポイントを設置するい（つかの地域に、分割する。■ The entire area where communication processing services are provided is divided into several areas where access points can be installed.

■　各地域と通信処理センタとの接続形態を仮定する。■ Assume the connection form between each region and the communication processing center.

はじめの仮定としては、各地域からいずれの通信処理セ
ンタともに、回線を設定するものと仮定する。As an initial assumption, it is assumed that a line will be set up from each region to any communication processing center.

■　メッセージ長をし、回線速度をＣ１地域ｉと通信処
理センタ１間の回線数をＸ　ｉｊ＋通信処理センタｉと
通信処理センタ１間の回線数をｙ８．。■ The message length is C1, the line speed is C1, the number of lines between area i and communication processing center 1 is X ij + the number of lines between communication processing center i and communication processing center 1 is y8. .

地域ｉと迫信処理センタｊ間のトラヒック需要を’ｉｊ
＋Ｒ＝ΣｒＢｌ　　）ラヒツク需要に基づき地域ｉから
通信処理センタｊへのリンクに割り当てられた流量をｆ
　ｉｊ＋通信処理センタｉから通信処理センタｊへのリ
ンクに割り当てられた流量をｇｉｊ＋　アクセスポイン
）ｉから通信処理センタｊへの回線費用をｕｉｊ、通信
処理センタｉから通信処理センタｊへの回線費用をＶ、
。Let 'ij be the traffic demand between region i and impending processing center j.
+R=ΣrBl ) The flow rate allocated to the link from region i to communication processing center j based on the demand is f
ij + the flow rate allocated to the link from communication processing center i to communication processing center j is gij + access point) The line cost from communication processing center i to communication processing center j is uij, and the line cost from communication processing center i to communication processing center j is V,
.

とした時、 により定められる網内平均遅延時間Ｔを一定値以下とす
る範囲で、 により定められる回数費用Ｋを最小とするように回線数
Ｘ３１．およびｙｉｊを求めた時の回線費用にの最小値
は、 となる。次に、このＫを最小とするように？ｉｉ’ｆＪ
ｆ３４．およびｇ　ｉｊを割り当て、この時の回線数お
よび回線費用を求める。流量割当の方法としては、Ｆｌ
ｏｗ　Ｄｅｖｉａｔｉｏｎ法（Ｌ、Ｆｒａｔｔａ、Ｍ、
Ｇｅｒｌａ、Ｌ。When, the number of lines x31. The minimum value of the line cost when calculating and yij is as follows. Next, how to minimize this K? ii'fJ
f34. and g ij are assigned, and the number of lines and line cost at this time are determined. As a method of flow rate allocation, Fl
ow Deviation method (L, Fratta, M,
Gerla, L.

Ｋｌｅｉｎｒｏｃｋ：Ｔｈｅ　　Ｆｌｏｗ　　Ｄｅｖｉ
ａｔｉｏｎ　　Ｍｅｔｏｄ：八ｎ　　Ａｐｐｒｏａｃｈ
　　　ｔｏ　　Ｓｔｏｒｅ−ａｎｄ−Ｆｏｒｗａｒｄ　
　ＣｏｍｍｕｎｉｃａｔｉｏｎＮｅｔｗｏｒｋ　Ｄｅｓ
ｉｇｎ”、Ｎｅｔｗｏｒｋｓ＋Ｖｏ１．３＋　ｐｐ、９
７−１３３＋１９７３）などが知られている。Kleinrock: The Flow Devi
ation Method: Eight Approach
to Store-and-Forward
Communication Network Des
ign”, Networks+Vo1.3+ pp, 9
7-133+1973), etc. are known.

■　得られた回線数を一端切り上げて整数化する。■ Round up the obtained number of lines to a whole number.

■　アクセスポイントから通信処理センタまでの各回線
のうち、使用率の低い回線について、回線数の削減可能
なものを調べ、回線数が削減できるものについては、回
線数を削減した場合の回線費用を算出する。■ Among the lines from the access point to the communication processing center, examine which lines with low usage rates can be reduced, and if the number of lines can be reduced, calculate the line cost if the number of lines is reduced. calculate.

■　アクセスポイントから通信処理センタまでの各回線
のうち、使用率の低い回線について、アクセスポイント
の近くの通信処理センタから経由させることとする。■ Among the lines from the access point to the communication processing center, the lines with low usage rates will be routed through the communication processing center near the access point.

■　以上を繰り返して得られる回線費用の算出結果を比
較し、最も回線費用が少ない時の通信処理センタとアク
セスポイントとの接続構成を最適な網構成とする。■ Compare the line cost calculation results obtained by repeating the above steps, and determine the optimal network configuration for the connection between the communication processing center and the access point when the line cost is the lowest.

第４図は前記１ｍ信処理網構成法の手法を適用した通信
処理網の構成図である。図において、７．８は通信処理
センタ、１１．１２．１３．１４はアクセスポイントで
ある。適用例では２つの通信処理センタ７と８と、４つ
のアクセスポイント（区画地域）がある。FIG. 4 is a configuration diagram of a communication processing network to which the 1-meter communication processing network configuration method is applied. In the figure, 7.8 is a communication processing center, and 11.12.13.14 is an access point. In the application example, there are two communication processing centers 7 and 8 and four access points (divided areas).

第５図は通信処理センタ７．８と各アクセスポイントの
間の回線費用の図である。FIG. 5 is a diagram of line costs between the communication processing center 7.8 and each access point.

第４図の例について、上記手法によりＬ／Ｃ＝０．２５
、Ｔ＝１．０として求めた回線費用の比較を示す。この
通信処理網において、各区画地域に在るアクセスポイン
トから各通信処理センタ７と８に対するトラヒック需要
ｒｉｊが一様としたときに、トラヒック需要Ｒに対する
回線費用にの変化を、端末により経路選択を行った場合
と、通信処理センタにより経路選択のみを行った場合と
について比較した。その結果を第６図は回線費用対トラ
ヒック関係図に示す。図に示すようにトラヒックの高い
領域では、通信処理センタによる径路選択を行ったほう
が費用が廉くなるが、トラヒックの低い領域では、端末
による径路選択を行ったほうが費用が廉くなる。For the example in Figure 4, L/C = 0.25 by the above method.
, a comparison of line costs obtained with T=1.0 is shown. In this communication processing network, when the traffic demand rij from the access point in each divided area to each communication processing center 7 and 8 is uniform, the change in line cost with respect to the traffic demand R is calculated by the route selection by the terminal. A comparison was made between the case where the communication processing center performed the route selection and the case where only the route selection was performed by the communication processing center. The results are shown in the line cost vs. traffic relationship diagram in FIG. As shown in the figure, in areas with high traffic, it is cheaper to have the communication processing center select the route, but in areas with lower traffic, it is cheaper to select the route by the terminal.

次ぎに、端末よるアクセスポイントの選択の実施例につ
いて述べる。Next, an example of access point selection by a terminal will be described.

ユーザ端末から通信処理センタにメツセージを送受信す
るときの送受信相手となる、メールボックス、掲示板等
の識別のための番号体系として、識別番号の上位数桁を
メツセージを送受信する相手先の通信処理センタに対応
させたものにする。As a numbering system for identifying the mailbox, bulletin board, etc. that is the destination when sending and receiving messages from the user terminal to the communication processing center, the first few digits of the identification number are sent to the communication processing center of the destination. Make it compatible.

第７図は本発明に使用する番号の図である。図において
、１５は送信先識別番号、１６は通信処理センタ番号、
１７はアクセスポイント番号である。端末からメツセー
ジを送受信して通信処理網にアクセスするため、アクセ
スポイントとの接続を行う際に、アクセスポイントの電
話番号の索引を行う。すなわち、まず送受信光識別番号
１５から、その上位数桁を抽出して、送受信光の属する
通信処理センタ番号１６を求める。次に、アクセスポイ
ントの電話番号を通信処理センタ番号に対応させて記述
したテーブルを、求めた通信処理センタ番号１６により
索引して、この通信処理センタに接続されているアクセ
スポイント番号１７を得る。このようにして得られたア
クセスポイント番号１７を、電話機を介してアクセスポ
イントへの接続を行うときに送出すれば、端末により送
受信相手の属する通信処理センタを選択する経路選択が
できる。FIG. 7 is a diagram of the numbers used in the present invention. In the figure, 15 is a destination identification number, 16 is a communication processing center number,
17 is an access point number. In order to send and receive messages from the terminal and access the communication processing network, when connecting with the access point, the telephone number of the access point is indexed. That is, first, the most significant digits are extracted from the transmitting/receiving light identification number 15 to obtain the communication processing center number 16 to which the transmitting/receiving light belongs. Next, a table in which telephone numbers of access points are written in correspondence with communication processing center numbers is indexed by the obtained communication processing center number 16 to obtain the access point number 17 connected to this communication processing center. By transmitting the access point number 17 obtained in this way when connecting to the access point via the telephone, the terminal can select a route to select the communication processing center to which the transmitting/receiving party belongs.

〔発明の効果〕〔Effect of the invention〕

以上説明したように、本発明による通信処理網を構成す
ると伝送基準値以下とするように定められた通信処理網
において、高いトラヒック需要がある時の回線費用を削
減できる。As described above, by configuring a communication processing network according to the present invention, it is possible to reduce line costs when there is high traffic demand in a communication processing network that is determined to be below a transmission reference value.

【図面の簡単な説明】[Brief explanation of the drawing]

第１図は本発明の通信処理網の構成図、第２図は従来の
通信処理網の構成図、第３図は通信処理センタとアクセ
スポイントを接続する通信回線を持った通信処理網構成
法のフロー図、第４図は前記通信処理網構成法の手法を
適用した通信処理網の構成図、第５図は通信処理センタ
とアクセスポイントの間の回線費用の図、第６図は回線
費用対トラヒック関係図、第７図は本発明に使用する番
号の図である。 １は端末、２はアクセスポイント、３は通信処理センタ
、４は通信回線、５は電話回線、６は区画地域、７．８
は通信処理センタ、１１．１２．１３．１４はアクセス
ポイント、１５は送信先識別番号、１６は通信処理セン
タ番号、１７はアクセスポイント番号 特許出願人　　日本電信電話株式会社 代理人　　弁理士　玉　轟　久五部 （外２名） 本発明の通信処理網の構成図 第１図 従来の通信処理網の構成図 第　２　図 通信処理網の構成図 第　４　口 通信処理ｇ！ｌ構戒法のフロー図 第３図 冒　　　１ｑ 池Fig. 1 is a configuration diagram of a communication processing network according to the present invention, Fig. 2 is a configuration diagram of a conventional communication processing network, and Fig. 3 is a communication processing network configuration method having a communication line connecting a communication processing center and an access point. 4 is a configuration diagram of a communication processing network to which the above communication processing network configuration method is applied, Fig. 5 is a diagram of line costs between a communication processing center and an access point, and Fig. 6 is a line cost diagram. The traffic relation diagram, FIG. 7, is a diagram of numbers used in the present invention. 1 is a terminal, 2 is an access point, 3 is a communication processing center, 4 is a communication line, 5 is a telephone line, 6 is a divided area, 7.8
11.12.13.14 is the communication processing center, 11.12.13.14 is the access point, 15 is the destination identification number, 16 is the communication processing center number, 17 is the access point number Patent applicant Nippon Telegraph and Telephone Corporation Agent Patent attorney Hisashi Tama Todoroki Five departments (two others) Figure 1: Configuration diagram of the communication processing network of the present invention Figure 2: Configuration diagram of the conventional communication processing network Figure 2: Configuration diagram of the communication processing network 4: Communication processing g! Flowchart of the Kaikaiho Figure 3: 1q Pond

Claims (1)

【特許請求の範囲】 １つの特定の通信処理センタに個々のアクセスポイント
を通信回線で直結して固定的に接続させ、端末が属する
区画地域に前記アクセスポイントを設け、 前記端末はその属する区画地域内の交換機を介して前記
区画地域に属する前記アクセスポイントを選択し、該ア
クセスポイントを経由して固定的に接続された特定の前
記通信処理センタに接続することを特徴とする通信処理
網。[Scope of Claims] Each access point is directly and fixedly connected to one specific communication processing center via a communication line, and the access point is provided in a divided area to which a terminal belongs, and the terminal is located in a divided area to which it belongs. The communication processing network is characterized in that the access point belonging to the divided area is selected via an exchange within the area, and the communication processing network is connected to the specific communication processing center fixedly connected via the access point.
JP63025351A 1988-02-05 1988-02-05 Communication processing network Pending JPH01200849A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP63025351A JPH01200849A (en) 1988-02-05 1988-02-05 Communication processing network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP63025351A JPH01200849A (en) 1988-02-05 1988-02-05 Communication processing network

Publications (1)

Publication Number Publication Date
JPH01200849A true JPH01200849A (en) 1989-08-14

Family

ID=12163444

Family Applications (1)

Application Number Title Priority Date Filing Date
JP63025351A Pending JPH01200849A (en) 1988-02-05 1988-02-05 Communication processing network

Country Status (1)

Country Link
JP (1) JPH01200849A (en)

Similar Documents

Publication Publication Date Title
RU2143183C1 (en) Method for administration of network computer applications and device which implements said method
AP2000001748A0 (en) Method and system for processing calls.
DE60042788D1 (en) ROUTING IN AN IP NETWORK BASED ON THE CODE AVAILABILITY AND PREFERENCE OF THE PARTICIPANT
JPH04291858A (en) Mail center managing system
MXPA03008479A (en) Shared dedicated access line (dal) gateway routing discrimination.
US8180039B2 (en) Methods, systems, and computer program products for routing calls based on the originating network
CN1105499A (en) Routing to intelligence
JPH06245259A (en) Small-sized radio communication system
GB2344719A (en) A method of minimizing the cost of a call through a network of interconnected private branch exchanges (PBXs) using least cost routing (LCR)
CN100349473C (en) Method and system for realizing short message intercommunication based on mixed telephone number
JPH0879168A (en) Multi-address communication system in mobile communication
CN101378540B (en) Method and system for implementing number portability business, and number portability data-base
JPH01200849A (en) Communication processing network
RU2003127080A (en) METHOD FOR CARRYING OUT CONTROL MEASURES IN PACKET TELECOMMUNICATIONS NETWORKS AND DATA TRANSFER NETWORKS
JPH03235562A (en) Calling area identification system
Jafari et al. Blocking probability in two-way distributed circuit-switched CATV
JPS62180637A (en) Centralized maintenance operating system for data exchange network
Nakamura et al. On a hybrid network system of circuit switching and packet switching
US6732174B1 (en) Apparatus and method of establishing a call using wireless and wireline integration through a telecommunication switch
JPH01137760A (en) Incoming call rejection system
Chlamtac et al. Differential service in high-speed interconnection systems: an algorithm for prioritized access
JP3036859B2 (en) Automatic routing table creation method for exchanges
CN100359871C (en) Outgoing net call center
RU95119504A (en) METHOD FOR DISTRIBUTING INFORMATION FLOWS IN DATA EXCHANGE SYSTEMS
JPH04133529A (en) Communication route selecting system