CN1761236A - Intelligent routing method based on layered structured applying groups - Google Patents
Intelligent routing method based on layered structured applying groups Download PDFInfo
- Publication number
- CN1761236A CN1761236A CNA2005100476911A CN200510047691A CN1761236A CN 1761236 A CN1761236 A CN 1761236A CN A2005100476911 A CNA2005100476911 A CN A2005100476911A CN 200510047691 A CN200510047691 A CN 200510047691A CN 1761236 A CN1761236 A CN 1761236A
- Authority
- CN
- China
- Prior art keywords
- routing
- node
- route
- network
- territory
- 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
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Using current route devices as route nodes of communication network, network tree model as route model, the invention introduces grouped intelligent algorithm, designs distribution type route protocol to accomplish function of route so as to be suitable to condition when network is changed with time dynamically. Route function includes steps: building hierarchy model of network tree; building and updating fixed and variable route table, route buffer table in high speed; receiving route information; sending information for updating route table; sending out route probing packet to determine state of link. Taking full advantage of time variation and regionality, and considering habit of use and cost of obtaining information etc, the invention improves operating efficiency and obtains accurate optimized result. Being accorded with multiple route modes, protocols are compatible to multiple route modes. The invention is suitable to autonomous domains of interconnected backbone networks.
Description
Technical field
The invention belongs to network communications technology field.Relate to a kind of point-to-point dynamic network communication technology, particularly be suitable for the time dependent distributed method for routing of link metric in large scale network and the network.
Background technology
Along with the continuous expansion of Internet scale, diversified networking equipment emerges in an endless stream.These equipment have constituted the autonomous system one by one in the communication network, in order to make the communication that forms high efficiency, low cost between these autonomous system inside and the autonomous system, just need carry out the data route.All devices in the system is observed same set of routing rule jointly, uses identical routing iinformation statement and storage means.
In existing technology, Routing Protocol is the major technique means that solve the data route.Routing Protocol based on abstract network model come node in the computing network between optimal path.According to the account form of optimal path, Routing Protocol can be divided into two big classes: Link State route and distance vector route.In the running of link-state protocol, the equipment of every responsible exchanging routing information in the network (router, switch etc.) is all being safeguarded the routing topology information of whole network, and uses corresponding routing algorithm calculating optimal path and generate routing table according to these information.Distance vector routing protocol does not need then in use to safeguard whole network routing iinformation that the information of distributed route is only transmitted, and obtains routing table at the distributed routing algorithm of the use of each node between neighbor node.On Internet, use two kinds of the most general Routing Protocols to be at present: RIP (Routing Information Protocol, routing information protocol) and OSPF (Open ShortestPath First, open type shortest path priority protocol).Wherein, the RIP agreement is a distance vector routing protocol, uses distributed Ford-Bellman algorithm.The characteristics that it has simply, extensibility is high, but convergence rate is slower.Ospf protocol is typical link-state routing protocol, uses dijkstra's algorithm.It effectively raises speed and the accuracy that routing iinformation converges, thereby has reduced the probability of network congestion, has improved the whole efficiency of network.But ospf protocol is too huge, and route equipment is had quite high requirement.
At present, along with the introducing of telecommunication service, the service quality of IP network (IP QoS) becomes the important subject of Internet of future generation.The target of QoS route also is a problem of seeking the optimal path from the source node to the destination node by the current router routing table.In order to solve the problem that the QoS routing algorithm improves with required time of implementation of the increase of network size and storage demand, the thought of topological structure layering is applied in the large-scale network widely.The process of topology aggregation is that each territory in the network is converged to a simple topology with this domain information.Though this thought has been simplified the size of routing table widely, but because layering makes the node in the network only grasp local message, thereby the inexactness that has caused routing iinformation, at this problem, people have designed various dynamic shortest path tree algorithms and have obtained very high effect.But when these method for routing are applied to dynamic network, still there are redundant calculating and inaccurate routing iinformation, can not obtain realistic accurate optimization result and very high router efficiency based on the network routing procedure of these agreements.Routing plan, the research of therefore setting up the high router efficiency of realistic high precision and the flow situation that gears to actual circumstances are suitable for the dynamic Routing Protocol that changes of large scale network becomes a problem that presses for solution.
Summary of the invention
The purpose of this invention is to provide a kind of can be effectively for the autonomous territory of present internet backbone provides the high precision of the flow situation that accurately gears to actual circumstances and router efficiency, good convergence,, the cost that can effectively reduce routing device little to the resource occupation of route equipment, and can dynamically make the method for routing based on layered structured applying groups intelligence of renewal by oneself.
Technical solution of the present invention is, in the data communication network that exists two communication equipments with route bearing function to form at least, uses operating scheme of the present invention as described below respectively.The topology of data communication network can be distributed network or loop network.The Network Transmission media can use and comprise that optical fiber, digital microwave, common coaxial cable, twisted-pair feeder etc. are multiple.The physical layer of communication network and data link layer can be used multiple interfaces, to support user's different access waies.Technical scheme of the present invention is operated in network layer.Because model used in the present invention and routing algorithm are smaller to taking of the processor of equipment in netting, memory source, low-end routers even soft routing device all can use.
The present invention is a kind of method for routing that use in the autonomous territory of internet backbone that is suitable for.This method uses existing hardware routing device to be the basis, is applicable to router and the equipment with soft routing function.
Routing table institutional framework of the present invention is as follows:
Technical scheme of the present invention may further comprise the steps:
1, by routing device operation Routing Protocol program, the hierarchical network tree-model of design at the communication capacity of routing device in the communication network, adheres to each link in the different levels territory of network tree separately according to the link parameter between router according to the present invention.From the angle of network tree model, whether present network communication equipment can be that associated nodes (node in contact different levels territory) is divided into two classes according to it, and for the dereferenced node, its map data base only comprises from the information in this territory, node place; For associated nodes, its map data base not only comprises the information in this territory, node place, also comprises the information in the territory that directly links to each other with it.Map data base is the set of link state packets (LSA), and each link state packets (LSA) is represented a link, specifically needs the information of maintenance as follows:
Link state packets (LSA) is a tlv triple＜i, number, and W (i)＞, wherein, i represents the source node address of this transmission link packet; Number represents the renewal sequence number of this link packet; W (i) is two a tuples＜i, c
Ij＞set, each two tuple i represents a link.
2, by routing device operation Routing Protocol program, the hierarchical network tree-model of design according to the present invention makes up novel routing table in the inner high speed store memory of routing device.The present invention adopts a kind of new routing table method for organizing, and promptly the routing table in every router is divided into fixed route table and variable routing table two parts.Fixed route table IncFlds interior nodes address routing iinformation and domain addresses routing iinformation.Variable routing table is that non-domain node routing iinformation of visit recently formed.
The fixed route table is identical with the data structure that variable routing table is adopted, and for every routing device, it specifically needs the information of maintenance as follows:
Array D, each element D
jBe weights from present node to destination address j optimal path.
Array P, each element P
jIt is next jumping from present node to destination address j optimal path.
3, by routing device operation Routing Protocol program, the hierarchical network tree-model of design according to the present invention utilizes the routing table of routing device map data stored library information computational fields interior nodes, and the routing iinformation that calculates is stored in the fixed route table.
4, by routing device operation Routing Protocol program, the hierarchical network tree-model of design according to the present invention, the domain addresses part of the fixed route table that in the inner high speed store memory of routing device, makes up.
5, by routing device operation Routing Protocol program, the hierarchical network tree-model of design according to the present invention, begin to carry out routing forwarding, when the destination node address is not in the routing table that has made up, the present invention has designed a kind of inter-domain routing protocol based on the swarm intelligence algorithm, is used for forming the routing iinformation between the destination node of source, and the routing iinformation that forms is deposited in the variable routing table.
6. each data transmission unit has the Routing Protocol program control, sends probe data packet to neighbours according to the time interval of determining, in order to determine link state.
When routing device when receiving the new routing table information that sends by neighbours, from the buffering area of the network equipment (as network interface card), obtain new routing iinformation, send the internal storage of routing device, and, design the routing table information update algorithm according to the present invention and upgrade corresponding cache table item by processor operation Routing Protocol program.And judge whether that needing to trigger routing table calculates.
8. as carrying out the calculating of routing table, then the routing table update algorithm that is designed according to the present invention by the Routing Protocol program carries out the renewal of routing table.In the process of upgrading, the list item that upgrades is recorded in the internal storage of routing device, and the routing state information form of design according to the present invention, the route table items that tissue is updated forms route data packets, sends to neighbours by the network interface of routing device.
9. routing device upgrades current fixed route table according to the variation operation Routing Protocol Automatic Program of current slot.
10, the internal memory situation of router basis itself is provided with the upper limit of variable routing table size, and variable routing table adopts least recently used method to manage.
Beneficial effect and benefit that the present invention reached are that the network tree model of design can be described the virtual condition of network exactly, has described hierarchy and region characteristic in the network effectively.On this model based, the present invention has designed the Routing Protocol that is fit to this model.The advantage of this agreement is small scale, accuracy and router efficiency height, good convergence, the operational efficiency height of routing table,, the cost that can effectively reduce routing device little to the resource occupation of route equipment, reduce research and development and maintenance cost, the target of accord with Q oS route.Routing plan of the present invention is applicable to the time dependent situation of the link metric of extensive or ultra-large network link; the updating route information algorithm that tree-model wherein Network Based is designed; solved the time dependent problem of Link State in the indeterminable large scale network of traditional method for routing effectively; more reasonably distribute network traffics, improved the goodput of network.
Description of drawings
The present invention is further illustrated below in conjunction with the drawings and specific embodiments.
The network type schematic diagram that Fig. 1 uses for the present invention.
Fig. 2 is a routing plan basic flow sheet of the present invention.
Fig. 3 is routing iinformation data packet format figure of the present invention.
Fig. 4 is ant data packet format figure of the present invention.
Fig. 5 is hierarchical network tree product process figure of the present invention.
Fig. 6 is the ant packet transmission flow journey figure of inter-domain routing of the present invention.
Fig. 7 receives flow chart for inter-domain routing algorithm ant packet of the present invention.
Embodiment
Routing plan of the present invention is an application with existing routing device, is suitable for the autonomous territory of present internet backbone and uses.This scheme is mainly formed by the network tree model with based on routing algorithm and a whole set of route technology of this model.
Dynamic aggregation tree network model of the present invention specifically describes as follows:
Any one network all can be divided into the irregular area that several are referred to as the territory, this territory is the sub-network of former network and a node that constitutes network tree. network tree is the finite aggregate in the individual territory of n (n＞0), and in the polymerization tree of non-NULL: (1) has and only have a specific territory is the root of network tree; (2) when n＞1, its co-domain can be divided into the individual finite aggregate T of m (m＞0)
1, T
2, Λ, T
m, and i ≠ k, 1≤i, k≤m, T
i∩ T
k∈ V, wherein each set itself is again a network tree, and is called the subtree of root.Link in the former network is given different stage according to the value of its parameter, and the level of network tree is divided by this rank just.Each territory is got in touch by associated nodes.
Routing Protocol implementation concrete steps of the present invention are described below:
1. the routing device initialization is fixed and variable routing table.Each routing table is divided into three sublists, is respectively:
Measure route sublist D, an one-dimension array, by the destination address index, each element D
jBe weights from present node to destination address j shortest path.
Next jumps route sublist P, an one-dimension array, and by the destination address index, each element P
jIt is next jumping from present node to destination address j shortest path.
2. the physical label and the interface identifier of each physical network interface of this routing device are set, and, insert the neighbor information formation simultaneously with this unique definite neighbours' routing device.
3. according to initialized routing table, generate the expressway by two-dimentional cache table T.This table is by neighbor node, destination address index list item, each element T
KjBe the weights that arrive destination address j shortest path from the present node road through neighbor node k.
4. the routing table contents in table is packaged as the routing iinformation packet, the field that comprises in the bag has: agreement label, bag size (byte), routing table update item number, route table items update content.Wherein, the route table items update content is two tuple (j, the D that destination, path metric are formed
j).Concrete data packet format is seen accompanying drawing 3.
5. send the route exploration packet to each neighbours.The route exploration packet is divided into active probe and answers and survey two classes, and by the sign of the type field in the bag, concrete form is seen accompanying drawing 4.
6. after routing device is received route data packets, at first carry out diakoptic algorithm, form the network tree model.Moved this algorithm, each node has all been grasped the information of its subdomain node.Node address begins recurrence by associated nodes from rhizosphere and distributes.Concrete flow process is seen accompanying drawing 5
7. carry out the network tree routing algorithm then, divide three parts:
7.1 the fixed route table forms algorithm
7.1.1 the formation of node routing iinformation
According to the topology information that diakoptic algorithm forms, carry out shortest path first computing node routing table.
7.1.2 the formation of domain addresses routing iinformation
Domain addresses information D RI is two tuples＜domain address, cost 〉
Initialization.If this node is an associated nodes, then form the DRI in the territory that links to each other with this node, putting cost is 0, to non-this domain node transmission.
When node receives a DRI,, ignore if link to each other or the DRI in this territory with this node.Otherwise, upgrade routing table about this domain addresses, if route table items changes, then after the cost renewal with this DRI, send this DRI to all nodes except that sending node.
7.2 inter-domain routing algorithm
Ant packet ADP is a five-tuple＜src, dst, cn, success, Path 〉, wherein, src represents source node; Dst represents destination node; Cn represents the next associated nodes of this ant searching route; Success is a flag bit, and whether representative is first ant that returns; Path is the set of a node, and it writes down all nodes that this ant is passed by from the source node to the present node.
Routing device is with the route data packets of the receiving processing of classifying:
If the ant packet changes step 7.2.1.
If packet changes step 7.2.2.
7.2.1 if the ant packet, according to the information and executing corresponding actions of this bag:
If this node is a source node,, upgrade variable routing table if success is 1;
If this node is a destination node, if first ADP that this ADP is a source node to be arrived to destination node puts 1 with the success of ADP, take out last node from Path, send ADP to this node; Otherwise, abandon this ADP;
If this node if success is 1, is updated to the route of destination node neither source node is not again a destination node, take out last node from Path, send ADP to this node; Otherwise, be that source node arrives first ADP that destination node arrives if this node is associated nodes among the ADP and this ADP, send ADP according to the position of destination node, otherwise the ADP if not first arrival abandons it; If this node is not an associated nodes, to next jumping transmission ADP of associated nodes cn.
7.2.2 if packet, according to the information and executing corresponding actions of this bag:
If this bag sends according to domain addresses, continue to send to next jumping in this territory according to domain addresses; Otherwise, if the address of destination node in routing table, sends according to node address; Otherwise, if not in routing table, should wrap, and send the path that ADP searches for this packet rs destination node according to the domain addresses transmission.
Claims (5)
1. the method for routing based on layered structured applying groups intelligence is characterized in that, in the network that is made of routing device, the route step is as follows:
1) determines the physical label and the interface identifier of every physical network interface of routing device, determine routing device residing level in the network tree model, and make up the neighbor information tabulation according to the ability to communicate of link;
2) the network tree model of design according to the present invention, the routing device operational network is cut apart module existing network is cut apart, according to network tree model construction network;
3) the fixed route table of design generates algorithm according to the present invention, makes up routing table in the internal storage of routing device;
4) when routing device receives that the destination node address is not in routing table, the inter-domain routing algorithm of design is sought the path according to the present invention, and upgrades variable routing table;
5) send the present node state information according to the time interval of determining to the territory interior nodes, in order to form the fixed route table again.
2. a kind of method for routing based on layered structured applying groups intelligence according to claim 1 is characterized in that the network tree model is: network N=(W), wherein V is limited set of node for V, A, and A V * V is limited link set; W={w (a) | a ∈ A}, w is A → R
+The link metric mapping function.The network tree model be N_Tree=(T, H), wherein T is the territory set of N; If T only contains a territory, H=Φ then, otherwise H is the binary crelation that is defined on the T; Have unique territory root that is called root in T, it is concerning not have definition under the H; If T-{root} ≠ Φ then exists one of T-{root} to divide T
1, T
2, Λ, T
n(n＞0), j ≠ k, 1≤j, k≤n has T
j∩ T
k∈ V, and to i arbitrarily, there is unique territory m in 1≤i≤n
i∈ T
i, m is arranged＜root
i＞∈ H; Corresponding to the division of T-{root}, H-{＜root, m
1＞, Λ,＜root, m
n＞have unique one to divide H
1, H
2, Λ, H
n, j ≠ k, 1≤j, k≤n has H
j∩ H
k=Φ, and i, 1≤i≤n, H
iBe T
iOn binary crelation, (T
i, H
i) be a network tree that meets this definition, be called the subtree of rhizosphere root.
3. a kind of method for routing based on layered structured applying groups intelligence according to claim 1 is characterized in that routing device is at first carried out diakoptic algorithm, forms the network tree model; The method that forms the network tree model is: at first, each node is determined the level of oneself according to the link of the bandwidth maximum that links to each other with oneself, and forms the link state packets of oneself, sends to neighbor node; Then, when node receives link state packets, according to this node and the definite processing mode of sending node hierarchical relationship to this link state packets; When having moved this algorithm, each node has all been grasped the information of its place domain node; Node address begins recurrence by associated nodes from rhizosphere and distributes.
4. a kind of method for routing based on layered structured applying groups intelligence according to claim 1 is characterized in that the construction method of routing table is: this table comprises fixed route table and variable routing table two parts; What store in the fixed route table is the routing iinformation of node in the territory, routing device place, and variable routing table storage is the routing iinformation of non-domain node of visit recently; The structure that they adopt is identical, comprises next and jumps route sublist P, by destination node index list item, P
jRepresentative next jumping from present node to destination address j optimal path; Measure route sublist D, by destination node index list item, each element D
jBe weights from present node to destination address j optimal path; Destination node is made up of class address, territory and node class address two parts.
5. a kind of method for routing according to claim 1 based on layered structured applying groups intelligence, it is characterized in that, when routing device receives that the destination node address is not during the packet in routing table, relevant router calls the inter-domain routing algorithm and forms the path that arrives destination node, and the transmission types item of current packet is changed to according to class address, territory and sends; The inter-domain routing algorithm comprises transmission ant packet, receives ant packet and three modules of receiving data information; Be responsible for the foundation of inter-domain routing information and the reception and the transmission of data message respectively.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2005100476911A CN1761236A (en) | 2005-11-08 | 2005-11-08 | Intelligent routing method based on layered structured applying groups |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2005100476911A CN1761236A (en) | 2005-11-08 | 2005-11-08 | Intelligent routing method based on layered structured applying groups |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN1761236A true CN1761236A (en) | 2006-04-19 |
Family
ID=36707183
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNA2005100476911A Pending CN1761236A (en) | 2005-11-08 | 2005-11-08 | Intelligent routing method based on layered structured applying groups |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1761236A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103164199A (en) * | 2011-12-14 | 2013-06-19 | 中国银联股份有限公司 | Application model generating device and application model generating method based on layered structure |
| CN111698163A (en) * | 2020-05-29 | 2020-09-22 | 深圳市永达电子信息股份有限公司 | OVS-based full-switching network communication method, device and medium |
| CN112970231A (en) * | 2018-09-10 | 2021-06-15 | 极进网络公司 | Method for intelligent multi-hop overlay routing |
| CN114157594A (en) * | 2021-11-02 | 2022-03-08 | 北京中合谷投资有限公司 | Open source router for distributed network |
-
2005
- 2005-11-08 CN CNA2005100476911A patent/CN1761236A/en active Pending
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103164199A (en) * | 2011-12-14 | 2013-06-19 | 中国银联股份有限公司 | Application model generating device and application model generating method based on layered structure |
| CN103164199B (en) * | 2011-12-14 | 2016-05-18 | 中国银联股份有限公司 | Application model generating apparatus and method based on hierarchy |
| CN112970231A (en) * | 2018-09-10 | 2021-06-15 | 极进网络公司 | Method for intelligent multi-hop overlay routing |
| CN111698163A (en) * | 2020-05-29 | 2020-09-22 | 深圳市永达电子信息股份有限公司 | OVS-based full-switching network communication method, device and medium |
| CN114157594A (en) * | 2021-11-02 | 2022-03-08 | 北京中合谷投资有限公司 | Open source router for distributed network |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1655556A (en) | A routing method based on dynamic aggregation tree model | |
| Singla et al. | Scalable routing on flat names | |
| Godfrey et al. | Heterogeneity and load balance in distributed hash tables | |
| US8675672B1 (en) | Hierarchical cluster tree overlay network | |
| US8861527B1 (en) | Network-assisted routing for topology-aware overlay networks | |
| US10554555B2 (en) | Hash-based overlay routing architecture for information centric networks | |
| Herzen et al. | Scalable routing easy as PIE: A practical isometric embedding protocol | |
| CN100493003C (en) | Automatic discovering and managing method for extendable interconnection network measurement server | |
| CN102421162B (en) | Hybrid router supporting IPv6 (Internet Protocol version 6) wireless sensor network | |
| US11502956B2 (en) | Method for content caching in information-centric network virtualization | |
| Kalghoum et al. | Fcr-ns: a novel caching and forwarding strategy for named data networking based on software defined networking | |
| Torres et al. | Evaluating CRoS-NDN: a comparative performance analysis of a controller-based routing scheme for named-data networking | |
| Zhong | An IPv6 address lookup algorithm based on recursive balanced multi-way range trees with efficient search and update | |
| CN112399485A (en) | CCN-based new node value and content popularity caching method in 6G | |
| CN109450795A (en) | A kind of service router and service network system of service-oriented network | |
| CN105681438A (en) | Centralized caching decision strategy in content-centric networking | |
| Moeini et al. | Efficient caching for peer-to-peer service discovery in internet of things | |
| CN1761236A (en) | Intelligent routing method based on layered structured applying groups | |
| Nguyen et al. | Adaptive caching for beneficial content distribution in information-centric networking | |
| CN1710886A (en) | Distribution type QoS multi-broadcast routing method based on mobile Ad Hoc network | |
| CN108183867B (en) | Information center network node cache replacement method | |
| Li et al. | SPARC: Towards a scalable distributed control plane architecture for protocol-oblivious SDN networks | |
| CN108093056B (en) | Node cache replacement method in information center wireless network virtualization network | |
| Ahmed et al. | $\alpha $ Route: Routing on Names | |
| Viana et al. | Twins: a dual addressing space representation for self-organizing networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |