+

WO2018006929A1 - Mise en mémoire tampon de paquets dans un réseau de télécommunications - Google Patents

Mise en mémoire tampon de paquets dans un réseau de télécommunications Download PDF

Info

Publication number
WO2018006929A1
WO2018006929A1 PCT/EP2016/065668 EP2016065668W WO2018006929A1 WO 2018006929 A1 WO2018006929 A1 WO 2018006929A1 EP 2016065668 W EP2016065668 W EP 2016065668W WO 2018006929 A1 WO2018006929 A1 WO 2018006929A1
Authority
WO
WIPO (PCT)
Prior art keywords
packet
buffer
group
fields
unmatched
Prior art date
Application number
PCT/EP2016/065668
Other languages
English (en)
Inventor
Zhang FU
Gergerly PONGRÁCZ
Zoltán TURÁNYI
Conny Larsson
Original Assignee
Telefonaktiebolaget Lm Ericsson (Publ)
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 Telefonaktiebolaget Lm Ericsson (Publ) filed Critical Telefonaktiebolaget Lm Ericsson (Publ)
Priority to PCT/EP2016/065668 priority Critical patent/WO2018006929A1/fr
Publication of WO2018006929A1 publication Critical patent/WO2018006929A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/62—Queue scheduling characterised by scheduling criteria
    • H04L47/621—Individual queue per connection or flow, e.g. per VC
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0803—Configuration setting
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0895—Configuration of virtualised networks or elements, e.g. virtualised network function or OpenFlow elements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/64—Routing or path finding of packets in data switching networks using an overlay routing layer
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/74—Address processing for routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/90—Buffering arrangements
    • H04L49/9005—Buffering arrangements using dynamic buffer space allocation

