WO2008072667A1 - 電気通信網、ネットワーク・ノード装置及びルーティング方法 - Google Patents
電気通信網、ネットワーク・ノード装置及びルーティング方法 Download PDFInfo
- Publication number
- WO2008072667A1 WO2008072667A1 PCT/JP2007/073962 JP2007073962W WO2008072667A1 WO 2008072667 A1 WO2008072667 A1 WO 2008072667A1 JP 2007073962 W JP2007073962 W JP 2007073962W WO 2008072667 A1 WO2008072667 A1 WO 2008072667A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- network
- routing
- character code
- reception point
- code
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/54—Organization of routing tables
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L2101/00—Indexing scheme associated with group H04L61/00
- H04L2101/30—Types of network names
- H04L2101/365—Application layer names, e.g. buddy names, unstructured names chosen by a user or home appliance name
Definitions
- Telecommunications network network node device and routing method
- the present invention relates to a telecommunications network in which a plurality of network nodes are connected to each other.
- the present invention relates to a route selection technique in a network node device.
- connection control is performed using a telephone number that is a decimal number.
- the node device on the network performs a routing process for selecting a route by using a telephone number as a destination identifier.
- a node device performs a routing process using a binary IP address as a destination identifier.
- the routing information network layer address information
- route information such as the interface number and address of the destination node device corresponding to the destination identifier is referred to.
- a user designates a character code (alphanumeric character or the like) representing a domain name as a destination.
- a character code alphanumeric character or the like
- an IP address corresponding to the character code (domain name) is acquired, and the acquired IP address is used as a destination identifier.
- the character code representing the domain name is converted into an IP address, it is a destination identifier of “indirect” routing information.
- DNS Domain Name Service
- the routing system using DNS has a special purpose of searching the conversion database (DB) to convert the destination URL (Uniform Resource Locator) address to an IP address before routing.
- DB conversion database
- URL Uniform Resource Locator
- DNS is used to convert a character code.address representing a domain name into an IP address (numerical code.address), and a routing process is performed based on the IP address.
- IP address number of IP addresses
- a system for converting character code 'address and numerical code' addresses and a system for managing routing information using these two types of codes are required. Constructing such a system on a telecommunications network leads to an increase in the size and complexity of the communication system.
- An object of the present invention is to provide a telecommunication network, a network 'node device, and a routing method capable of solving the above-described problems and performing path selection without causing an increase in scale and complexity of a communication system. There is to do.
- the telecommunications network of the present invention is a telecommunications network comprising a plurality of network nodes, wherein each of the plurality of network nodes is a character code designating a final reception point. And a route selection means for selecting a route from its own network node to the final reception point.
- the network 'node device of the present invention is a network' node device that constitutes a telecommunication network together with other network 'nodes, and directly transmits a character code that designates a final reception point. It is characterized by having route selection means for selecting a route from the network node to the final reception point.
- the routing method of the present invention is a routing method performed in a network 'node device that constitutes a telecommunication network together with another network' node, and directly uses a character code that designates a final reception point. A route is selected from the network node to the final reception point.
- the present invention provides a network for realizing a routing system that does not perform numerical conversion.
- the routing process at each node in the (network) is performed directly using character codes. For this reason, in the present invention, a table that can be searched by a character code is provided at each node. Accordingly, in the present invention, it is possible to perform routing (route selection) directly with character code information without performing numerical conversion of character codes with DNS.
- FIG. 1 is a block diagram showing a configuration of a telecommunications network according to a first embodiment of the present invention.
- FIG. 2 is a block diagram showing a configuration of a network node in FIG.
- FIG. 3 is a diagram showing a configuration example of a routing table in FIG. 2.
- FIG. 4 is a flowchart showing a procedure of routing processing performed in the telecommunications network according to the first embodiment of the present invention.
- FIG. 5 is a block diagram showing the configuration of a network node according to the second embodiment of the present invention.
- FIG. 6 is a diagram showing a configuration example of the binary routing table of FIG.
- FIG. 7 shows a routing process performed in the telecommunication network according to the second embodiment of the present invention. It is a flowchart which shows one procedure.
- FIG. 8 is a block diagram showing a configuration of a telecommunications network according to a third embodiment of the present invention. Explanation of symbols
- FIG. 1 is a block diagram showing a configuration of a telecommunications network according to the first embodiment of the present invention.
- the telecommunications network 100 is composed of a plurality of interconnected networks' node 1
- Network 'Number of nodes and connection form can be changed as appropriate.
- Network 'nodes 1-1-1-7 have the same configuration.
- FIG. 2 shows the configuration of network nodes used as the network nodes 1 1 to 17.
- the network 'node 1 includes an input line 11—1 to 11—m, a routing switching unit 12, an output line 13— ;! to 13—n, and a routing table 14 And have.
- Each of the input lines 11 11-m receives a data packet from the network 'node to which it is connected, and routes the received data packet to the switching unit.
- a character code' address that is information specifying the final reception point is stored as a destination identifier.
- the character code is one of the encoding methods and is a character code represented by a certain ASCII (American standard Code for Iniormation Interchange).
- ASCII American standard Code for Iniormation Interchange
- the character code 'address may have a fixed or variable code length. However, the maximum code length is limited by the header size of the data packet. The maximum code length is 100 bytes, for example.
- ASCII code the character code 'address code
- the character code 'address code indicating the end of the address is inserted after the character code' address. For example, if the character code 'address is 80 bytes, enter the code that indicates the end of the character code' address after 81 bytes. By detecting this code, it is possible to identify the character code 'address from the header information of the data' packet with the power S.
- Routing When the switching unit 12 receives a received data packet from one of the incoming lines 11 1 to 11 111, it searches for the character code and address stored in the header of the received data packet.
- the routing table 14 is searched as an identifier for use.
- the routing 'table 14 stores information indicating the correspondence between the search identifier (character code' ⁇ address) and the output lines 13-1 to 13n.
- the routing 'switching unit 12 determines an output line from the output lines 13— ;! to 13—n based on the search result, and outputs a received data packet to the determined output line.
- FIG. 3 is a diagram showing a configuration example of the routing table 14 shown in FIG. In Fig. 3, the routing table 14 shows the character code address ("# 1", ⁇ "#N") and the corresponding output line ("5", ⁇ , "16"). The associated information is accumulated. As a search method using this routing table 14, for example, there are the following first to third search methods.
- the first search method is a method in which the character code 'address from the beginning of the routing' table 14 is compared one entry at a time until a match is found.
- the second search method uses a hash function. Specifically, by passing the search character code through the hash function, the “position” of the character code 'address on the routing table 14 is obtained as the return value of the hash function. This return value is used to read the routing table and determine the output line.
- the third search method is to place the routing 'table 14 in the CAM (associative memory) and perform a search.
- Character code for searching ' ⁇ This is a method for the CAM to output the output line by throwing the address to the CAM.
- Each network 'node ;!;! 1-7 includes a routing table 14 in which correspondence information between search identifiers and output circuits is stored as shown in FIG.
- the routing table 14 is provided in each network node 11 to 17 so as to correspond to the input line.
- FIG. 4 is a flowchart showing one procedure of the routing process.
- the routing switch unit 12 receives a data packet from any one of the input lines 11 1;! To 11-m (step S 10).
- the routing' switch unit 12 extracts the character code 'address from the header of the received data' packet (step S11).
- the routing 'switch unit 12 uses the character code' address as a search identifier to search the routing table 14 to obtain output line information, and outputs the output line 13— ;! to 13—n.
- the output line to which the received data packet is to be transmitted is determined (step S12).
- the routing 'switch unit 12 transmits the received data' packet through the determined output line (step S 13).
- the routing processing power S described above is executed in all nodes on the route including the final destination node.
- the character code 'address (character code information) that designates the final reception point as a destination is directly used as routing information.
- the process of converting character code information to numerical code information, such as processing, is unnecessary. Therefore, if only the character code information is managed as the routing information, it is not necessary to manage the numerical code information, so the scale of the communication system can be reduced and the system configuration can be simplified.
- each of the network 'nodes 1-1 to 1-7 has a routine by exchanging information necessary for routing using character codes with other network' nodes.
- FIG. 5 is a block diagram showing a configuration of a network node constituting the telecommunication network according to the second embodiment of the present invention.
- the network 'node 2 shown in Fig. 5 is configured in such a way that the routing' switching unit 21 can search the routing table 14 and binary routing table 22 '.
- the configuration is the same as 1.
- the same components as those shown in FIG. 2 are given the same reference numerals as those used in FIG.
- network 'node 2 is input line 11-1 to 11-m, routing' table 14, binary routing 'table 22, routing' switching unit 21, and output line 13—;! To 13—n. Routing 'When the switching unit 21 receives a data' packet through any of the input lines 11;! ⁇ 11—m, the routing by the character code 'Search the table 14 or the binary routing by the numeric code' The table 22 is searched to determine the output line from among the output lines 13— ;! to 13—n.
- FIG. 6 is a diagram showing a configuration example of the binary routing table 22 shown in FIG.
- the routing table 22 shows the binary address ("# 1", ... "#N") and the corresponding output line ("5", ..., "16"). Is stored associating information
- the telecommunication network of the present embodiment also includes a plurality of network 'nodes 1-1 to 1-7 connected to each other like the telecommunication network 100 shown in FIG.
- the network 'nodes 1-1-1-7 have the same configuration as the network' node 2 shown in FIG.
- the number of network 'nodes and topology can be changed as appropriate.
- FIG. 7 is a flowchart showing a procedure of the routing process.
- the routing switch unit 21 receives a data packet from any one of the input lines 11— ;! to 11—m (step S20). When data 'packets are received, 1
- the switching unit 21 extracts the code address from the header of the received data packet (step S21), and checks whether the code address is a routing based on the character code or numerical code (step S22). ).
- the routing switch unit 21 retrieves the output line information by searching the table 14 with the character code' routing using the address as a search identifier '.
- the output line to which the received data packet is to be transmitted is determined from among the output lines 13— ;! to 13—n (step S23). Then, the routing 'switch unit 21 transmits the received data' packet through the determined output line (step S24).
- the routing switch 21 searches the numeric code' routing using the address as a search identifier 'table 22 to obtain output line information.
- the output line to which the received data packet is to be transmitted is determined from among the output lines 13— ;! to 13—n (step S25). Then, the routing 'switch unit 21 transmits the received data' packet through the determined output line (step S26).
- the routing processing power S described above is executed in all nodes on the route including the final destination node.
- the telecommunications network of the present embodiment it is possible to cope with existing routing using numerical codes in addition to routing using character codes. Therefore, in addition to the effects described in the first embodiment, the telecommunications network of the present embodiment can be easily applied to an existing telecommunications network in which only routing using numerical codes is performed. In addition, there is an effect that the power S can be easily transferred from the existing telecommunications network to the telecommunications network of the present embodiment.
- FIG. 8 is a block diagram showing a configuration of a telecommunications network according to the third embodiment of the present invention.
- the telecommunications network of the present embodiment includes a first telecommunications network composed of mutually connected nodes 1o, 1-p, and mutually connected nodes 1-q, 1—the second consisting of r
- the first and second telecommunication networks are IP networks as relay sections.
- the number of network nodes and the connection form can be changed as appropriate.
- Nodes 1—o to l—r are all nodes that can be routed by the character code 'address. Nodes 1 o and 1 r have the same configuration as the network 'node 1 shown in FIG. 2 or the network' node 2 shown in FIG.
- Nodes 1p and 1-q are basically different in force S, which is the same configuration as nodes 1o and 1-r, and part of the routing process.
- the routing table provided in the nodes 1p and 1-q is a table in which the IP address information added to the header is added to the output line information in the routing table shown in FIG.
- the nodes 1p and 1-q have a routing table that stores information indicating the correspondence between the character code, address, output line, and IP address.
- the routing process described in the embodiment is performed.
- the IP network 100 is interposed between the nodes 1-p and 1-q. In this section, the following routing processing is performed by the routing switch on nodes 1p and l-q.
- the routing' switch part searches the routing 'table using the character code' ⁇ address of the header part of the received data 'packet P1 as the search identifier. By doing so, output line information and IP address are obtained.
- the routing switch determines the output line based on the acquired output line information and creates a new data packet P2 including the contents of the received data packet P1 and its header part. Write the acquired IP address in The routing switch then sends the newly created data packet P2 to the IP network 100 side through the determined output line.
- the routing 'switch unit transfers the data' packet P1 stored in the data portion of the received data 'packet P2'.
- the character code of the header section ' ⁇ Take out the address.
- the routing switch obtains the information of the output line by searching the routing table using the character code and address as the search identifier. Then, the routing 'switch unit determines the output line based on the acquired output line information, and transmits the data' packet P1 through the determined output line.
- the routing processing in the first to third embodiments described above is a communication system in which electronic data such as character data, audio data, and video data is transmitted from the transmission source communication device to the transmission destination communication device. It can also be applied to data communication methods.
- the received electronic data to be transmitted may include the character code without format conversion.
- the person designation in the final reception point designation may be designation by telephone number.
- a telephone number is used as a character code for designating the final recipient (the person who received the call).
- routing can be performed directly with the character code information without converting the character code into a numerical code (IP address) by DNS. According to the routing using this character code information, management of numerical code information is unnecessary as long as only character code information is managed as routing information. There is an effect that the scale of the communication system can be reduced and the system configuration can be simplified.
- the present invention is applicable to next-generation integrated telecommunication networks (telephone network, mobile network, Internet, etc.).
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Telephonic Communication Services (AREA)
Abstract
Description
Claims
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US12/515,904 US20100054238A1 (en) | 2006-12-13 | 2007-12-12 | Telecommunication network, network node device, and routing method |
EP07859785A EP2093947A4 (en) | 2006-12-13 | 2007-12-12 | TELECOMMUNICATION NETWORK, NETWORK NODE DEVICE, AND ROUTING METHOD |
JP2008549339A JPWO2008072667A1 (ja) | 2006-12-13 | 2007-12-12 | 電気通信網、ネットワーク・ノード装置及びルーティング方法 |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2006-335204 | 2006-12-13 | ||
JP2006335204 | 2006-12-13 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2008072667A1 true WO2008072667A1 (ja) | 2008-06-19 |
Family
ID=39511684
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2007/073962 WO2008072667A1 (ja) | 2006-12-13 | 2007-12-12 | 電気通信網、ネットワーク・ノード装置及びルーティング方法 |
Country Status (5)
Country | Link |
---|---|
US (1) | US20100054238A1 (ja) |
EP (1) | EP2093947A4 (ja) |
JP (1) | JPWO2008072667A1 (ja) |
CN (1) | CN101578819A (ja) |
WO (1) | WO2008072667A1 (ja) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20100124220A1 (en) * | 2008-11-18 | 2010-05-20 | Morris Robert P | Method And Systems For Incrementally Resolving A Host Name To A Network Address |
CN107231341A (zh) * | 2016-12-27 | 2017-10-03 | 深圳市万网博通科技有限公司 | 报文处理方法和装置 |
Families Citing this family (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP6053692B2 (ja) * | 2011-12-20 | 2016-12-27 | キヤノン株式会社 | データ転送装置、データ転送方法およびチップ間通信システム |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH1188427A (ja) | 1997-09-05 | 1999-03-30 | Nippon Telegr & Teleph Corp <Ntt> | ルーティングテーブル検索装置 |
JP2006335204A (ja) | 2005-06-01 | 2006-12-14 | Asahi Denso Co Ltd | ハンドルスイッチ装置 |
Family Cites Families (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6981023B1 (en) * | 1999-03-09 | 2005-12-27 | Michael Hamilton | Message routing |
US6385615B1 (en) * | 1999-05-21 | 2002-05-07 | Cisco Technology, Inc. | Communicating network information using universal resource locators |
US6850980B1 (en) * | 2000-06-16 | 2005-02-01 | Cisco Technology, Inc. | Content routing service protocol |
US7698433B2 (en) * | 2001-03-20 | 2010-04-13 | Verizon Business Global Llc | User aliases in communication system |
JP2004140776A (ja) * | 2002-07-12 | 2004-05-13 | Nec Corp | ネットワークにおけるフレーム転送方法及びノード、フレーム転送プログラム |
-
2007
- 2007-12-12 CN CNA2007800438866A patent/CN101578819A/zh active Pending
- 2007-12-12 EP EP07859785A patent/EP2093947A4/en not_active Withdrawn
- 2007-12-12 US US12/515,904 patent/US20100054238A1/en not_active Abandoned
- 2007-12-12 JP JP2008549339A patent/JPWO2008072667A1/ja active Pending
- 2007-12-12 WO PCT/JP2007/073962 patent/WO2008072667A1/ja active Application Filing
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH1188427A (ja) | 1997-09-05 | 1999-03-30 | Nippon Telegr & Teleph Corp <Ntt> | ルーティングテーブル検索装置 |
JP2006335204A (ja) | 2005-06-01 | 2006-12-14 | Asahi Denso Co Ltd | ハンドルスイッチ装置 |
Non-Patent Citations (4)
Title |
---|
"DOMAIN NAMES-CONCEPTS AND FACILITIES", RFC1034, November 1987 (1987-11-01) |
"Requirements for IP Version 4 Routers", RFC1812, June 1995 (1995-06-01) |
See also references of EP2093947A4 |
YAMADA T. ET AL.: "Koshu Mo no DNS Address-ka no Kento", DENSHI TSUSHIN GAKKAI GIJUTSU KENKYU HOKOKU (TECHNICAL REPORT OF IEICE). SSE2000-183 TM2000-55, 22 November 2000 (2000-11-22), pages 37 - 42, XP008114968 * |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20100124220A1 (en) * | 2008-11-18 | 2010-05-20 | Morris Robert P | Method And Systems For Incrementally Resolving A Host Name To A Network Address |
CN107231341A (zh) * | 2016-12-27 | 2017-10-03 | 深圳市万网博通科技有限公司 | 报文处理方法和装置 |
CN107231341B (zh) * | 2016-12-27 | 2020-09-15 | 深圳市万网博通科技有限公司 | 报文处理方法和装置 |
Also Published As
Publication number | Publication date |
---|---|
US20100054238A1 (en) | 2010-03-04 |
EP2093947A1 (en) | 2009-08-26 |
JPWO2008072667A1 (ja) | 2010-04-02 |
CN101578819A (zh) | 2009-11-11 |
EP2093947A4 (en) | 2012-08-01 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US11374848B2 (en) | Explicit routing with network function encoding | |
KR101408108B1 (ko) | 통신 시스템, 노드, 제어 장치, 및 제어 방법 | |
EP2544417B1 (en) | Communication system, path control apparatus, packet forwarding apparatus and path control method | |
JP5880570B2 (ja) | マッピングサーバ装置、ネットワークシステム、パケット転送方法およびプログラム | |
US7447221B2 (en) | Communication apparatus | |
JP5846199B2 (ja) | 制御装置、通信システム、通信方法、および通信プログラム | |
WO2013168737A1 (ja) | 通信システム、制御装置、通信方法及びプログラム | |
HU218402B (hu) | Eljárás és berendezés több hozzáférési ponttal rendelkező forrás átirányító kommunikációs hálózatban mobil egységekkel folytatott vezeték nélküli kommunikációra | |
WO2006095508A1 (ja) | フラッディング抑制方法 | |
WO2007108083A1 (ja) | 中継装置、通信システム、通信方法及びコンピュータプログラム | |
JP2005510953A (ja) | 明示的マルチキャストのトンネリングサービス方法及び装置 | |
WO2015151184A1 (ja) | 通信システム、通信方法、中継装置、および、通信プログラム | |
CN102025590A (zh) | 新网与互联网互通的实现方法和系统 | |
WO2008072667A1 (ja) | 電気通信網、ネットワーク・ノード装置及びルーティング方法 | |
US7797444B2 (en) | Data transfer apparatus and data transfer system | |
WO2013062070A1 (ja) | 制御装置、通信システム、仮想ネットワークの管理方法およびプログラム | |
CN1886962B (zh) | 用于处理数据包流的上下文的方法、系统及Midcom代理 | |
WO2006073066A1 (ja) | 通信装置、ルーティング方法及びプログラム | |
WO2006098028A1 (ja) | ネットワークシステム及びネットワーク接続機器 | |
JP2017123522A (ja) | 通信装置、制御装置、通信システム、および、通信方法 | |
TWI281804B (en) | Packet forwarding method and system | |
US20040258056A1 (en) | Provider connection system, packet exchange apparatus thereof, dns server, packet exchange method, and computer program thereof | |
EP1445896A1 (en) | Provider connection system, packet exchange apparatus thereof, dns server, packet exchange method, and computer program thereof | |
JP4184997B2 (ja) | サービス提供プラットフォーム装置およびサービス提供方法 | |
CN104518966A (zh) | IPv6 直连链路无效地址的处理方法和装置 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
WWE | Wipo information: entry into national phase |
Ref document number: 200780043886.6 Country of ref document: CN |
|
DPE2 | Request for preliminary examination filed before expiration of 19th month from priority date (pct application filed from 20040101) | ||
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 07859785 Country of ref document: EP Kind code of ref document: A1 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 12515904 Country of ref document: US |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2008549339 Country of ref document: JP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2007859785 Country of ref document: EP |
|
NENP | Non-entry into the national phase |
Ref country code: DE |