WO2006042472A1 - Procede de mise en oeuvre de transmission satisfaisante de flux dans le reseau en anneau mpls - Google Patents

Procede de mise en oeuvre de transmission satisfaisante de flux dans le reseau en anneau mpls Download PDF

Info

Publication number
WO2006042472A1
WO2006042472A1 PCT/CN2005/001723 CN2005001723W WO2006042472A1 WO 2006042472 A1 WO2006042472 A1 WO 2006042472A1 CN 2005001723 W CN2005001723 W CN 2005001723W WO 2006042472 A1 WO2006042472 A1 WO 2006042472A1
Authority
WO
WIPO (PCT)
Prior art keywords
service
ring network
packet
fair
mpls
Prior art date
Application number
PCT/CN2005/001723
Other languages
English (en)
Chinese (zh)
Inventor
Yuli Shi
Huaixue Wan
Xingyue Quan
Yang Yang
Original Assignee
Huawei Technologies Co., Ltd.
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 Huawei Technologies Co., Ltd. filed Critical Huawei Technologies Co., Ltd.
Publication of WO2006042472A1 publication Critical patent/WO2006042472A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/42—Loop networks

Definitions

  • the present invention relates to the field of multi-protocol label switching (MPLS) technology, and in particular, to a method for implementing fair delivery of traffic in an MPLS ring network.
  • MPLS multi-protocol label switching
  • the Multi-Service Transport Node based on the Synchronous Digital Sequence (SDH) system can well support Time Division Multiplexing (TDM) voice services and Digital Data Network (DDN) leased line services, but the support for IP packet services is poor.
  • TDM Time Division Multiplexing
  • DDN Digital Data Network
  • Ethernet technology can support IP packet services very well. It is characterized by simplicity, easy expansion, and low price. It has been widely used in LAN and metropolitan area networks. However, Ethernet technology does not meet the reliability and scalability requirements of metropolitan area networks due to the lack of carrier-class quality of service (QoS), network fast protection, recovery, and sophisticated operation and management (OAM). Correspondingly, the automatic discovery of the media access control (MAC) layer topology is slow and inefficient.
  • QoS carrier-class quality of service
  • OFAM network fast protection
  • OAM operation and management
  • MAC media access control
  • Resilient Packet Network (RPR) technology combines the advantages of Ethernet technology, Asynchronous Transfer Mode (ATM) technology, and SDH technology. Through the fair algorithm, the reuse problem of bandwidth between sites is well solved; the protection of loopback (Wrapping) and source routing (Steering) is provided, and the protection time is limited to 50ms; at the same time, high, medium and low are provided.
  • a differentiated service with business priorities and a relatively complete OAM function is a more economical metro (MAN) solution.
  • NTN Next Generation Network
  • NGN transport layer networks urgently need to be able to uniformly carry multiple services.
  • a type of transport ring network technology that provides better QoS, is suitable for MAN and wide area network (WAN) applications, and is flexible and low-cost. To this end, the corresponding MPLS ring network technology has emerged.
  • Congestion is a common phenomenon in communication systems, but in the existing MPLS ring network technology, there is no control for congestion.
  • the bandwidth of the high-priority service available in the link is as good as possible
  • the remaining bandwidth of the service is less than the total bandwidth of the best-effort service, so that when congestion occurs, if multiple best-effort transmissions are transmitted, Trying to transmit the characteristics of the service itself to preempt the bandwidth will cause some of the bandwidth that the best-effort transmission service can occupy, while other efforts to transmit the service can only occupy the remaining bandwidth required by itself, resulting in the node trying to transmit the service. Unfair transmission. Further, in the case of congestion, due to unfair transmission, it is often the case that one or several of the best efforts to transmit the traffic cannot be transmitted.
  • the general service shield does not require the best-effort service, but if a best-effort service fails to transmit at a certain node, it is unbearable for the user.
  • the three nodes S1, S2, and S3 all transmit traffic to the node S4.
  • the total bandwidth of the link is 10M.
  • node S1 sends 6M service
  • node S2 sends 5M service
  • node S3 sends 2M service
  • the service is trying to transmit service.
  • Bandwidth characteristics on the S2 node, the 5M service to be sent by the S2 node is only Can get 4M bandwidth.
  • the S3 node since the total bandwidth of the link 10M has been completely preempted by the services sent by the S1 node and the S2 node, and no bandwidth is allocated to the 2M service to be sent by the node, the 2M service cannot be sent to the S4.
  • an object of the present invention is to provide a method for implementing fair delivery of traffic in an MPLS ring network, which can implement fair transmission of best effort transmission services in an MPLS ring network.
  • the present invention provides a method for implementing fair delivery of traffic in an MPLS ring network, including:
  • A. Determine, according to the information carried in the MPLS packet, a packet that attempts to transmit the service
  • the information carried in the MPLS packet may be: a service transmission value set in an EXP field of an experimental domain in an MPLS packet;
  • step A is:
  • the service transmission value carried in the EXP field of the packet received by the MPLS ring network node is smaller than a preset threshold, it is determined that the packet is a packet that tries to transmit the service.
  • the information carried in the MPLS packet may also be: a best-effort service flag set in the best-effort service packet;
  • step A is:
  • said best effort delivery service flag is set in a fixed bit of the message EXP field.
  • the information carried in the MPLS packet may also be: an LSP label value;
  • step A is:
  • the label exchange path LSP label value of the received packet is a pre-configured dedicated label value of the LSP transmitting the best effort transmission service, it is determined that the message is a best effort transmission service message.
  • the information carried in the MPLS packet may also be: an LSP label value and a service transmission value set in an EXP field of the packet;
  • step A is:
  • the packet is a packet that tries to transmit the service.
  • the step B may include:
  • the upstream ring network node that knows the fair rate adjusts the bandwidth of the corresponding best-effort service based on the fair rate, and transmits the best-effort service packet according to the bandwidth.
  • step B2 may include:
  • the hop count of the packet being forwarded and the identifier of the MPLS ring network node are sent to the upstream ring network node together with the fair rate.
  • the information sent to the upstream ring network node is carried by the flow control message.
  • the information sent to the upstream ring network node is transmitted through an LSP channel that transmits control information.
  • the upstream ring network node that knows the fair rate adjusts the bandwidth of the corresponding best effort service packet based on the fair rate:
  • the upstream ring network node calculates, by using a fairness algorithm, a fair rate of the best-effort transmission service according to the received information.
  • the upstream ring network node adjusts the bandwidth of the best-effort service of the local upper ring according to the calculated fair rate, and sends the calculated fair rate to the upstream ring network node of the upstream ring network node.
  • step B32 may include: performing an initial ring network node of the upstream ring network node that receives the fair rate, and performing step B31 and step B32.
  • the method for adjusting the traffic of the best-effort service of the local upper ring according to the calculated fair rate may be:
  • the method for adjusting the traffic of the best-effort service of the local upper ring according to the calculated fair rate may also be:
  • the method for adjusting the traffic of the best-effort service of the local upper ring according to the calculated fair rate may also be:
  • the link layer flow control information is sent to the service source direction, and the transmission traffic of the best-effort transmission service is adjusted; and the data packet exceeding the fair rate portion of the local uplink service is discarded.
  • the present invention can identify the best-effort transmission service according to the information carried by the packet on the node of the MPLS ring network, and then use the fairness algorithm to perform the best-effort transmission.
  • the bandwidth that can be occupied by the service is distributed fairly, so as to ensure that each of the best-effort transmission services transmitted by each network node in the MPLS ring network can occupy the remaining bandwidth resources of the high-priority service fairly and reasonably.
  • the invention effectively The problem that the services of some nodes that may occur in the prior art cannot be sent out at the same time is solved.
  • Figure 1 is a schematic diagram of MPLS network service transmission
  • FIG. 2 is a schematic diagram of preempting bandwidth of each service in FIG. 1;
  • FIG. 4 shows the format of an MPLS packet. Mode for carrying out the invention
  • the core idea of the present invention is to identify the best-effort transmission service in the MPLS ring network, and allocate the bandwidth available to the best-effort transmission service for all the best-effort transmission services, so as to ensure that each best-effort transmission service can fairly occupy the remaining high-priority service. Bandwidth resources.
  • FIG. 3 A specific embodiment of the method for implementing fair delivery of traffic according to the present invention is shown in FIG. 3, and mainly includes the following steps:
  • Step 31 Determine, on the MPLS ring network node, the best-effort service according to the information carried in the received packet. That is, when the ring network node is congested, the corresponding best-effort service packet is determined from the packet received by the ring network node, so that the best-effort transmission service is processed based on the traffic fair delivery.
  • the experimental domain ( EXP ) field reserved in the MPLS packet label Label can be used to identify the best-effort transmission service by carrying the service transmission value in the field.
  • the best effort transmission service is identified according to the service transmission value of the EXP field, it is necessary to manually configure a threshold in the MPLS ring network node.
  • the value of the EXP field in the message label is set for the best effort delivery service, the value is set to be smaller than the above threshold, and the report is set for the non-best effort transmission service.
  • the value of the EXP field in the text tag is set to a value greater than or equal to the above threshold.
  • the packet is determined to be a packet for best effort transmission.
  • the structure of the MPLS packet label is shown in Figure 4.
  • the EXP field has 3 bits, and the field can take a value of 0 to 7.
  • a fixed bit in the EXP field may also be utilized, and the fixed bit is set to the best effort service flag for the best effort transmission service in the service transmission process to distinguish it from other services. For example, for the first bit of the EXP field, if the bit is set to 0 if it is a best effort service, then this 0 is the best effort service flag; if it is a non-best effort service, the bit is set to 1. In this way, the MPLS ring network node can judge whether the received service packet is a best-effort service according to the value of the bit.
  • the service packet discussed in the present invention is a service packet transmitted in the MPLS ring network. Therefore, the MPLS ring network node can also identify the best-effort service packet according to the label value of the LSP. To this end, each node in the MPLS ring network needs to set a dedicated label value of a group of LSPs that transmit the best-effort transmission service, and when transmitting the best-effort transmission service, the best-effort transmission service is transmitted by using the configuration-dedicated LSP, so that The ring network node can determine the best-effort service packet in the received service packet according to the label value.
  • whether the service packet received by the ring network node is a best-effort service packet is determined according to the combination of the label value and the EXP field value of the LSP. For example, for a service transmitted by an LSP corresponding to a preset set of LSP label values, a judgment threshold according to whether it is a best-effort transmission service is 5; for an LSP corresponding to another set of LSP label values, The service, based on the judgment of whether it is trying to transmit the service, is based on a judgment threshold of 3.
  • Step 32 In the MPLS ring network, calculate, according to a fairness algorithm, a bandwidth that the best effort transmission service can occupy, that is, a transmission rate of the allowed best effort transmission service.
  • each ring In this step, for the inner ring and the outer ring of the MPLS ring, two different loop directions, each ring The calculations are performed independently by using the fairness algorithm. Since the calculation method performed on each ring and the subsequent steps performed are the same, they are not separately described in this embodiment.
  • the specific fairness algorithm uses the IEEE 802.17 RPR standard algorithm, which includes the following two steps:
  • the transmission rate calculated by the above algorithm is the transmission rate of each best effort transmission service allowed, that is, the bandwidth that each best effort transmission service can occupy. Since the algorithm for calculating the rate is basically the same as the existing standard algorithm, it will not be described in detail here.
  • Step 33 The MPLS ring network node controls the traffic of the local uplink service according to the calculated fair rate, and carries the bandwidth information that can be occupied by the calculated best-effort service in the flow control message to the upstream node in the MPLS ring network. Transfer.
  • the traffic control of the local uplink service mainly refers to the processing of the part of the local upper ring service that exceeds the fair bandwidth.
  • the following two different processing methods can be adopted:
  • the packet loss mode is to discard the data packet that exceeds the fair bandwidth part of the local uplink service.
  • WRED weighted random early detection
  • the bandwidth information that can be occupied by the determined best-effort transmission service is carried in the flow control message and transmitted to the upstream node in the MPLS ring network, so as to adjust the best-effort transmission sent by the upstream node to the failed node. Traffic to the business. Since all neighboring nodes on the MPLS ring network create a bidirectional LSP channel, this step is transmitted in this channel.
  • a flow control packet carrying a calculation result of the fairness algorithm, where the flow control packet may include the following fields:
  • the fair rate of announcement calculated using the fairness algorithm that is, the transfer rate calculated in step 32;
  • Step 34 After receiving the flow control packet, the upstream node in the MPLS ring network controls the traffic of the best-effort service packet according to the information carried in the packet.
  • the upstream node that receives the flow control packet in this step can directly control the local ring-ring service according to the fair rate in the packet.
  • the control mode is the same as that of the local ring-ring service in the step 33;
  • the received flow control message is forwarded to the upstream node.
  • the upstream node that receives the flow control message in this step may also perform flow control after calculating the fair bandwidth of each best effort transmission service in the node according to the fairness algorithm.
  • the specific control mode is the same as that of the step 33, that is, the flow control of the local uplink service is performed, and the flow control message is sent to the upstream node to control the traffic of the best-effort service sent by the upstream node.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Small-Scale Networks (AREA)