Definitions

  • Various embodiments described herein relate to methods and devices and more particularly to methods and devices providing packet buffering in telecommunications networks.
  • Packet routing switches perform various operations to forward packets to destinations in a network based on flow rules. Instances where packets are forwarded based on flow rules by the packet routing switch handles the packets in the data plane. In cases where the packet routing switch is not able to determine an appropriate rule governing forwarding of a packet, the packet routing switch forwards the packet to a controller node in the control plane. Large amounts of traffic in the control plane may reduce performance of the controller node and overall
  • Some embodiments disclosed herein are directed to a method performed by a network node that operates as a packet routing switch for routing packets in a telecommunications network.
  • the method includes receiving a buffer creation message from a controller node to create a first buffer in memory associated with the network node and to install a first buffer flow rule associated with the first buffer.
  • the first buffer flow rule includes a set of one or more header fields.
  • the method includes receiving a packet including a packet header, and storing the packet in the first buffer associated with the first buffer flow rule responsive to one or more fields of the packet header being among the set of the one or more header fields of the first buffer flow rule.
  • Some other related embodiments are directed to receiving, from the controller node, a buffer unmatched message comprising a set of one or more group fields, each group field indicating a header field to be matched with the packet header of the packet that is received or indicating an interface through which the packet is received.
  • Some other embodiments of the present invention are directed to a method performed by a controller node in communication with a network node that operates as a controller of a packet routing switch for routing packets in a telecommunications network.
  • the method includes transmitting a buffer creation message to the network node to create a first buffer for storing packets according to matching of a buffer flow rule.
  • Some other embodiments of the present invention are directed to a method performed by a controller node in communication with a network node that operates as a controller of a packet routing switch for routing packets in a telecommunications network.
  • the method includes transmitting, to the network node, an unmatched group flow rule to apply to an unmatched packet that does not match any of one or more flow rules currently associated with the network node.
  • the unmatched group fiow rule indicates at least one field of a packet header of the unmatched packet for associating the unmatched packet with an unmatched group flow rule buffer.
  • the processor is configured to perform operations including receiving a packet including a packet header, storing the packet in the first buffer associated with the first buffer flow rule, responsive to one or more fields of the packet header being among the set of the one or more header fields of the first buffer flow rule, determining that the packet is an unmatched packet if no combination of fields of the packet header satisfy any of one or more flow rules currently associated with the network node.
  • the one or more fiow rules currently associated with the network node include the first buffer flow rule.
  • the processor is configured to perform operations including storing the packet in a second buffer associated with unmatched packets, responsive to the determining that the packet is an unmatched packet, and transmitting the packet if the combination of fields of the packet header satisfy any of the one or more flow rules currently associated with the network node.
  • Some other embodiments of the present invention are directed to a controller node in communication with a network node that operates as a packet routing switch for routing packets in a telecommunications network, the controller node including a transceiver, a memory storing computer readable program code, and a processor connected to the transceiver and the memory, the processor configured to perform operations including transmitting a buffer creation message to the network node to create a first buffer for storing packets according to matching of a buffer flow rule.
  • Figure 4 is a flowchart of operations for processing a packet by matching flow rules associated with buffers, in accordance with some embodiments of the present disclosure.
  • FIGS. 6 and 7 are flowcharts of operations and methods by a controller node, in accordance with some embodiments of the present disclosure.
  • Figure 8 is a data flow diagram of communication between a network node and a controller node, in accordance with some embodiments of the present disclosure.
  • Figure 9 is a flowchart of operations and methods by a network node operating as a packet routing switch, in accordance with some embodiments of the present disclosure.
  • Figure 10 illustrates the format of a buffer unmatched message, in accordance with some embodiments of the present disclosure.
  • Figure 1 1 is a flowchart of operations for grouping unmatched packets, in accordance with some embodiments of the present disclosure.
  • Figure 19 is a flowchart of operations for grouping unmatched packets, in accordance with some embodiments of the present disclosure.
  • FIGS 20 and 21 are flowcharts of operations and methods by a controller node for controlling a packet routing switch, in accordance with some embodiments of the present disclosure.
  • Figure 22 is a flowchart of operations for self-learning by a network node, in accordance with some embodiments of the present disclosure.
  • FIGS 23 and 24 are flowcharts of operations and methods by a network node operating as a packet routing switch, in accordance with some embodiments of the present disclosure.
  • Figure 25 is a block diagram of a network node that is configured according to some embodiments of the present disclosure.
  • Figure 26 is a block diagram of modules forming a network node that is configured according to some embodiments of the present disclosure.
  • OpenFlow is the first standard communications interface defined between the control and forwarding layers of an SDN architecture. OpenFlow allows direct access to and manipulation of the forwarding plane of network devices such as switches and routers, both physical and virtual (hypervisor-based).
  • Figure 2 is a block diagram of a SDN (Software Defined Networking) architecture. SDN logically separates a software portion and a hardware portion in network elements such as routers and switches in order to simplify the network maintenance and accelerate the development of new network
  • the buffering function in the SDN switch may be only triggered by unmatched packets.
  • the controller may want the switch to hold some specific packets until the controller is able to send further commands or rules to apply to them.
  • legacy SDN switch implementations may not have a generic buffer action in the southbound protocol, packets matching specific match fields do not have a legacy mechanism to buffer the packets without sending the packets to the controller.
  • legacy systems do not relate different types of unmatched packets together to improve processing.
  • rules for packet buffering may be pre-installed to provide a more efficient forwarding process for buffered packets.
  • Network nodes have the ability to create buffers for storing packets. Each buffer may have attributes such as an ID, size, lifetime, etc. and may store one or more packets. The information in the buffers in the network node may be queried by the controller node.
  • Figure 4 is a flowchart of operations for processing a packet by matching flow rules associated with buffers. Referring now to Figure 4, at block 410, a buffer creation command may be received at the network node from the controller node to create a first buffer and/or to install a first buffer flow rule associated with the first buffer.
  • the controller node 120 can later indicate to the switch 1 10 what to do with the buffered packets. As shown in message 6 of Figure 8, the controller node 120 can send a message including a flow rule with match fields and actions.
  • the buffer ID in the message may be a specific ID or some unspecific one.
  • An unspecific buffer ID may refer to a group of buffers or may include a special value indicating all the buffered packets at the switch 1 10.
  • the flow rule may be applied to the packets in the buffer with the specific ID or the flow rule may be applied to all the buffered packets in the unspecified buffer ID case.
  • the action indicated in flow rule message 6, could instruct the switch 1 10 to drop, forward to a port, access a flow table, etc.
  • FIG. 11 is a flowchart of operations for grouping unmatched packets.
  • the SDN switch After receiving the buffer unmatched message from the controller node, the SDN switch knows how to group the unmatched packets. In particular, when the switch receives an unmatched packet at block 1110, a check of the fields of the packet is conducted to determine if the packet should be buffered, at block 1 120. If the unmatched packet should not be buffered it may be dropped, at block 1 140. If the unmatched packet needs to be buffered, the group ID may be determined, at block 1130. Upon successfully determining the group ID, a check for the existence of the group will be conducted, at block 1160. If the group does not exist, the unmatched packet is sent to the controller, at block 1 150.
  • the group if the group does not exit, the group is created, the packet or a portion of the packet such as the headers is sent to the controller, and the packet is inserted in the group. If the group exists, a check in the memory for space associated with the buffer indicated by the ID is made, at block 1170. If there is not space in the group, the packet is dropped, at block 1 140. If there is space in the group, the unmatched packet is appended to the buffer, at block 1180.
  • the group flow rule is received by the network node from the controller.
  • the SDN switch may also optionally send the group ID with the packet to the controller.
  • dstIP a field such as "dstIP”
  • dstIP a field used in more than 90% of the rules
  • the switch may have different actions for packets with different destination IP addresses.
  • multiple flow rules may be populated in the flow table that each have the format
  • the switch can learn that the destination IP address is an important field and may group the unmatched packets according to the destination IP address.
  • flow rule 1 is determined to be more important than flow rule 2.
  • a flow rule may be designated as a "critical rule", if it matches more y% of the incoming packets.
  • flow rule 2 may be designated as a critical rule.
  • the candidate set can be derived in at least two ways. In some embodiments, if a header field is used in x% of the critical rules, then this field will be included in the candidate set. In some embodiments, a union of all the fields used in the critical rules may be included in the candidate set. For example, in the ongoing example, if both flow rule 1 and flow rule 2 are critical rules, then the candidate set may include ⁇ protocol, srcIP, srcPort>. In some embodiments, the switch may generate the candidate set based on the new flow rules received from the controller.
  • the existing groups may each contain packets that match the flow rule. Therefore, all the buffered packets will be checked against the flow rule for this case.
  • the flow rule may have fields:
  • the switch groups the unmatched the packets according to the ⁇ dstIP>.
  • the switch may receive a new flow rule from the controller which is:
  • the switch can still apply the rule to the group which buffers the unmatched packets with dstIP 10.0.0.10. But after that, the switch regroups the buffered packets according to ⁇ dstIP, srcIP>, and sends a packet of each new group to the controller.
  • the candidate set is updated to ⁇ dstIP, srcIP>.
  • the flow rule may be:
  • the switch will apply the flow rule to all the buffered packets.
  • the switch may regroup the buffered packets according to ⁇ srcPort, dstPort>, and sends a packet of each new group to the controller.
  • the candidate set may be then updated to ⁇ srcPort, dstPort>.
  • Figures 23 and 24 are flowcharts of operations and methods by a network node operating as a packet routing switch using a candidate set. Referring to Figure 23, storing the packet in the second buffer associated with unmatched packets, at block 560 will be described further.
  • a candidate set flow rule may be derived, at block 2310.
  • the candidate set flow rule may include a candidate set of match fields based on one or more fields in the one of more flow rules currently associated with the network node.
  • the network node may determine if one or more fields of the packet header of the packet are a subset of the candidate set, at block 2320.
  • the processor 2520 may include one or more data processing circuits, such as a general purpose and/or special purpose processor (e.g., microprocessor and/or digital signal processor) that may be collocated or distributed across one or more networks.
  • the processor 2520 is configured to execute computer program code 2550 in the memory 2540, described below as a non-transitory computer readable medium, to perform at least some of the operations described herein as being performed by a network node.
  • the memory 2540 may further include the first buffer 2560 and/or the second buffer 2570.
  • Figure 26 is a block diagram of modules forming a network node 2610 that is configured according to some embodiments of the present disclosure.
  • the network node 2610 may correspond to the network node 110 of Figure 1 and/or Figure 2, and/or network node 2510 of Figure 25.
  • the modules of network node 2610 include buffer creation module 2620, packet reception module 2630, a first package storage module 2640, determination module 2650, a second packet storage module 2660, and a transmission module 2670.
  • the buffer creation module 2620 is for receiving a buffer creation message from a controller node to create a first buffer in memory and/or to install a first buffer flow rule associated with the first buffer.
  • the packet reception module 2630 is for receiving a packet.
  • the first package storage module 2640 is for storing the packet in the first buffer associated with the first buffer flow rule, responsive to one or more fields of the packet header being among the set of the one or more header fields of the first buffer flow rule.
  • the determination module 2650 determining that the packet is an unmatched packet if no combination of fields of the packet header satisfy any of one or more flow rules currently associated with the network node 2610.
  • the second packet storage module 2660 is for storing the packet in a second buffer associated with unmatched packets, responsive to the determining that the packet is an unmatched packet.
  • the transmission module 2670 is for transmitting the packet if the combination of fields of the packet header satisfy any of the one or more flow rules currently associated with the network node 2610, other than the first buffer flow rule.
  • the processor 2720 may include one or more data processing circuits, such as a general purpose and/or special purpose processor (e.g., microprocessor and/or digital signal processor) that may be collocated or distributed across one or more networks.
  • the processor 2720 is configured to execute computer program code 2750 in the memory 2740, described below as a non-transitory computer readable medium, to perform at least some of the operations described herein as being performed by a controller node.
  • Example embodiments are described herein with reference to block diagrams and/or flowchart illustrations of computer-implemented methods, apparatus (systems and/or devices) and/or computer program products. It is understood that a block of the block diagrams and/or flowchart illustrations, and combinations of blocks in the block diagrams and/or flowchart illustrations, can be implemented by computer program instructions that are performed by one or more computer circuits.
  • These computer program instructions may be provided to a processor circuit of a general purpose computer circuit, special purpose computer circuit, and/or other programmable data processing circuit to produce a machine, such that the instructions, which execute via the processor of the computer and/or other programmable data processing apparatus, transform and control transistors, values stored in memory locations, and other hardware components within such circuitry to implement the functions/acts specified in the block diagrams and/or flowchart block or blocks, and thereby create means (functionality) and/or structure for implementing the functions/acts specified in the block diagrams and/or flowchart block(s).

