CN103997466A - Method for sharing IP service flow in narrow-band network - Google Patents
Method for sharing IP service flow in narrow-band network Download PDFInfo
- Publication number
- CN103997466A CN103997466A CN201410244852.5A CN201410244852A CN103997466A CN 103997466 A CN103997466 A CN 103997466A CN 201410244852 A CN201410244852 A CN 201410244852A CN 103997466 A CN103997466 A CN 103997466A
- Authority
- CN
- China
- Prior art keywords
- path
- service
- link
- optimal path
- protocol
- 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
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Data streams from an IP service source to an IP service destination can be spread along an optimal path calculated by a unicast routing protocol. If a suboptimum path exists from the source to the destination, the optimal path is calculated through a link state routing protocol. The invention provides another method irrelevant to the protocol to seek the suboptimum path which does not coincide with the complete link of the current service path. A service source computer can guide part of service flow according to a strict SSRR mode through the suboptimum path. The method has the advantages that the method is irrelevant to the protocol, the entire network topology does not need to be obtained, the bandwidth of the current service link is not occupied by the link searching process, and the efficient service flow sharing method is provided for a network with a narrow-band link rebuilt.
Description
Technical field
The present invention relates to a kind of IP operation flow methodology of protocol-independent.
Background technology
The optimal path that IP operation flow is selected along singlecast router selection protocol is propagated, and the method for utilizing other path outside optimal path is again to move SPF algorithm calculating shortest path reject optimal path in topological database after.
SPF algorithm: in network, identical network topology structure is obtained in the flood variation of Link State of each node, and SPF utilizes topological database, uses the shortest path between any two points in dijkstra's algorithm computing network.
SPF in the problem of narrow band link is: the state variation of any link causes floods and will consume huge link bandwidth, during the actual sub-optimal path guide service flow of selecting will with the Link State competition bandwidth that floods.
Summary of the invention
Practical problem based on addressing in background technology, the present invention proposes a kind of protocol-independent IP flow methodology.The method utilizes flooding to calculate sub-optimal path, utilizes strict source routing (SSRR) to use sub-optimal path.
The method comprises.
1. Business Initiator inquires after to direct-connected gateway device initiation sub-optimal path.
2. this gateway routing device calculates sub-optimal path, and the interface IP address of each routing device on sub-optimal path is returned to Business Initiator.
3. Business Initiator, according to the IP address of each routing device on sub-optimal path, sends to gateway router by strict source routing mode (SSRR) by partial service.
The invention has the beneficial effects as follows: this method and protocol-independent, do not need to obtain full mesh topology, route searching process does not take the bandwidth of current business link yet, and the network of setting up for narrow band link provides a kind of efficient service traffics methodology.
Accompanying drawing explanation
Fig. 1 forward path is inquired after figure.
Fig. 2 confirms figure in backward path.
Embodiment
Embodiment is described from 3 aspects.
1. apply for path
When service source need to be applied for sub-optimal path, notify direct-connected gateway router, application sub-optimal path need provide source IP address, object IP address.
2. calculating path
Calculate sub-optimal path and divide 3 parts.
1) forward direction sub-optimal path is inquired after.
As Fig. 1, this step adopts the method flooding to inquire after message to interface (to the optimum clean culture gateway interface of the destination) transmission of all non-main paths.By source router, controlled the ID inquiring after, inquire after ID value at every turn and add up.
Receiving node receives that inquiring after the condition of not processing is (when ID is identical):
A incoming interface had received inquiring after with source and destination;
B incoming interface had sent inquiring after with source and destination;
The outgoing interface that c selects had sent inquiring after of identical ID;
D does not have standby outgoing interface can send (equipment only has single link).
All nodes on path need to record following information.
ID, application ground gateway RouterID, ancestor node, destination node, forward direction neighbours IP address and interface (receive while inquiring after message and fill)+whether confirmed, backward neighbours IP address and interface (filling while receiving confirmation message).
ID-query counts, different query counts processing mode different (the various judgements of forward, backward), value suggestion 1～65535, receives and is less than inquiring after and confirming not process (except during ID upset) of current record ID.
Forward direction is inquired after the IP address list of each transmission interface of message accounting, for confirmation message.
Backward confirmation message records the IP address list of each transmission interface, for service terminal source routing.
2) backward sub-optimal path is confirmed.
As Fig. 2, the gateway of destination node receives that inquiring after rear beginning sends clean culture confirmation message successively along forward path.
The local information that the forward path judgement that intermediate node carries according to backward confirmation message is quoted, takes out forward direction node, sends acknowledge message.
To acknowledge message, can again not send (when ID is identical) to the interface once sending afterwards, guarantee that the backup path link of selecting does not overlap.
3) neighbours safeguard.
After forward, backward information completely, start periodic maintenance forward and backward neighborhood.
After neighbours disappear, the information of record is deleted, also no longer response inquiry less than neighbours safeguard.
If backward neighbours disappear, to application ground gateway RouterID, send neighbours and disappear; If forward direction neighbours lose, directly deletion record.
Application ground gateway calculates the neighbours of message whether on sub-optimal path, if the crucial link of sub-optimal path disappears and notices to service source computer transmit path.
Service computer can apply for deleting sub-optimal path.
3. reverse-path
Service source, according to the IP address of each routing device on sub-optimal path, sends to gateway router by strict source routing mode (SSRR) by partial service.
Claims (5)
1. at narrowband network, share a method for IP operation flow, it is characterized in that utilizing flooding technique computes sub-optimal path, utilize strict source routing (SSRR) technology guide service flow.
2. flooding according to claim 1 is characterised in that: the forwarding interface of avoiding destination.
3. flooding according to claim 1 is characterised in that: inquire after message and use cumulative ID value, make intermediate node obtain the state of inquiring after.
4. flooding according to claim 1 is characterised in that: the transmission interface IP address of accumulative total router device during sweep forward.
5. flooding according to claim 1 is characterised in that: the transmission interface IP address of accumulative total router device during backward confirmation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410244852.5A CN103997466A (en) | 2014-06-05 | 2014-06-05 | Method for sharing IP service flow in narrow-band network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410244852.5A CN103997466A (en) | 2014-06-05 | 2014-06-05 | Method for sharing IP service flow in narrow-band network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103997466A true CN103997466A (en) | 2014-08-20 |
Family
ID=51311475
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410244852.5A Pending CN103997466A (en) | 2014-06-05 | 2014-06-05 | Method for sharing IP service flow in narrow-band network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103997466A (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030058797A1 (en) * | 2000-10-30 | 2003-03-27 | Nec Usa, Inc. | Path provisioning for service level agreements in differentiated service networks |
| CN102572994A (en) * | 2012-01-11 | 2012-07-11 | 清华大学 | Wireless self-organizing network fusing routing generation method based on node characteristics |
| CN103260210A (en) * | 2013-05-31 | 2013-08-21 | 北京新岸线移动多媒体技术有限公司 | Building method, system and device of multi-hop routing in multi-hop network |
| CN103346979A (en) * | 2013-06-21 | 2013-10-09 | 杭州华三通信技术有限公司 | Flow distribution method and equipment in SPBM network |
-
2014
- 2014-06-05 CN CN201410244852.5A patent/CN103997466A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030058797A1 (en) * | 2000-10-30 | 2003-03-27 | Nec Usa, Inc. | Path provisioning for service level agreements in differentiated service networks |
| CN102572994A (en) * | 2012-01-11 | 2012-07-11 | 清华大学 | Wireless self-organizing network fusing routing generation method based on node characteristics |
| CN103260210A (en) * | 2013-05-31 | 2013-08-21 | 北京新岸线移动多媒体技术有限公司 | Building method, system and device of multi-hop routing in multi-hop network |
| CN103346979A (en) * | 2013-06-21 | 2013-10-09 | 杭州华三通信技术有限公司 | Flow distribution method and equipment in SPBM network |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP2020522211A5 (en) | ||
| CN102594703B (en) | Relay-node-based Internet communication system and communication path selection method | |
| CN110890994B (en) | Method, device and system for determining message forwarding path | |
| CN101237399A (en) | Method, system and device for getting label switching path | |
| CN103475719A (en) | Content distribution method for minimizing cross-domain flows in CDN-P2P fusion network | |
| CN104767680B (en) | It route the method and apparatus being switched fast | |
| CN109951335B (en) | Satellite network delay and rate combined guarantee routing method based on time aggregation graph | |
| CN104065576A (en) | Label switching method in dynamic MPLS satellite network | |
| CN1964360A (en) | A method and device for MAC frame forwarding | |
| CN101159695A (en) | Link selecting method and apparatus | |
| CN106161053A (en) | A kind of SDN controller QoS manages system and method | |
| CN106487558A (en) | A kind of method and apparatus realizing the scalable appearance of access device | |
| CN101155119B (en) | Method and device for confirming boundary node of autonomous system and its path computing method | |
| CN106612231B (en) | Method for routing are repaired in more strategy mixing under a kind of mine based on WMN | |
| CN103974365A (en) | Ad Hoc mobile network route restoring method | |
| CN102857418A (en) | VPN (virtual private network)-based fast re-route (FRR) switch method and VPN-based fast re-route switch equipment | |
| WO2009140873A1 (en) | Configuration method of link attribute information, communication device and communication system | |
| CN105872093A (en) | CDN acceleration method and system | |
| CN104092611A (en) | Method and device for determining label switching route with restrained cross region | |
| CN103179032B (en) | A kind of route backup method and device | |
| Devarajan et al. | An enhanced cluster gateway switch routing protocol (ECGSR) for congestion control using AODV algorithm in MANET | |
| CN108471558A (en) | A kind of blended data transmission method, data transmission method and relevant device | |
| JP4128944B2 (en) | Multicast transfer route setting method, multicast transfer route calculation device, program, and recording medium | |
| CN103997466A (en) | Method for sharing IP service flow in narrow-band network | |
| CN103716242A (en) | Routing method and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20140820 |
|
| WD01 | Invention patent application deemed withdrawn after publication |