| 序号 | 专利名 | 申请号 | 申请日 | 公开（公告）号 | 公开（公告）日 | 发明人 |
|---|---|---|---|---|---|---|
| 101 | Packet transfer apparatus | JP2004187224 | 2004-06-25 | JP2006013827A | 2006-01-12 | NAKAJIMA ATSUSHI; MIYATA HIROAKI; SHIMIZU SHINSUKE; OTA MIGAKU |
| <P>PROBLEM TO BE SOLVED: To provide a packet transfer apparatus easily and surely carrying out registration, update, and deletion of a cross-reference between an IP address and a domain name of a terminal (H) to/from a DNS server (7) in a communication system wherein the terminal (H) is connected to the Internet (NW 3) via an ISP network (NW 2) by using an L2TP tunnel (T1S1) built up in an access network (NW 1). <P>SOLUTION: Upon the receipt of a connection authentication request from a host (H), the packet transfer apparatus transmits a host ID and host password information (information required for authentication) included in the request to an authentication server (6), acquires IP address information for the host (H) from the authentication server (6), and informs a DNS server (7) about the IP address information and domain name information of the host (H) registered in advance. <P>COPYRIGHT: (C)2006,JPO&NCIPI | ||||||
| 102 | Network access in a multi-service environment | JP53801398 | 1998-02-25 | JP3713280B2 | 2005-11-09 | スキレン・リチャード・プレスコット; フォクサネアヌ・ミハイ; リバーモア・フレデリック・カルドウエル |
| 103 | Allocation system of international relay call | JP33234794 | 1994-12-14 | JP3593165B2 | 2004-11-24 | ティー．ペイ エリック |
| 104 | Communication network control device | JP32567394 | 1994-12-27 | JP3423093B2 | 2003-07-07 | 凱丞 井上 |
| 105 | Traffic routing in a small wireless data network | JP2000545275 | 1999-04-20 | JP2002512479A | 2002-04-23 | トーマス， マイケル スティラー，; ウィリアム， エドワード ステファンズ，; ニーシャ， ポーリン ニューマン， |
| (57)【要約】 無線ネットワークのノード（１０）で、ルート識別子とルート更新メッセージが添付された受信データを中継する方法であって、受信メッセージデータ（３４）に添付されたルート更新メッセージに基づいてルートテーブルを更新し、ルートテーブル（４４）に基づく近傍ノードを選択し、更新されたルートテーブル（４８）に基づいてルート識別子とルート更新メッセージを置き換え、置き換えられたルート識別子と置き換えられた更新メッセージを添付したメッセージデータを近傍ノード（５０）に転送する。 | ||||||
| 106 | Speech path management method and mobile communication system of the mobile communication system | JP17306893 | 1993-07-13 | JP3260011B2 | 2002-02-25 | 信也 伊住 |
| When a base station of a digital radiotelephone system receives, through a circuit interface unit of the base station, a call setup message for a radio subordinate unit from a radio control station, an incoming call signal is transmitted to the radio subordinate unit through a radio interface unit of the base station, under control of a control unit of the base station, without performing an acquisition of a circuit communication channel between the radio control station and the base station. Thereafter, when a radio link setup message, an incoming call response, a call proceeding message or an authentication response message is provided by the radio subordinate unit, it is known that the radio subordinate unit is present in a radio area of the base station, and the circuit communication channel is acquired under the management of a communication channel management of the base station. Therefore, even when many incoming call signals are concentrated at the base station, a circuit communication channel can be reliably and efficiently acquired. | ||||||
| 107 | Call routing system | JP28226992 | 1992-09-29 | JP2957052B2 | 1999-10-04 | JERARUDO RICHAADO ATSUSHU; JINNSHI CHEN; ARAN YUUJIN FUREI; DEUITSUDO EFU MAKUGIGAN |
| 108 | Signal link selecting method for common line signal system and exchange applying the same | JP28636697 | 1997-10-20 | JPH11122365A | 1999-04-30 | NISHI MASAHIKO; FUJII SHINJIRO |
| PROBLEM TO BE SOLVED: To set the number of signal links more than a number corresponding to the bit length of determined signal link selection(SLS) without changing the SLS by selecting the signal link based on the synthetic data of the SLS on the routing label of a message signal and extension SLS. SOLUTION: When transmitting the message signal from a terminal station SEP-a to terminal stations SEP-b and SEP-c, an incoming station code (DPC) on the routing label is different. Therefore, even when the SLS on the routing label is the same code, by utilizing the DPC as the extension SLS, the load of signal traffic can be further distributed corresponding to an incoming station to which the message signal is transmitted. When one low-order bit of the DPC is utilized as the extension SLS, for example, a repeater station STP-B selects the signal link from the SLS composed of 4 bits on the routing label of the received message signal and the code of 5 bits composed of one low-order bit of the DPC. | ||||||
| 109 | Call center system making automatic call distribution through use of public network | JP28506497 | 1997-10-17 | JPH11122358A | 1999-04-30 | HARUTA KAZUNARI |
| PROBLEM TO BE SOLVED: To transfer an incoming call from a public network to another ACD system and a home agent via the public network by utilizing the incoming call transfer service served by the public network without the use of a leased line and a transfer function of a PBX. SOLUTION: A route table 110 stores one control step or ever that controls an automatic call distribution(ACD) procedure with respect to an incoming call. A transfer destination telephone number table 111 stores information to decide a transfer destination telephone number. A call control section 104 decides the transfer destination telephone number with respect to the incoming call by referencing the transfer destination telephone number table 111 when a control step on the route table 110 executed at the reception of the incoming call is a transfer control step indicating transfer of the incoming call, and transfers the incoming call to the transfer destination telephone number by using the incoming call transfer service served by the public network connecting to the public line 102. | ||||||
| 110 | Routing control method | JP30025293 | 1993-11-30 | JP2856050B2 | 1999-02-10 | SUPIIGERU IISAN; MURASE TSUTOMU |
| In a connection-oriented communications network, a source node selects one of first and second routing mode flags and a first route to a destination node in response to a connection request, and establishes a connection to a first intermediate node located along the first route. The first intermediate node is responsive to the first flag for extending the connection along the first route if there is an acceptable link in the first route. If there is no acceptable link, it finds a first route section therefrom to the destination node and extends the connection along the first route section if a total cost of links from the source node to the destination node using the first route section is less than a cost threshold, or cranks the connection back to an upstream node if there is none of such route sections. The upstream node then finds a second route section if a total cost of links from the source node to the destination node using the second route section is less than the cost threshold and extends the connection from the upstream node to a second intermediate node along the second route section, or clears the connection if there is none of the such route sections. On clearing the connection, the source node may or may not select the other flag. In either case, it selects a second, alternate route to the destination node and establishes a connection to a third intermediate node along the second route. If the flag is set to the first mode, the third intermediate node operates in the same manner as the first intermediate node does, and if the flag is set to the second mode, it extends the connection along the second route if there is an acceptable link. Otherwise, it clears the connection if there is no acceptable link and communicates this fact to the source node. | ||||||
| 111 | Communication exchange system and its control method | JP35773892 | 1992-12-25 | JP2828856B2 | 1998-11-25 | BURUUSU MERIRU BEERUZU; ROBAATO RUISU KURANPURII; SANDORA SUU NOOSU; SUTEFUAN MATSUKUSU SHIIRAA |
| 112 | Route selection method of Pbx tenant services | JP17352290 | 1990-06-29 | JP2816385B2 | 1998-10-27 | 孝保 小林; 勉 嶋末 |
| 113 | Method for inquiry as to copy data base and network utilizing this method | JP6693198 | 1998-03-17 | JPH10283236A | 1998-10-23 | KHOSRAVI-SICHANI BAHMAN; MINTZ DONALD JAY; RATCLIFFE MARK A |
| PROBLEM TO BE SOLVED: To provide the method and network of high reliability which are capable of uniform load distribution of inquiry among plural data bases including common software and information. SOLUTION: A round robin routing table 300 is used which includes an index 302, a station number 304, and a sub-system number 306 of each copy data base. For example, an exchange successively increments the index to search in the round robin routing table 300. If the data base corresponding to the index cannot be accessed, it is incremented to the next index to search a data base which can be accessed. When a data base which can be accessed is found, the station number is set to the address of this data base, and an inquiry is transferred to this address. COPYRIGHT: (C)1998,JPO | ||||||
| 114 | Connection of local and toll telephone call in competitive environment | JP26891795 | 1995-10-18 | JPH08214059A | 1996-08-20 | AKINUEIRU ADEMOA AKINPERU; PUROMODO KUMAA BUHAGATSUTO; DANA RII GAROUTSUTE; ANSONII HATATSURA; ROBAATO BURUUSU HATSUSHIYU; ARI ETSUCHI KURISUTO; JIEEMUSU BENFUOODO SHIEPAADO; DOROSHII BUI SUTANREE; SEODOA RUISU SUTAAN |
| PROBLEM TO BE SOLVED: To highly economically improve portability by connecting telephone customers by identifying the customers by means of the local areas of the customers and local interexchanger carriers for telephone number lists of a whole country having universal data bases. SOLUTION: Telephone customers 1-5 are connected respectively through switches 17, local interexchanger carriers 6-10 provided with local universal data bases 18 having telephone numbers of local areas, etc., and national universal data bases 11-13 for whole-country telephone number list. In addition, since the mostly frequently using customer 1, etc., is connected to the carrier 6 and the substitutional carrier 7, the geographical number portability and service provider number portability to the telephone customers can be improved with an economic constitution. COPYRIGHT: (C)1996,JPO | ||||||
| 115 | Variable length data exchange, variable length data terminal housed in the same, and system and method for variable length data communication | JP30407494 | 1994-12-07 | JPH08163174A | 1996-06-21 | SHIRAI NOBUO; KURISUYA HIROYUKI; SONE YUKIO |
| PURPOSE: To suppress the generation of congestion and to suppress frame deletion when the congestion occurs as for a variable length data exchange and its method suitable for a communication system in which the congestion is easy to occur by fast communication in a frame relay network, etc. CONSTITUTION: This variable length data exchange 7 which houses plural variable length data terminals 1 via a terminal line 2 is provided with a congested state detecting means 6 which detects a congested state on a reference relay line 3. Also, a relay line control means 5 is provided with a first bypass control means 5-1 to control data to be transferred so as to be transferred by bypassing by using a backup relay line 4 based on detection information from the congested state detecting means 6. | ||||||
| 116 | Personal number communication system | JP50723394 | 1993-08-24 | JPH08503107A | 1996-04-02 | クラウス、エヴァン; ジェイ． スメッツ、レイマンド; デュランド、テリー; アール． バーク、ローレンス; ジョウゼフ モッキン、トーマス; スィー． ユエ、ドリーナ |
| (57)【要約】 個人番号通信システムは各加入者に個人番号を設定し、日および曜日の時間に基づいて、一以上の送信先序列リストの形態で、各加入者から通信中継情報を受け取る。 リストの序列および構成は変更可能であり、また、特定の送信先への通信を選択実行するべく優先することが可能である。 システムは加入者の個人番号に送られた通信を受け取って、その通信源を認識する。 この認識は呼出回線認識情報、呼出者の個人用リスト、若しくは、通信源認識情報により実行できる。 システムは上記序列リストから通信における第一の送信先を選択できる。 この第一送信先において、システムは認識された通信源に通知して、通信に対する容認、形式的拒絶または不応答等の非形式的拒絶についての処理情報を要求する。 もしも容認すれば、システムは通信を第一送信先に中継する。 また、拒絶すれば、システムは通信を加入者により選択される不履行の送信先に中継する。 さらに、非形式的拒絶の場合は、システムは加入者により選択される序列に従って送信先リストにおける次の送信先から通信処理情報を要求する。 而して、通信が容認されるまで、あるいは、送信先リストにおける最後の送信先への到達、すなわち、地点において通信が最後の送信先に中継されるまで、システムは送信先リスト上の一連の送信先の各々から通信処理情報を継続して要求する。 | ||||||
| 117 | Transmission channel selection system by destination address | JP11075294 | 1994-05-25 | JPH07321846A | 1995-12-08 | SHINOHARA TAKAHIRO |
| PURPOSE: To effectively use an ISDN line in a communication system using an ISDN as a WAN for LAN-WAN connection. CONSTITUTION: In an ISDN terminal adaptor 1, a CPU 4 interprets a destination address received from a gateway device 2. A sending channel(B or D) is decided from a content set on a setting part 5 in advance, and a channel B6 of line switching mode is used for a packet requiring a fast response, and a channel D7 of packet switching mode for the packet other than that. COPYRIGHT: (C)1995,JPO | ||||||
| 118 | Exchange and its alternative routing method | JP10298694 | 1994-05-17 | JPH07312766A | 1995-11-28 | ITO KIYOTSUGU |
| PURPOSE: To conduct an alternative routing according to a alternative scenario composed by a maintenance terminal equipment upon the request of the user in an exchange having an alternative function. CONSTITUTION: A maintenance personnel receives an alternative scenario from a maintenance terminal equipment 3, in which the scenario is converted into an operation form of the exchange and transferred to an exchange CPU 1. The exchange CPU 1 stores the alternative scenario from a maintenance terminal equipment interface 6 to an alternative scenario operation device 7. Upon the notice of a line fault and congestion, the alternative scenario execution device 7 composes a basic connection command to a basic connection controller 8 according to the alternative scenario to conduct alternative routing. COPYRIGHT: (C)1995,JPO | ||||||
| 119 | Call routing system | JP28226992 | 1992-09-29 | JPH07170327A | 1995-07-04 | JIERARUDO RICHIYAADO ATSUSHIYU; JINNSHI CHIEN; ARAN YUUJIN FUREI; DEBUITSUDO EFU MAKUGIGAN |
| PURPOSE: To improve a communication switching technique by assigning several parameters common to all the services of each class, and discriminating the services of different classes by each parameter value. CONSTITUTION: A telephone call processed by a network 200 is accompanied with the service COS of each class, and each service is defined by a parameter group. The parameter group accompanied with each COS is constituted of service identification information SI, transfer capability TC, routing pattern identification information RPI, and circuit selection identification information CSI. The values of the SI and TC calculated for an input call are converted into another parameter RPI. This conversion is operated by using a table for converting the combination of the SI with the TC into the specific RPI. The RPI value designates a routing processing applied to the accompanied input call. This processing is defined as blocking in a specific level, and a routing priority, data speed, and traffic data register. COPYRIGHT: (C)1995,JPO | ||||||
| 120 | Routing control method | JP30025293 | 1993-11-30 | JPH07154420A | 1995-06-16 | SUPIIGERU IISAN; MURASE TSUTOMU |
| PURPOSE: To provide both the high speed connection setting and the path of an approximately minimum cost by specifying steps where a connection setting request packet reaches from a source node to an objective node. CONSTITUTION: When the connection setting request is blocked, an intermediate node before its link obtains a new path from the routing table of the intermediate node so that the cost from the source node to the objective node is lower than a cost threshold D entered in the connection request packet. If this new path doesn't exist and the number of times of turning-back of the connection setting request packet is smaller than a turning-back threshold G, the connection setting request packet is turned back and sent to the node just preceding the intermediate node. The cost threshold D and the turning-back threshold G are used again or calculation is performed again to obtain a new path so that the already blocked link is not included. COPYRIGHT: (C)1995,JPO | ||||||
QQ群二维码
意见反馈
意见反馈