Landscapes

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

Abstract

L'invention concerne un procédé mis en œuvre par un nœud de réseau pour acheminer des paquets dans un réseau de télécommunications. Le procédé consiste à recevoir un message de création de mémoire tampon en vue de créer une première mémoire tampon et d'installer une première règle de flux de mémoire tampon associée à la première mémoire tampon. Lorsqu'un paquet est reçu, le paquet est stocké dans la première mémoire tampon associée à la règle de flux de la première mémoire tampon, si des champs de l'en-tête de paquet se trouvent parmi l'ensemble du ou des champs d'en-tête de la règle de flux de la première mémoire tampon. Le procédé consiste à déterminer que le paquet est un paquet non apparié si aucune combinaison de champs de l'en-tête de paquet ne satisfait les règles de flux actuellement associées au nœud de réseau. Un paquet non apparié est stocké dans une seconde mémoire tampon. Le procédé consiste à transmettre le paquet si la combinaison de champs de l'en-tête de paquet satisfait des règles de flux autres que la règle de flux de la première mémoire tampon.
PCT/EP2016/065668 2016-07-04 2016-07-04 Mise en mémoire tampon de paquets dans un réseau de télécommunications WO2018006929A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/EP2016/065668 WO2018006929A1 (fr) 2016-07-04 2016-07-04 Mise en mémoire tampon de paquets dans un réseau de télécommunications

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/EP2016/065668 WO2018006929A1 (fr) 2016-07-04 2016-07-04 Mise en mémoire tampon de paquets dans un réseau de télécommunications

