WO2020130785A1 - Procédé et nœud pour une gestion de trafic réseau - Google Patents

Procédé et nœud pour une gestion de trafic réseau Download PDF

Info

Publication number
WO2020130785A1
WO2020130785A1 PCT/MY2019/050104 MY2019050104W WO2020130785A1 WO 2020130785 A1 WO2020130785 A1 WO 2020130785A1 MY 2019050104 W MY2019050104 W MY 2019050104W WO 2020130785 A1 WO2020130785 A1 WO 2020130785A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
network
link
sub
nodes
Prior art date
Application number
PCT/MY2019/050104
Other languages
English (en)
Inventor
Sharipah Setapa
Saliza HASAN
Chee Meng KONG
Hong Hoe ONG
Nardiatul Kasmi MOHAMED KASSIM
Original Assignee
Mimos Berhad
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 Mimos Berhad filed Critical Mimos Berhad
Publication of WO2020130785A1 publication Critical patent/WO2020130785A1/fr

Links

Classifications

    • 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/06—Management of faults, events, alarms or notifications
    • H04L41/0654—Management of faults, events, alarms or notifications using network fault recovery
    • H04L41/0659—Management of faults, events, alarms or notifications using network fault recovery by isolating or reconfiguring faulty entities
    • H04L41/0661—Management of faults, events, alarms or notifications using network fault recovery by isolating or reconfiguring faulty entities by reconfiguring faulty entities
    • 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/06—Management of faults, events, alarms or notifications
    • H04L41/0681—Configuration of triggering conditions

