CN100539598C - Method based on the multiple overseas service quality of support of routing information protocol - Google Patents

Method based on the multiple overseas service quality of support of routing information protocol Download PDF

Info

Publication number
CN100539598C
CN100539598C CNB2007101003238A CN200710100323A CN100539598C CN 100539598 C CN100539598 C CN 100539598C CN B2007101003238 A CNB2007101003238 A CN B2007101003238A CN 200710100323 A CN200710100323 A CN 200710100323A CN 100539598 C CN100539598 C CN 100539598C
Authority
CN
China
Prior art keywords
pva
routing
grouping
router
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.)
Expired - Fee Related
Application number
CNB2007101003238A
Other languages
Chinese (zh)
Other versions
CN101068249A (en
Inventor
崔勇
周云涛
桂涛
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Tsinghua University
Original Assignee
Tsinghua University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Tsinghua University filed Critical Tsinghua University
Priority to CNB2007101003238A priority Critical patent/CN100539598C/en
Publication of CN101068249A publication Critical patent/CN101068249A/en
Application granted granted Critical
Publication of CN100539598C publication Critical patent/CN100539598C/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention belongs to router forwarding information agreement, it is characterized in that, dispose routing information protocol in router, primary circuit routing information is path vector information PVA grouping in the protocol packet.The PVA grouping is produced by domain border router, and sends to the border router in adjacent different autonomous territories.Carry all optimum routes that the router that produces this PVA grouping arrives some purpose network address prefixes in each PVA grouping.When receiving the PVA grouping that the border router in adjacent other territories sends, upgrades border router local path information, calculate the optimum route of corresponding purpose network address prefix then, and these routes are sent to the border router in other adjacent territories with the form of PVA grouping, and these routes are sent to routing management module.When border router receives that routing management module heavily distributes in the territory come route, these routes are sent to the border router in adjacent other territories with the form of PVA grouping, upgrade routing information in the local domain simultaneously.

Description

Method based on the multiple overseas service quality of support of routing information protocol
Technical field
Method based on the multiple service quality of support of RIP agreement belongs to Internet technical field, relates in particular to the router retransmission technique of network layer.
Background technology
RIP (Routing Information Protocols, routing information protocol) is to use distance vector protocols the most widely, and it is developed in the seventies by Xerox (Xerox).At that time, RIP was the part of XNS (Xerox Network Service, Xerox's network service) protocol family.The RIP of TCP/IP version is the modified version of Xerox's agreement.The characteristics of RIP maximum are, no matter realize principle or collocation method, and are all very simple.The tolerance of RIP is based on jumping figure (hops count), and every through a router, the jumping figure in path adds one.Thus, jumping figure is many more, and the path is just long more, and the RIP algorithm can preferentially be selected the few path of jumping figure.The maximum hop count that RIP supports is 15, is that 16 network is considered to unreachable.The renewal of route realizes by fixed time broadcast among the RIP.Under the default situation, router was every 30 seconds routing tables to the Web broadcast that links to each other with it oneself, and the router of receiving broadcasting is added into the information of receiving in the routing table of self.Each router is so broadcasting all, and all routers all can be learnt whole routing iinformations on the final network.Under the normal condition, router just can be received a routing iinformation affirmation in per 30 seconds, if through 180 seconds, i.e. 6 update cycles, a route entry does not all obtain confirming that router just thinks that it had lost efficacy.If through 240 seconds, i.e. 8 update cycles, route entry does not still obtain confirming that it is just deleted from routing table.Above 30 seconds, the time-delay of 180 seconds and 240 seconds is all by timer control, they are respectively renewal timer (Update Timer), invalid timers (Invalid Timer) and refresh timer (Flush Timer).Though RIP is simple, and long-tested, also exist some very important defectives, mainly contain following some: too simple, be according to computing metric with jumping figure, often draw non-optimum route; Metric exceeds with 16, is not suitable for big network; Poor stability is accepted the routing update from any equipment; Do not support not have class IP address and VLSM (Variable Length SubnetMask, VLSM); Convergence is slow, and the time is often greater than 5 minutes; Bandwidth consumed is very big.Therefore in order to support multiple service quality, need design the Extended Protocol of oneself
Summary of the invention
In Internet, move inter-domain routing protocol between the border router of different autonomous system.We pass through the thought in conjunction with bgp protocol and RIP agreement, and have realized QoS Routing Protocol between the territory by simplified design.Primary circuit routing information is path vector information (Path Vector Advertisement is called for short the PVA grouping) in the protocol packet.The PVA grouping is produced by domain border router, and sends to the border router in adjacent different autonomous territories.Carry all optimum routes that the router that produces this PVA grouping arrives some purpose network address prefixes in each PVA grouping.When receiving the PVA grouping that the domain border router in adjacent other territories sends, upgrades border router the routing information of local maintenance, calculate the optimum route of corresponding purpose network address prefix then according to the routing information after upgrading, and these routes are sent to the border router in other adjacent territories with the form of PVA grouping, simultaneously these routes are sent to routing management module.When border router receives that routing management module heavily distributes in the territory come route, these routes are sent to the domain border router in adjacent other territories with the form of PVA grouping, upgrade routing information in the local territory of being safeguarded simultaneously.The PVA grouping is produced by border router, is responsible for the mutual routing iinformation of border router with other adjacent territory.The optimal path that in PVA grouping, carries for the border router that produces this PVA grouping each network address prefix in the territory.Article one, only be carried to many optimum routes of a network address prefix in the PVA grouping.When border router sends PVA when grouping of certain COS, with in the routing table of this COS to the optimum routed encapsulation of given network address prefix in same PVA grouping.
This method contains following steps successively:
Step (1) all will dispose the QRIP agreement on the border router in each territory.Routing Protocol bag (PVA grouping) exchanges between the border router in adjacent different autonomous territories, is carried to the optimum route of some purpose network address prefixes in a PVA grouping;
When receiving the PVA grouping that the border router in other adjacent territory sends, step (2) finishes following steps successively:
Step (2.1) judges according to the sequence number of PVA grouping whether this PVA grouping is out-of-date, if out-of-date, then changes step (2.1.1), if not out-of-date, then changes step (2.1.2);
Step (2.1.1) directly abandons and does not deal with;
Step (2.1.2) is broadcasted this PVA grouping to the border router in other adjacent territory, path vector information that grouping is carried according to PVA and local router are to the routing iinformation of the router that produces this PVA grouping, calculate local router to the optimum route of other territory purpose network address prefix, and with routing update in the inter-domain routing table.Notify the information of routing update then to routing management module.
When receiving in the territory that routing management heavily distributes route, step (3) finishes following steps successively:
Step (3.1) with this routing update in the inter-domain routing table;
Step (3.2) sends the PVA grouping of the routing iinformation that carries renewal to the border in other adjacent territory intradomain router.
Test environment of the present invention is made up of tester (Tester), the testing server (Tester Server) of five QoSR router prototypes (R1 is to R5), a streaming media server (Server), five stream media receiving client terminals (Clientl is to Client5) and we oneself exploitation, the all-network interface all adopts Intel 82559 100 m ethernet cards, in order to simulate the situation of Internet resources deficiency, the author carries out Flow Control by software, guarantee each network interface card under the full duplex mode of operation unidirectional flow restriction at 10Mbps.Realized method by this test environment based on the multiple service quality of support of routing information protocol.
Description of drawings
Fig. 1 .PVA packet format that divides into groups;
Fig. 2. with the routing management module communication scheme;
Fig. 3. experimental situation figure;
Fig. 4. flow chart.
Embodiment
Receive the PVA grouping grouping that the border router in other adjacent territory sends: when QRIP receives PVA grouping grouping, at first judge according to the sequence number of PVA grouping whether this PVA grouping is out-of-date:, directly abandon and do not deal with if out-of-date; Otherwise broadcast this PVA grouping to the border router in other adjacent territory, routing information that grouping is carried according to PVA and local router are to the routing iinformation of the router that produces this PVA grouping simultaneously, calculate local router to the optimum route of other territory purpose network address prefix, and with routing update in the inter-domain routing table.Notify the information of routing update then to routing management module.
Receive route in the territory that routing management heavily distributes: when QRIP receives that routing management heavily distributes in the territory come route, this routing update in the inter-domain routing table, is sent the PVA grouping of the routing iinformation that carries renewal simultaneously to the border in other adjacent territory intradomain router.Because the restriction of IP block length once may produce a plurality of PVA groupings, notice that the optimal path information that will have identical purpose network address prefix is encapsulated in the same PVA grouping.If can not load all routing informations of same purpose prefix during a PVA divides into groups, then directly abandon the information of overflowing.
The PVA grouping is united expression by two data structures: qosExrPVA grouping and qosExrPathEntry.The pointer that the former comprises the head common information of PVA grouping and points to routing information entrained in the PVA grouping; QosExrPathEntry represents a paths information, and a plurality of qosExrPathEntry constitute chained list and represent all entrained routing informations in the PVA grouping.
Specific algorithm is as follows:
The qosExrPVA grouping
Struct qosExrPVA grouping
{
Uint8_t type; / * is corresponding to the Type territory of protocol package.*/
Uint8_t path_num; / * represents the number of routing information entrained in the PVA grouping corresponding to the #of Path territory of protocol package.*/
Uint8_t qos_map; / * is corresponding to the QoS Map territory in the protocol package.*/
Uint32_t ad_router; / * is corresponding to the Advertising Router territory in the protocol package.*/
Uint8_t seq_num; / * is corresponding to the Sequence Number territory in the protocol package.*/
Struct in4_addr dst_addr; / * is corresponding to the Destination Network Address territory of protocol package.*/
Struct in4_addr net_mask; / * is corresponding to the Network Mask territory of protocol package.*/
Struct qosExrPathEntry*pInfo; / * points to the routing information that the PVA grouping is carried.May there be many optimal paths owing to arrive the consolidated network address prefix, therefore in a PVA grouping, can carry mulitpath information.These routing informations by the next pointer chain together.*/
};
qosExrPathEntry
struct?qosExrPathEntry
{
Struct qosExrPathEntry*next; / * points to next paths information, relevant routing information by the next pointer link */
Struct in4_addr dst_addr; The purpose network address that this routing information of/* points to.*/
Struct in4_addr net_mask; The mask of the purpose network address that this routing information of/* points to.*/
QOS_METRIC_VALUE qos_metrics[QOS_METRICS_CUR_NUM]; The quality of service measures * in/* path/
Uint16_tas_num; This routing information of/* the number in autonomous territory of process, comprise the autonomous territory at border router and purpose router place.*/
Uint16_t*pAs; The array in the autonomous territory of this path process is deposited in/* sensing in proper order.*/
Uint16_t origin; It is which edge of table circle router sends over by the PVA grouping that/* writes down this paths information, and record sends the id of router among the origin.*/
};
Use qosExrPathTable to represent the routing information table, adopt the form of Hash table to come store path information therein.
qosExrPathTable
struct?qosExrPathTable
{
Uint8_t serv_type; The COS * of this routing information table correspondence of/*/
Struct qosExrPathEntry*pHash[QOS_HASH_BUCKET_NUM]; The form * of/* routing information table employing Hash table/
Uint8_t qos_map; The QoS tolerance * that routing information has in/* routing information the table/
SEM_ID path_table_sem_id; The mutex amount * of/* courses of action information table/
}
The main processing function of this submodule is divided into 2 parts:
(1) PVA packet handler function is responsible for the PVA grouping grouping of receiving is handled.
(2) routing information safeguard function, comprise the initialization of routing information table, in information table, add, upgrade, deletion one paths information.

Claims (1)

1, based on the method for multiple service quality outside the support region of routing information protocol, it is characterized in that, contain following steps successively:
Step (1): configuration service quality routing information protocol QRIP all on the border router in each territory, path vector information (PVA), and inter-domain routing table, Routing Protocol bag PVA is grouped between the border router in adjacent different autonomous territories and exchanges, in a Routing Protocol bag PVA grouping, except the optimum route that is carried to some purpose network address prefixes, also comprise following data item: type Type at least, the number #of Path of path vector information, the mapping QoS Map of service quality, produce the IP of the router of routing link state advertisement LSA, the IP of the router of the generation routing link state advertisement LSA that represents with Advertising Router, sequence number Sequence Number, purpose network address Destination NetworkAddress, the subnet mask Network Mask of network interface, quality of service measures Qos Mtr.n, autonomous territory number #Of AS; If judge receive that border router sends be the PVA grouping time, execution in step (2); If receive routing management module in the territory of distributing during route, execution in step (3);
Step (2): during described Routing Protocol bag PVA grouping that local router receives that the border router in other adjacent territory sends, the sequence number that the time of advent, whether sequence number was used early than the judgement of prior setting the time of advent according to this Routing Protocol bag PVA grouping, determine whether this Routing Protocol bag PVA grouping is out-of-date, if early than the described judgement sequence number of the time of advent, then abandon, otherwise, just broadcast this Routing Protocol bag PVA grouping to the border router in other adjacent territories, path vector information (PVA) that grouping is carried according to this Routing Protocol bag PVA and described local router are to the routing iinformation of the router that produces this Routing Protocol bag PVA grouping simultaneously, calculate by the optimum route of local router to other territory purpose network address prefixes, and routing update in the inter-domain routing table, then to the information of routing management module notice routing update;
Step (3): when receiving in the territory that routing management module heavily distributes route, this routing update in the inter-domain routing table, is sent the Routing Protocol bag PVA grouping of the routing iinformation that carries renewal simultaneously to the border in other adjacent territory intradomain router.
CNB2007101003238A 2007-06-08 2007-06-08 Method based on the multiple overseas service quality of support of routing information protocol Expired - Fee Related CN100539598C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CNB2007101003238A CN100539598C (en) 2007-06-08 2007-06-08 Method based on the multiple overseas service quality of support of routing information protocol

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNB2007101003238A CN100539598C (en) 2007-06-08 2007-06-08 Method based on the multiple overseas service quality of support of routing information protocol

Publications (2)

Publication Number Publication Date
CN101068249A CN101068249A (en) 2007-11-07
CN100539598C true CN100539598C (en) 2009-09-09

Family

ID=38880685

Family Applications (1)

Application Number Title Priority Date Filing Date
CNB2007101003238A Expired - Fee Related CN100539598C (en) 2007-06-08 2007-06-08 Method based on the multiple overseas service quality of support of routing information protocol

Country Status (1)

Country Link
CN (1) CN100539598C (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101459698B (en) * 2007-12-14 2012-11-14 中国人民解放军信息工程大学 Intra-domain and inter-domain network interconnecting method and system thereof
CN101599893B (en) * 2008-06-02 2012-07-04 华为技术有限公司 Domain split network and method for obtaining network topology map of domain split network
CN108574628B (en) * 2017-03-13 2022-09-27 中兴通讯股份有限公司 Method, device and system for establishing domain-level topology

Also Published As

Publication number Publication date
CN101068249A (en) 2007-11-07

Similar Documents

Publication Publication Date Title
JP7417825B2 (en) slice-based routing
CN102150148B (en) Differentiated services for unicast multicast frames in layer 2 topologies
US8111618B2 (en) End-to-end service quality using source-routed probes
CN1216472C (en) Control method for layered switching network node region
US20150249587A1 (en) Method and apparatus for topology and path verification in networks
CN106063195A (en) Control device discovery in networks having separate control and forwarding devices
CN105847069A (en) Physical path determination for virtual network packet flows
US11050663B2 (en) Fast and loss-free local recovery by a RPL parent device
CN106105130A (en) Carry the source routing of entropy head
CN109417508A (en) The connection and access of hierarchical path computing unit (PCE)
CN106878186B (en) The method of routing update, the network equipment and system in network
CN104396199A (en) Adaptive MTU size optimization using IGP
CN103152284A (en) Method for balancing multipath output intelligent loads of router and router
WO2017058908A1 (en) Generating service-optimized paths based on enhanced eigrp telemetry
US20230231795A1 (en) Method for Synchronizing Topology Information in SFC Network, and Routing Network Element
CN105282041A (en) Method and device of flooding on the basis of ISIS (intermediate system to intermediate system)
TWI543567B (en) Device for multipath routing of packets in computer networking and method thereof
CN100539598C (en) Method based on the multiple overseas service quality of support of routing information protocol
CN103746828B (en) A kind of method and device for managing network node
CN105227458A (en) The route computing method of TRILL ISIS and device
Sampath et al. " Ethernet on AIR': Scalable Routing in very Large Ethernet-Based Networks
WO2022142932A1 (en) Route processing method, and related apparatus and network system
CN106254241B (en) A kind of trans-regional CSPF the whole network calculating implementation method based on IGP
Murthy Routing in packet-switched networks using path-finding algorithms
CN104660504A (en) A device for multipath routing of packets in computer networking and the method for its use

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
C17 Cessation of patent right
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20090909

Termination date: 20120608