Publications (1)

Publication Number Publication Date
WO2018006929A1 true WO2018006929A1 (fr) 2018-01-11

Family

ID=56296840

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2016/065668 WO2018006929A1 (fr) 2016-07-04 2016-07-04 Mise en mémoire tampon de paquets dans un réseau de télécommunications

Country Status (1)

Country Link
WO (1) WO2018006929A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2020097697A1 (fr) * 2018-11-16 2020-05-22 Davies Alexander Phillip Procédé de communication entre des nœuds dans un réseau
EP3748924A4 (fr) * 2018-04-09 2021-04-07 Huawei Technologies Co., Ltd. Procédé de prétraitement de paquets de données, appareil et dispositif

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120093158A1 (en) * 2010-05-28 2012-04-19 Nec Corporation Communication system, node, control device, communication method, and porgram
US20130230047A1 (en) * 2012-03-05 2013-09-05 Ramesh Subrahmaniam Methods of operating forwarding elements including shadow tables and related forwarding elements
WO2014173466A1 (fr) * 2013-04-26 2014-10-30 Nec Europe Ltd. Procédé pour le fonctionnement d'un réseau sans fil et réseau sans fil
WO2016055097A1 (fr) * 2014-10-07 2016-04-14 Nokia Solutions And Networks Oy Chaînage de service dans des communications

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120093158A1 (en) * 2010-05-28 2012-04-19 Nec Corporation Communication system, node, control device, communication method, and porgram
US20130230047A1 (en) * 2012-03-05 2013-09-05 Ramesh Subrahmaniam Methods of operating forwarding elements including shadow tables and related forwarding elements
WO2014173466A1 (fr) * 2013-04-26 2014-10-30 Nec Europe Ltd. Procédé pour le fonctionnement d'un réseau sans fil et réseau sans fil
WO2016055097A1 (fr) * 2014-10-07 2016-04-14 Nokia Solutions And Networks Oy Chaînage de service dans des communications

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3748924A4 (fr) * 2018-04-09 2021-04-07 Huawei Technologies Co., Ltd. Procédé de prétraitement de paquets de données, appareil et dispositif
US11483261B2 (en) 2018-04-09 2022-10-25 Huawei Technologies Co., Ltd. Data packet processing method and apparatus, and device
WO2020097697A1 (fr) * 2018-11-16 2020-05-22 Davies Alexander Phillip Procédé de communication entre des nœuds dans un réseau