Definitions

  • the disclosures made herein relate generally to the field of network management and, more particularly, to a node for managing network traffic and a method thereof.
  • traffic protection resources built into network elements decide traffic reliability of a communication network. Therefore, network administrators have to rely on routing algorithms for handling failures in a link or equipment of the network. However, this approach consumes a lot of time resulting in inappropriate communication down time during link disruption, especially for video and voice communication.
  • An effective solution to disruption-free communication is to install redundant equipment so that if when one physical link fails, another link can rapidly be switched into place.
  • United States Patent No.: US 8,248,920 B2 discloses a method of recovering from a communications link failure in a network, wherein the network comprises multiple bridge devices and is configured as a spanning tree.
  • the network includes two rings of bridge device ports, wherein communication takes place in one of the rings when no failure occurs, while the other ring is used for communication when failure occurs.
  • the present invention proposes a method and node for managing network traffic.
  • the method comprises the steps of: monitoring a network of nodes, wherein each node is connected to one or more adjacent nodes through corresponding links, detecting a disruption in at least one of the links, analysing the disruption, and re initiating the disrupted link.
  • the disruption is analysed by setting a sub-network within the network, wherein the sub-network includes the nodes connected to the disrupted link and at least one of other nodes.
  • the sub-network is set by defining a boundary of the sub-network based on a predetermined condition.
  • Links in the sub-network are categorized based on a type of nodes connected to the corresponding link. Each link is categorized into a physical link, a virtual link or a hybrid link, and the type of node includes a physical node and a virtual node.
  • the controller node is selected from the nodes within the sub-network, wherein data flow from each node within the sub-network is analysed, and the node with highest data flow is identified and selected as the controller node, if the identified node is not connected to the disrupted link. After the selection, each node within the sub-network is notified about the controller node and a trigger to the controller node from a node at a receiving end of the disrupted link is initiated.
  • a notification is sent from the node at the receiving end to the controller node to initiate the trigger.
  • the notification includes information regarding at least one of identification and address of the node at the transmitting end, and a type of disruption in the disrupted link.
  • a node at a transmitting end of the disrupted link is controlled by the controller node to restart the disrupted link.
  • the present invention if one of the nodes connected to the disrupted link is identified as the node with the highest data flow, the node with second highest data flow within the sub-network is selected as the controller node.
  • the present invention enables restoring a failed link and/or accelerating traffic in a congested link without a need for a dedicated controlling node.
  • the dynamic selection of the controller node after detecting the disrupted link allows link restoration, irrespective of the nodes connected to the disrupted link.
  • FIGURE 1 illustrates a flow diagram of the method for managing network traffic, in accordance with an exemplary embodiment of the present invention.
  • FIGURE 2 illustrates a schematic representation of a network of nodes, in accordance with an exemplary embodiment of the present invention.
  • FIGURE 3 illustrates a schematic representation of the network during a disruption, in accordance with an exemplary embodiment of the present invention.
  • FIGURE 4 illustrates a schematic representation of a sub-network defined after detecting the disruption, in accordance with an exemplary embodiment of the present invention.
  • FIGURE 5 illustrates a schematic representation of the sub-network during trigger initiation, in accordance with an exemplary embodiment of the present invention.
  • FIGURE 6 illustrates a schematic representation of the sub-network after link restoration, in accordance with an exemplary embodiment of the present invention.
  • the present invention may be embodied as a node, method or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware or programmable instructions) or an embodiment combining software and hardware aspects that may all generally be referred to herein as an“unit,”“module,” or“system.”
  • Node Any physical or virtual device capable of communication e.g. text, voice, image and video communication. It may be in the form of a desktop computer, laptop computer, tablet computer, smartphone, personal digital assistant, switch, bridge, router, gateway, firewall, load balancer, server and/or database.
  • Link A physical or virtual one/two-way communicative connection between two nodes.
  • Network Two or more nodes communicatively connected to one another through a link.
  • Disruption A fault in a link that causes delay or breakdown in communication through the link.
  • the present invention provides a method and node for managing network traffic.
  • the present invention enables restoring a failed link and/or accelerating traffic in a congested link without a need for a dedicated controlling node. Further, the dynamic selection of a controller node after detecting the disrupted link allows faster restoration of the link, irrespective of the nodes connected to the disrupted link.
  • FIG. 1 illustrates a flow diagram of the method for managing network traffic, in accordance with an exemplary embodiment of the present invention.
  • the method (100) comprises the steps of: monitoring (101 ) the network of nodes, wherein each node is connected to one or more adjacent nodes through corresponding links, detecting (102) a disruption in at least one of the links, analysing (103) the disruption, and re-initiating (104) the disrupted link.
  • the disruption is analysed by setting a sub-network within the network, wherein the sub-network includes two nodes connected to the disrupted link and at least one of the other nodes.
  • the sub-network is set by defining a boundary of the sub-network based on a predetermined condition.
  • the boundary of the sub-network is defined based on an Internet Protocol (IP) address of the nodes.
  • IP Internet Protocol
  • the boundary may also be defined based on a link type, node type and/or node function(s).
  • Links in the sub-network are categorized based on a type of nodes connected to the corresponding link, wherein the type of node includes a physical node and a virtual node.
  • Each link is categorized into a physical link, a virtual link or a hybrid link based on the corresponding nodes. For example, a link between two physical nodes is categorized as a physical link, and a link between two virtual nodes is categorized as a virtual link, while a link between two different types of nodes is categorized as hybrid link.
  • a controller node is selected from the nodes within the sub-network, wherein data flow from each node within the sub-network is analysed, and the node with highest data flow is identified and if the identified node is not connected to the disrupted link, it is selected as the controller node. After the selection, each node within the sub network is notified about the controller node and a trigger to the controller node from a node at a receiving end of the disrupted link is initiated.
  • a notification is sent from the node at the receiving end to the controller node to initiate the trigger.
  • the notification includes information regarding at least one of identification and address of the node at a transmitting end, and a type of disruption in the disrupted link.
  • a node at a transmitting end of the disrupted link is controlled by the controller node to restart the disrupted link.
  • the present invention enables restoring a failed link and/or accelerating traffic in a congested link without a need for a dedicated controlling node. Further, the dynamic selection of the controller node after detecting a disrupted link allows link restoration, irrespective of the link that is disrupted.
  • FIG. 2 illustrates a schematic representation the network, in accordance with an exemplary embodiment of the present invention.
  • the network (100) includes a plurality of nodes (1 - 7), wherein each of the nodes (1 - 7) is connected to one or more of the other nodes (1 - 7) through corresponding links (8 - 19).
  • each of the nodes (1 - 7) identifies a type of the corresponding connected nodes (1 - 7) and classifies the links (8 - 19) connecting the nodes (1 - 7) accordingly.
  • a physical node (5) is connected to two physical nodes (6, 7) and a virtual node (4) through the links (9, 16, 10), respectively.
  • the physical node (5) classifies the links (9, 16) as physical links and the link (10) as a hybrid link.
  • Each of the nodes (1 - 7) monitors the links (8 - 19) connecting with adjacent nodes (1 - 7), detects a disruption in one or more of the links (8 - 19), analyses the disruption, and re-initiates each disrupted link (8 - 19).
  • link (16) between the nodes (6, 7) is disrupted, as shown in FIG. 3, the node (7) at a receiving end of the disrupted link (16) detects the disruption by detecting a drop in a rate of data flow from the node (6) at a transmitting end of the disrupted link (16).
  • the node (6) sets a sub-network (100a) within the network (100), as shown in FIG. 4.
  • the sub-network (100a) includes two nodes (6, 7) connected to the disrupted link (16) and one or more of the remaining nodes (1 - 5) of the network (100).
  • two nodes (1 , 5) are included in the sub-network (100a) based on a type and/or IP address of the nodes (1 , 5).
  • the node (7) selects a controller node from the nodes (1 , 5, 6, 7).
  • the node (7) analyses a data flow from each of the nodes (1 , 5, 6, 7) within the sub-network (100a) and identifies the node (5) as the node with highest data flow. Further, the node (7) selects the identified node (5) as the controller node (5), if the identified node (5) is not connected to the disrupted link (16). Alternatively, if the identified node is connected to the disrupted link, then the node (7) selects at least one node with second highest data flow within the sub-network (100a) as the controller node.
  • the node (7) notifies each of the remaining nodes (1 , 5, 6) within the sub-network (100a) about the controller node (5) and then initiates a trigger to the controller node
  • the notification includes information regarding identification and/or address of the node (6), and a type of disruption in the disrupted link (16), wherein the type of disruption may include breakdown, congestion and the like.
  • the controller node (5) re-initiates the disrupted link (16) by controlling the node
  • the node (7) is selecting the controller node (5), the selection may also be possible by all the nodes (1 , 5, 6, 7) operating together. For example, upon detecting the disruption, the node (7) may set the sub-network (100a) and inform each of the other nodes (1 , 5, 7) within the sub-network (100a) about the disruption. Upon receiving the information, each of the nodes (1 , 5, 6, 7) elects one or more adjacent nodes with highest data flow and generates a table as below.
  • the node (6) at the transmitting end of the disrupted link (16) is identified as the node with the highest data flow in the sub-network (100a). Since the identified node (6) is connected to the disrupted link (16), the nodes (1 , 5, 6, 7) together select the node (5) with the second highest data flow as the controller node. Further, each of the nodes (1 , 5, 6, 7) notifies the adjacent nodes (1 , 5, 6, 7) about the controller node.
  • the present invention enables restoring a failed link and/or accelerating traffic in a congested link without a need for a dedicated controlling node. Further, the dynamic selection of a controller node after detecting the disrupted link allows faster restoration of the link, irrespective of the nodes connected to the disrupted link.
  • An apparatus for practicing various embodiments of the present invention may involve one or more computers (or one or more processors within a single computer) and storage systems containing or having network access to computer program(s) coded in accordance with various methods described herein, and the method steps of the disclosure could be accomplished by modules, routines, subroutines, or subparts of a computer program product.