Abstract

L'invention concerne un procédé de mise en oeuvre de transmission satisfaisante de flux dans le réseau en anneau MPLS : détermination de messages de service optimal selon l'information des messages MPLS ; détermination de la largeur de bande satisfaisante que ces messages peuvent occuper en utilisant l'algorithme satisfaisant, et transmission des messages selon la largeur de bande en question dans le réseau considéré. On identifie d'abord tout service optimal correspondant sur le noeud du réseau considéré, puis on attribue la largeur de bande que ce type de service peut occuper en utilisant de façon appropriée l'algorithme satisfaisant, de sorte que chaque service optimal assuré sur chaque noeud de réseau dans le réseau considéré occupe correctement la ressource de largeur de bande restante des services à degré élevé de priorité dans des conditions efficaces.
PCT/CN2005/001723 2004-10-20 2005-10-20 Procede de mise en oeuvre de transmission satisfaisante de flux dans le reseau en anneau mpls WO2006042472A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN200410083854.7 2004-10-20
CNB2004100838547A CN100387025C (zh) 2004-10-20 2004-10-20 Mpls环网中实现流量公平传送的方法

Publications (1)

Publication Number Publication Date
WO2006042472A1 true WO2006042472A1 (fr) 2006-04-27

Family

ID=36202682

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2005/001723 WO2006042472A1 (fr) 2004-10-20 2005-10-20 Procede de mise en oeuvre de transmission satisfaisante de flux dans le reseau en anneau mpls