Similar Documents

Publication Publication Date Title
US11134012B2 (en) Communication system, communication device, controller, and method and program for controlling forwarding path of packet flow
CN113709057B (zh) 网络拥塞的通告方法、代理节点、网络节点及计算机设备
CN104704779B (zh) 用于加速软件定义网络中的转发的方法和设备
US10397126B2 (en) VXLAN packet transmission
US9832111B2 (en) OFS in-band communication method and OFS
US9225641B2 (en) Communication between hetrogenous networks
US10148573B2 (en) Packet processing method, node, and system
US10237130B2 (en) Method for processing VxLAN data units
US9407503B2 (en) Control apparatus, communication system, communication method, and program
JP5800019B2 (ja) 通信経路制御システム、経路制御装置、通信経路制御方法および経路制御プログラム
US10652142B2 (en) SDN-based ARP implementation method and apparatus
US20160330167A1 (en) Arp Implementation Method, Switch Device, and Control Device
WO2018036254A1 (fr) Procédé et dispositif de retransmission de paquets
CN110022264A (zh) 控制网络拥塞的方法、接入设备和计算机可读存储介质
CN109218111B (zh) 一种处理报文的方法和转发器
WO2018121535A1 (fr) Procédé et appareil de traitement d'équilibrage de charge
WO2016029345A1 (fr) Procédé et appareil de statistiques d'informations sur des flux de réseau
JP2008118281A (ja) 通信装置
WO2018006929A1 (fr) Mise en mémoire tampon de paquets dans un réseau de télécommunications
US9537764B2 (en) Communication apparatus, control apparatus, communication system, communication method, method for controlling communication apparatus, and program
US20150381775A1 (en) Communication system, communication method, control apparatus, control apparatus control method, and program
KR20150068451A (ko) 통신 노드, 통신 시스템, 제어 장치, 패킷 전송 방법 및 프로그램
US10972396B2 (en) Mapping network frame flows to classes of service to minimize network frame flow disruption
US11929910B2 (en) Communication method implemented by a first router of an autonomous system using an interior gateway protocol
JP6365663B2 (ja) 通信装置、制御装置、通信システム、受信パケットの処理方法、通信装置の制御方法及びプログラム

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 16733992

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 16733992

Country of ref document: EP

Kind code of ref document: A1

点击 这是indexloc提供的php浏览器服务，不要输入任何密码和下载