Landscapes

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

Abstract

La présente invention concerne un procédé et un nœud pour gérer un trafic réseau. Le procédé (100) comprend les étapes consistant à : surveiller (101) le réseau de nœuds, chaque nœud étant connecté à un ou plusieurs nœuds adjacents par l'intermédiaire de liaisons correspondantes, détecter (102) une perturbation dans au moins l'une des liaisons, analyser (103) la perturbation et réinitialiser (104) la liaison perturbée.
PCT/MY2019/050104 2018-12-18 2019-12-04 Procédé et nœud pour une gestion de trafic réseau WO2020130785A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
MYPI2018002649 2018-12-18
MYPI2018002649 2018-12-18

Publications (1)

Publication Number Publication Date
WO2020130785A1 true WO2020130785A1 (fr) 2020-06-25

Family

ID=71101705

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/MY2019/050104 WO2020130785A1 (fr) 2018-12-18 2019-12-04 Procédé et nœud pour une gestion de trafic réseau

Country Status (1)

Country Link
WO (1) WO2020130785A1 (fr)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2007329653A (ja) * 2006-06-07 2007-12-20 Mitsubishi Electric Corp ノード管理システム及びノード及び管理用端末装置
JP2010226393A (ja) * 2009-03-23 2010-10-07 Nec Corp 自律分散制御によるパス設定方法およびシステム並びに通信装置
US20110249686A1 (en) * 2007-03-12 2011-10-13 Paul Langner Energy Efficient Ethernet (EEE) With 10GBase-T Structures
US20140029413A1 (en) * 2012-07-27 2014-01-30 Pradeep G. Jain System and method using rsvp hello suppression for graceful restart capable neighbors
US20150131431A1 (en) * 2013-11-14 2015-05-14 Broadcom Corporation Protection ring in an automotive network

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2007329653A (ja) * 2006-06-07 2007-12-20 Mitsubishi Electric Corp ノード管理システム及びノード及び管理用端末装置
US20110249686A1 (en) * 2007-03-12 2011-10-13 Paul Langner Energy Efficient Ethernet (EEE) With 10GBase-T Structures
JP2010226393A (ja) * 2009-03-23 2010-10-07 Nec Corp 自律分散制御によるパス設定方法およびシステム並びに通信装置
US20140029413A1 (en) * 2012-07-27 2014-01-30 Pradeep G. Jain System and method using rsvp hello suppression for graceful restart capable neighbors
US20150131431A1 (en) * 2013-11-14 2015-05-14 Broadcom Corporation Protection ring in an automotive network