Country Status (2)

Country Link
CN (1) CN100387025C (fr)
WO (1) WO2006042472A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112737979A (zh) * 2021-01-29 2021-04-30 西安电子科技大学 一种时间敏感网络尽力而为流调度方法

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101499957B (zh) * 2008-01-29 2011-06-15 中国电信股份有限公司 一种多径负载均衡的实现方法和数据转发装置

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1239636A1 (fr) * 2001-03-08 2002-09-11 Lucent Technologies Inc. UMTS amélioré
JP2002319969A (ja) * 2001-04-24 2002-10-31 Nec Corp インターネットアクセスネットワーク帯域制御システム及びインターネットアクセスネットワーク帯域制御方法
CN1527616A (zh) * 2003-03-06 2004-09-08 华为技术有限公司 信道带宽的动态配置方法

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2002063805A1 (fr) * 2001-02-06 2002-08-15 Harris Corporation Systeme et procede relatifs a un controleur d'etat de demodulateur

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1239636A1 (fr) * 2001-03-08 2002-09-11 Lucent Technologies Inc. UMTS amélioré
JP2002319969A (ja) * 2001-04-24 2002-10-31 Nec Corp インターネットアクセスネットワーク帯域制御システム及びインターネットアクセスネットワーク帯域制御方法
CN1527616A (zh) * 2003-03-06 2004-09-08 华为技术有限公司 信道带宽的动态配置方法

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112737979A (zh) * 2021-01-29 2021-04-30 西安电子科技大学 一种时间敏感网络尽力而为流调度方法

