CN1328889C - Routing method based on link status - Google Patents
Routing method based on link status Download PDFInfo
- Publication number
- CN1328889C CN1328889C CNB021120110A CN02112011A CN1328889C CN 1328889 C CN1328889 C CN 1328889C CN B021120110 A CNB021120110 A CN B021120110A CN 02112011 A CN02112011 A CN 02112011A CN 1328889 C CN1328889 C CN 1328889C
- Authority
- CN
- China
- Prior art keywords
- bag
- unit
- packet
- route
- neighbours
- 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
Images
Abstract
The present invention relates to a routing method based on link states, which is characterized in that in a point-to-point transmission network composed of at least two device units, the routing steps comprises: each device unit is provided with a physical mark and an interface mark, and a neighbor information table is established in each device unit; each device unit sends detecting packets which are sent with time intervals to self interfaces and also sends the detecting packets to neighbors, and each device units broadcasts the content of the neighbor information table with time intervals. Each device unit receives a data packet and processes the received data packet to generate a new routing packet. The present invention has the advantages of small code quantity and high running efficiency, and can be easily inserted into access equipment or other real-time equipment; the present invention does not occupy IP addresses and has a high routing learning speed. Because of the simplicity and the refinement of the present invention, the present invention also has the advantages of having low requirements for inserted equipment, effectively reducing equipment cost and decreasing research developing cost and maintenance cost.
Description
Technical field
The invention belongs to data communication technology field, it is particularly related to the data communication technology by point-to-point networking, is a kind of method for routing based on Link State concretely.
Background technology
Along with developing rapidly of Internet technology, diversified networking equipment also emerges in an endless stream, and these various data communications equipment that provided by different manufacturers have constituted the small-sized one by one autonomous system in the practical application.For the internal unit to these small-sized autonomous systems is effectively managed, need in its system, carry out the data route.
In the prior art, often adopt different Routing Protocols to come data between the transmission route device, these Routing Protocols generally all have the route learning function.For example, RIP (routing information protocol) and OSPF (open shortest path is through preferential) are prevailing two kinds of Routing Protocols.Wherein, the basis of RIP is to determine least hops counting between two network nodes, and when network became increasing, RIP just began to deteriorate to a kind of selection of manufacturer.Though RIP has characteristic of simple, it is limited more, and convergence rate is slower.And ospf protocol does not have many restrictions of RIP, and each ospf router transmits the description rather than the whole routing table of its link-local, because these route bags are less relatively, thereby the energy minimization network congestion, efficient is higher.The shortcoming of OSPF is a bulky complex too.The more important thing is that these two kinds of agreements all are required to be its operational outfit and distribute one or more IP address, and it all is the agreement that designs for special equipment, so it is difficult for being embedded in the small-sized real-time device.
As seen, how better in the data communication network of forming by different small-sized real-time devices, to carry out the data route and become the problem that needs solve.
Summary of the invention
The objective of the invention is to, a kind of method for routing based on Link State is provided, make the efficient of its simple and ospf protocol that can have the RIP agreement concurrently, and do not take the IP address.And can be embedded into easily in the small-sized real-time device, realize the route of the small-sized autonomous system inside formed by various data communications equipment effectively.
Technical scheme of the present invention is: a kind of method for routing based on Link State is characterized in that in the point-to-point transmission network that is made of at least two units, its route step comprises:
Physical label and interface identifier are set for each unit;
In each unit, set up the neighbor information table;
Each unit sends detection packet to its own interfaces, free interval when sending detection packet, and detection packet issued neighbours;
Each unit is broadcasted away the content of neighbor information table, free interval during broadcasting;
Each unit receives packet, and the packet that is received is judged:
If the packet that is received is a detection packet, then self physical label and interface identifier is placed in the response detected bag, and returns to the data sender;
If the packet that is received is the response detected bag, then take out wherein neighbours' physical label and interface identifier, be saved in the neighbor information table of self; Otherwise need the packet that is received is further judged:
If the packet that is received is the route bag, judge again that then the route bag that is received is old bag or new bag, be that old Bao Ze abandons; Be the then old bag of deletion of new bag, preserve bag newly, transmit new bag and give other neighbours, regenerate routing table;
If the packet that is received is not the route bag, then gives non-route packet handing module and handle.
Described point-to-point transmission network is meant: point-to-point transmission networks such as distributed network, loop network.
Describedly physical label is set for each unit and interface identifier is meant: to can be each unit unique physical label is set; Can more than one interface number be set according to the interface number of each unit.
The described neighbor information table of setting up in each unit is meant: can set up the neighbor information table that comprises its own interfaces number, neighbours' sign, neighbours' interface number, is communicated with field such as sign in each unit.
Described each unit sends detection packet to its own interfaces, free interval when sending detection packet, and detection packet is issued neighbours be meant: each unit periodically sends detection packet to its total interface, the physical label and the interface number that contain this unit in this detection packet, and the connection attribute field that the neighbor information table is set is " disconnections ", and detection packet is only issued directly continuous neighbours.
Described each unit is broadcasted away the content of neighbor information table, free interval is meant during broadcasting: at regular intervals, each unit breaks into the route bag with the neighbor information table of oneself, and adds time tag in the route bag, broadcasting is gone out, and issues all neighbours that is:.
Described each unit receives packet, and the packet that is received judged be meant: when unit is received the detection packet that neighbours send, the physical label of oneself and the interface number of this bag of reception are placed in the response packet, return to neighbours from receiving interface;
When unit is received a response detected bag, take out physical label and the interface number of neighbours in the bag, be saved in the neighbor information table, and be provided with and be communicated with attribute field and be " connection ";
At regular intervals, each unit breaks into the route bag with the neighbor information table of oneself, and adds time tag in bag, and broadcasting is gone out;
When a unit is received the route bag of another unit by the one interface, this unit takes out the time tag t in the route bag, the time tag t1 of the route bag that together last another unit sends compares, if: t is older than t1, then abandons the route bag of just having received;
If: t is newer than t1, then deletes old route bag, preserves the route bag just received, and should be transmitted to all neighbours by new route bag, receives except the neighbours that interface connected of this bag;
At regular intervals, each unit calculates the route of other unit according to the route bag of receiving, generates new routing table.
Beneficial effect of the present invention is: size of code of the present invention is little, the operational efficiency height, and can be embedded into easily in access device or other real-time devices.It does not take the IP address, and route learning speed is fast.Because it is simply concise, thus not high to embedding equipment requirements, reduced equipment cost effectively, reduced research and development and maintenance cost.The present invention can have concurrently the RIP agreement simple and ospf protocol efficiently, realized the route of the small-sized autonomous system inside formed by various data communications equipment well.
Description of drawings
Fig. 1 is the distributed network schematic diagram;
Fig. 2 is the loop network schematic diagram;
Fig. 3 is in the specific embodiment of the invention, the autonomous system schematic diagram of point to point network formula;
Fig. 4 is a flow chart of the present invention.
Embodiment
The present invention is a kind of method for routing based on Link State, it is characterized in that, and in the point-to-point transmission network that constitutes by at least two units, can be in distributed network or loop network as shown in Figure 2 as shown in Figure 1; As shown in Figure 4, its route step comprises:
Physical label and interface identifier are set for each unit;
In each unit, set up the neighbor information table;
Each unit sends detection packet to its own interfaces, free interval when sending detection packet, and detection packet issued neighbours, can start timer T1 with computing time this moment;
Each unit is broadcasted away the content of neighbor information table, free interval during broadcasting, and can start timer T2 with computing time this moment;
Each unit receives packet (this packet is from physical layer), and the packet that is received is judged:
If the packet that is received is a detection packet, then self physical label and interface identifier is placed in the response detected bag, and returns to the data sender;
If the packet that is received is the response detected bag, then take out wherein neighbours' physical label and interface identifier, be saved in the neighbor information table of self; Otherwise need the packet that is received is further judged:
If the packet that is received is the route bag, judge again that then the route bag that is received is old bag or new bag, be that old Bao Ze abandons; Be the then old bag of deletion of new bag, preserve bag newly, transmit new bag and give other neighbours, regenerate routing table;
If the packet that is received is not the route bag, then gives non-route packet handing module and handle.
Set forth the route implementing of an autonomous system (point to point network) below in conjunction with Fig. 3:
Autonomous system shown in Figure 3 has 9 units (A, B, C, D, E, F, G, H, I, J) to constitute, can connect (also can use other netting twines to connect) between each unit by optical fiber, each unit has a physical label, and this is identified in the autonomous system unique.Each unit has one or more interfaces, links to each other with other units by interface.For example equipment equipment D has 2 interface d1 and d2, links unit A d1 number, links unit C d2 number.Unit C has 5 interface c1, c2, c3, c4, c5, is connected to unit B, D, E, F, G respectively.
The treatment step of the method for the invention following (mainly writing the treatment step of software):
The first step: each unit is set up a neighbor information table, and each list item comprises 4 fields: its own interfaces number, neighbours' sign, neighbours' interface number, be communicated with sign.
Second step: each unit periodically (for example every 5 seconds) sends detection packet to total interface, contains the physical label and the interface number of this unit in the bag, and the connection that each list item of neighbor information table is set is masked as " disconnection ".Detection packet is only issued the neck that directly links to each other and is occupied.
The 3rd step: when unit is received the detection packet that neighbours send, the interface number of own physical label and this bag of reception is placed in the response packet, returns to neighbours from receiving interface.After for example D receives the detection packet of C, will identify D and interface number d2 and be placed on and return to C in the response packet.
The 4th step: when unit is received a response detected bag, take out physical label and the interface number of neighbours in the bag, be saved in the neighbor information table, and be provided with to be communicated with and be masked as " connection ".
The 5th step: (for example every 10 seconds) at regular intervals, each unit breaks into the route bag with the neighbor information table of oneself, and adds time tag in bag, broadcasts away (issuing all neighbours).
The 6th step: when unit is received the route bag of another unit, carry out following processing.Here in order to narrate conveniently, suppose that unit A receives the route bag of unit H by interface a2.A takes out the time tag t in the route bag, and the time tag t1 of the route bag that sends with last H compares.Possible result is as follows:
(1) t is older than t1, then abandons the route bag of just having received:
(2) t is newer than t1, then deletes old route bag, preserves the route bag just received, and will this new route bag be transmitted to all neighbours neighbours that interface connected of this bag (receive except).
The 7th step: (for example 10 seconds) at regular intervals, each unit calculate the route of other unit according to the route bag of receiving, generate new routing table.
Size of code of the present invention can be embedded in access device or other real-time devices easily less than 1500 row, does not take the IP address, and route learning speed is fast.Because simply concise, not high to equipment requirements, reduced equipment cost effectively, reduced research and development and maintenance cost.The present invention can have concurrently the RIP agreement simple and ospf protocol efficiently, realized the route of the small-sized autonomous system inside formed by various data communications equipment well.
Above embodiment only is used to illustrate the present invention, but not is used to limit the present invention.
Claims (7)
1. the method for routing based on Link State is characterized in that, in the point-to-point transmission network that is made of at least two units, its route step comprises:
Physical label and interface identifier are set for each unit;
In each unit, set up the neighbor information table;
Each unit sends detection packet to its own interfaces, free interval when sending detection packet, and detection packet issued neighbours;
Each unit is broadcasted away the content of neighbor information table, free interval during broadcasting;
Each unit receives packet, and the packet that is received is judged:
If the packet that is received is a detection packet, then self physical label and interface identifier is placed in the response detected bag, and returns to the data sender;
If the packet that is received is the response detected bag, then take out wherein neighbours' physical label and interface identifier, be saved in the neighbor information table of self; Otherwise need the packet that is received is further judged:
If the packet that is received is the route bag, judge again that then the route bag that is received is old bag or new bag, be that old Bao Ze abandons; Be the then old bag of deletion of new bag, preserve bag newly, transmit new bag and give other neighbours, regenerate routing table;
If the packet that is received is not the route bag, then gives non-route packet handing module and handle.
2. method according to claim 1 is characterized in that, described point-to-point transmission network is meant: distributed network, loop network.
3. method according to claim 1 is characterized in that, describedly physical label is set for each unit and interface identifier is meant: can be each unit unique physical label is set; Can more than one interface number be set according to the interface number of each unit.
4. method according to claim 1, it is characterized in that the described neighbor information table of setting up is meant in each unit: can in each unit, set up the neighbor information table that comprises its own interfaces number, neighbours' sign, neighbours' interface number, is communicated with attribute field.
5. method according to claim 1, it is characterized in that, described each unit sends detection packet to its own interfaces, free interval when sending detection packet, and detection packet is issued neighbours be meant: each unit periodically sends detection packet to its total interface, contain the physical label and the interface number of this unit in this detection packet, and the connection attribute field that the neighbor information table is set is " disconnections ", and detection packet is only issued directly continuous neighbours.
6. method according to claim 1, it is characterized in that, described each unit is broadcasted away the content of neighbor information table, free interval is meant during broadcasting: at regular intervals, each unit breaks into the route bag with the neighbor information table of oneself, and in the route bag, adding time tag, broadcasting is gone out, and issues all neighbours that is:.
7. method according to claim 1, it is characterized in that, described each unit receives packet, and the packet that is received judged be meant: when unit is received the detection packet that neighbours send, the physical label of oneself and the interface number of this bag of reception are placed in the response packet, return to neighbours from receiving interface;
When unit is received a response detected bag, take out physical label and the interface number of neighbours in the bag, be saved in the neighbor information table, and be provided with and be communicated with attribute field and be " connection ";
At regular intervals, each unit breaks into the route bag with the neighbor information table of oneself, and adds time tag in bag, and broadcasting is gone out;
When a unit is received the route bag of another unit by the one interface, this unit takes out the time tag t in the route bag, the time tag t1 of the route bag that together last another unit sends compares, if: t is older than t1, then abandons the route bag of just having received;
If: t is newer than t1, then deletes old route bag, preserves the route bag just received, and should be transmitted to all neighbours by new route bag, receives except the neighbours that interface connected of this bag;
At regular intervals, each unit calculates the route of other unit according to the route bag of receiving, generates new routing table.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB021120110A CN1328889C (en) | 2002-06-06 | 2002-06-06 | Routing method based on link status |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB021120110A CN1328889C (en) | 2002-06-06 | 2002-06-06 | Routing method based on link status |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1464704A CN1464704A (en) | 2003-12-31 |
| CN1328889C true CN1328889C (en) | 2007-07-25 |
Family
ID=29741995
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB021120110A Expired - Lifetime CN1328889C (en) | 2002-06-06 | 2002-06-06 | Routing method based on link status |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1328889C (en) |
Families Citing this family (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1721411A4 (en) * | 2004-01-14 | 2010-09-08 | Riverstone Networks Inc | Managing processing utilization in a network node |
| CN100375438C (en) * | 2004-10-27 | 2008-03-12 | 中兴通讯股份有限公司 | Dynamic route collocating method for network management device based on E1 communication |
| JP3961000B2 (en) * | 2005-05-26 | 2007-08-15 | 株式会社日立コミュニケーションテクノロジー | Packet transfer apparatus and network system |
| CN100442767C (en) * | 2005-08-22 | 2008-12-10 | 广东省电信有限公司研究院 | Method for stable restart of router realizing fast route convergence |
| CN100568852C (en) * | 2006-03-22 | 2009-12-09 | 中兴通讯股份有限公司 | The router of operation IS-ISv6 is set up the method for single topology syntople |
| CN100418332C (en) * | 2006-07-14 | 2008-09-10 | 清华大学 | Method for overlaying network status information broadcasting in route network |
| CN100440870C (en) * | 2006-07-14 | 2008-12-03 | 清华大学 | Method for overlaying data retransmission in route network |
| CN101110718B (en) * | 2007-08-22 | 2010-08-18 | 中兴通讯股份有限公司 | Self-adapting chain circuit detecting method and device thereof |
| CN101136863B (en) * | 2007-10-23 | 2011-05-18 | 深圳市金蝶中间件有限公司 | Routing information generating method, system and message routing method and system |
| CN102904827B (en) * | 2012-10-09 | 2015-11-25 | 中国联合网络通信集团有限公司 | Bypass flow local methodology and bypass networking structure |
| CN102970233B (en) * | 2012-11-22 | 2016-03-30 | 华为技术有限公司 | Obtain the method for route, device, equipment, concentrator and system |
| CN103825760B (en) * | 2014-02-25 | 2017-06-06 | 新华三技术有限公司 | A kind of method and apparatus that neighborhood is set up based on ospf protocol |
| CN106658635B (en) * | 2016-11-03 | 2019-08-09 | 东莞理工学院 | The method of quality-of-service based hierarchy routing in wireless multi-hop network |
| CN111726296B (en) | 2019-03-20 | 2021-10-22 | 北京华为数字技术有限公司 | Neighbor relation management method, device, equipment and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5034945A (en) * | 1988-07-21 | 1991-07-23 | Hitachi, Ltd. | Packet switching network with alternate trunking function to repeat avoiding looped trunk |
| US5086428A (en) * | 1989-06-09 | 1992-02-04 | Digital Equipment Corporation | Reliable broadcast of information in a wide area network |
| WO2000039967A2 (en) * | 1998-12-23 | 2000-07-06 | Nokia Wireless Routers, Inc. | A unified routing scheme for ad-hoc internetworking |
| US6201794B1 (en) * | 1997-03-07 | 2001-03-13 | Advanced Micro Devices, Inc. | Network with efficient message routing |
| JP2002057697A (en) * | 2000-08-09 | 2002-02-22 | Nec Corp | Packet transfer route controller and packet transfer route control method used therefor |
-
2002
- 2002-06-06 CN CNB021120110A patent/CN1328889C/en not_active Expired - Lifetime
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5034945A (en) * | 1988-07-21 | 1991-07-23 | Hitachi, Ltd. | Packet switching network with alternate trunking function to repeat avoiding looped trunk |
| US5086428A (en) * | 1989-06-09 | 1992-02-04 | Digital Equipment Corporation | Reliable broadcast of information in a wide area network |
| US6201794B1 (en) * | 1997-03-07 | 2001-03-13 | Advanced Micro Devices, Inc. | Network with efficient message routing |
| WO2000039967A2 (en) * | 1998-12-23 | 2000-07-06 | Nokia Wireless Routers, Inc. | A unified routing scheme for ad-hoc internetworking |
| JP2002057697A (en) * | 2000-08-09 | 2002-02-22 | Nec Corp | Packet transfer route controller and packet transfer route control method used therefor |
Non-Patent Citations (1)
| Title |
|---|
| 无线ad hoc 网络中的多径源路由 舒炎泰 高德云 王雷，电子学报，第30卷第2期 2002 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1464704A (en) | 2003-12-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1328889C (en) | Routing method based on link status | |
| CN100512194C (en) | Sending and receiving method and system for link aggregation method, device and MAC frame | |
| CN102957616B (en) | In the method and system of ASIC repeating TRILL network message | |
| CN101409666B (en) | Ring network, ring network topology discovering method and node | |
| CN101631069B (en) | Method, system and equipment for pseudo wire parameter negotiation | |
| CN103001879B (en) | Reduce the method and apparatus of LSA inundation number of times | |
| CN101854284A (en) | The Loop Protection of dynamic assignment and the reservation of the bandwidth in the recovery technology re-use | |
| CN103069756A (en) | Communication system, controller, node controlling method and program | |
| CN101771610B (en) | Transport multiprotocol label switching network (T-MPLS) system and link protection method | |
| CN102821009A (en) | Method for monitoring ring network on basis of link layer discovery protocol and device | |
| CN101212455A (en) | Link aggregation control method and device | |
| CN100463446C (en) | Method of automatic detection topology, set-up route table and implementing narrow-band service | |
| CN102420699A (en) | Equipment number distribution method of digital radio frequency remote system and system thereof | |
| CN101136865A (en) | Method of implementing service link tracing based on T-MPLS packet transfer network | |
| JP2013026829A (en) | Transmission system and control method of transmission system | |
| CN103368844A (en) | Message processing method and label switching router in MPLS network | |
| CN101145940A (en) | A method for searching network element device and establishing topology connection in network management system | |
| CN100579025C (en) | Route information maintaining method of automatic exchange optical network | |
| CN104322021B (en) | Terminal and path generating method | |
| EP1699169A1 (en) | Wireless base station, wireless mobile device, and wireless access network for reducing signalling traffic | |
| CN100531144C (en) | Router and routing transmission method | |
| CN101478489B (en) | Method and system for controlling default routing notification by IS-IS protocol | |
| CN100452755C (en) | A method for establishing static label transmitting route | |
| CN106789179B (en) | A kind of resource allocation methods based on SDN framework | |
| CN101478775B (en) | Detection method, system and equipment for multi-neighbor connection state |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20180425 Address after: California, USA Patentee after: Global innovation polymerization limited liability company Address before: 518057 Department of law, Zhongxing building, South Science and technology road, Nanshan District hi tech Industrial Park, Shenzhen Patentee before: ZTE Corporation |
|
| TR01 | Transfer of patent right | ||
| CX01 | Expiry of patent term |
Granted publication date: 20070725 |
|
| CX01 | Expiry of patent term |