Similar Documents

Publication Publication Date Title
US10938722B2 (en) In-band telemetry congestion control system
US7546355B2 (en) Network architecture for data transmission
US7167912B1 (en) Method and apparatus for detecting failures in network components
JP6162337B2 (ja) アプリケーションアウェアネットワーク管理
EP1697843B1 (fr) Systeme et procede de gestion des defaillances d'un reseau de protocole d'un systeme de groupement
CN114285794B (zh) 报文转发控制方法、报文传输网络、电子设备及存储介质
CN111092900B (zh) 服务器异常连接和扫描行为的监控方法和装置
CN109787827B (zh) 一种cdn网络监控的方法及装置
CN108306747B (zh) 一种云安全检测方法、装置和电子设备
CN107241208B (zh) 一种报文转发方法、第一交换机及相关系统
US20110258261A1 (en) Phase based prioritization of ims signaling messages for overload throttling
EP1800436A1 (fr) Procede et appareil destines a determiner l'impact de defauts sur un service reseau
US9847970B1 (en) Dynamic traffic regulation
EP3264634A1 (fr) Détection automatique d'une erreur dans une communication et détermination automatique d'une source de l'erreur
US8370897B1 (en) Configurable redundant security device failover
CN105450694A (zh) 一种处理连续重定向的方法和装置
CN112615901B (zh) 一种客户端发送用户请求的方法和存储系统
WO2020130785A1 (fr) Procédé et nœud pour une gestion de trafic réseau
US11057478B2 (en) Hybrid cluster architecture for reverse proxies
JP7064132B2 (ja) 障害監視システム及び障害監視方法
US20090172155A1 (en) Method and system for monitoring, communicating, and handling a degraded enterprise information system
CN116708129A (zh) 一种链路故障检测与快速恢复的方法、装置及存储介质
US10181997B2 (en) Methods, systems and computer readable media for providing receive port resiliency in a network equipment test device
US12009967B2 (en) Communications methods and apparatus for minimizing and/or preventing message processing faults
CN112565217B (zh) 基于协议的混淆通信方法及客户终端、服务器、存储介质

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: 19899460

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: 19899460

Country of ref document: EP

Kind code of ref document: A1