Also Published As

Publication number Publication date
CN100387025C (zh) 2008-05-07
CN1764149A (zh) 2006-04-26

Similar Documents

Publication Publication Date Title
EP1748599B1 (fr) Réseau porteur d'anneaux et procédé de mise en oeuvre de porteur de services
EP1739914B1 (fr) Procede, appareil, routeur de bordure et systeme pouvant garantir la qualite de service (qos)
WO2006034644A1 (fr) Reseau en anneau et methode de mise en oeuvre de ses services
US6963575B1 (en) Enhanced data switching/routing for multi-regional IP over fiber network
JP3854607B2 (ja) Ｉｐアクセスネットワークにおいて保証サービス品質を伴うサービスを提供する方法
WO2006039865A1 (fr) Procede permettant de mettre en oeuvre une decouverte automatique de structure de topologie dans le reseau boucle mpls
EP2179367A1 (fr) Protocole de réservation de flux pour réseaux pontés
WO2004036836A1 (fr) Procede d'emission de service de donnees sur un reseau numerique synchrone
WO2007009347A1 (fr) Méthode et appareil de transmission de flux de service sur un système d’échange virtuel
US20050220107A1 (en) System and method for indicating classification of a communications flow
WO2012065466A1 (fr) Procédé et dispositif permettant d'attribuer une bande passante de liaisons agrégées dans un réseau à commutation de paquets
US20050220059A1 (en) System and method for providing a multiple-protocol crossconnect
JP3688525B2 (ja) パケットフロー制御方法及びルータ装置
WO2007098663A1 (fr) Interface de liaison dans une boucle rpr, procédé de mise en oeuvre et appareil
EP2239956B1 (fr) Procédé, appareil et système pour convergence IP/optique
US8804749B2 (en) Mechanism for updating parameters of a session set up through a virtual circuit
EP2222022B1 (fr) Dispositif d'acheminement et procédé d'acheminement d'informations de réseau de communication de signalisation (scn) et d'informations de réseau de communication de gestion (mcn)
WO2012068911A1 (fr) Procédé et système de réservation de ressources de bande passante protégées
WO2006042470A1 (fr) Procede de transmission equitable de flux dans un reseau local en boucle mpls
WO2006042472A1 (fr) Procede de mise en oeuvre de transmission satisfaisante de flux dans le reseau en anneau mpls
JP2009004930A (ja) シェーピング装置およびルータ装置
WO2007140703A1 (fr) Procédé et appareil de nœud rsvp interactif
WO2012159435A1 (fr) Procédé, dispositif et système de traitement de paquet de protocole de commutation multiprotocole par étiquette généralisée
WO2001015386A2 (fr) Approvisionnement en services differencies pour systemes herites
WO2006039871A1 (fr) Procede pour la transmission de message de commande dans un reseau en boucle a commutation multiprotocole par etiquette

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KM KP KR KZ LC LK LR LS LT LU LV LY MA MD MG MK MN MW MX MZ NA NG NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SM SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): BW GH GM KE LS MW MZ NA SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LT LU LV MC NL PL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 05806210

Country of ref document: EP

Kind code of ref document: A1