EP4635141A1 - Mécanisme de manipulation d'événement à grande vitesse dans un système distribué - Google Patents

Mécanisme de manipulation d'événement à grande vitesse dans un système distribué

Info

Publication number
EP4635141A1
EP4635141A1 EP22969089.6A EP22969089A EP4635141A1 EP 4635141 A1 EP4635141 A1 EP 4635141A1 EP 22969089 A EP22969089 A EP 22969089A EP 4635141 A1 EP4635141 A1 EP 4635141A1
Authority
EP
European Patent Office
Prior art keywords
message
distributed system
messages
important
metadata
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
EP22969089.6A
Other languages
German (de)
English (en)
Other versions
EP4635141A4 (fr
Inventor
Alexander ZILBERMAN
Amir BARAK
Idan MATITYAHU
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.)
Drivenets Ltd
Original Assignee
Drivenets 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 Drivenets Ltd filed Critical Drivenets Ltd
Publication of EP4635141A1 publication Critical patent/EP4635141A1/fr
Publication of EP4635141A4 publication Critical patent/EP4635141A4/fr
Pending legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/50—Network services
    • H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
    • H04L67/63—Routing a service request depending on the request content or context
    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/22—Parsing or analysis of headers

Definitions

  • the present disclosure generally relates to the field of communication systems. More particularly, the present disclosure relates to software architecture of a high scale distributed system.
  • EM – Element Manager an entity which resides in all nodes of the cluster for managing the elements as required by the CM.
  • RM Routing Manager. WB - White-box.
  • Container – A container is an isolated execution environment that behaves much like a full-featured installation with its own users, file system, processes, libraries, codes, network stacks and the like. That ensures an identical behavior resulting from the software contained within such a container, irrespective of the system in which the container is being executed.
  • Data Plane – A logical layer that encompasses all functions and processes related to the forwarding of data packets/frames from one interface to another through a system. This term encompasses among others, but not limited to, routing via physical ports as well as via intermediate backplane ports to enable data packets to reach physical ports which are not immediately reachable.
  • BACKGROUND In the area of high scale distributed systems, one of the challenges in the software architecture domain, is, the ability to efficiently deliver messages to relevant system users.
  • distributed messaging is based on the concept of reliable message queuing. Messages are queued asynchronously between client applications and messaging systems, and such a distributed messaging system provides the benefits of reliability, scalability, and persistence.
  • each node typically forwards many messages to its cluster manager (CM).
  • CM cluster manager
  • CM cluster manager
  • a method for use in a distributed system configured to be implemented in one or more clusters of a communication network for delivering messages within the distributed system, wherein the method is characterized in that the messages comprise a data payload and a header that comprises a tuple of metadata of the data payload.
  • the term “tuple” as used herein throughout the specification and claims is used to denote a finite sequence of terms, e.g., a single row in a relational database.
  • metadata as used herein throughout the specification and claims, is used to denote data that provides information about other data but not the content of the data, such as the text of a message or an image itself.
  • the metadata comprises at least one member of a group that consists of a target, a source, an event type (i.e., the classification of the event) and an event related data.
  • the metadata comprises at least one member of a group that consists of a target; a source; an event type; and an event related data.
  • each of the at least one member of the group has a binary value, thereby the header is suited to provide an indication regarding whether a message is an important message or not.
  • each of the one or more clusters comprises a cluster manager configured to determine whether a message is an important message or not, based on value of one or more of the at least one member included in said group.
  • the message will still be handled is such a case as an important message.
  • the system operational definition may be such that the message will still be considered as an important message. Obviously. If all four members have the value of “1”, the message will be considered an important message.
  • a distributed system for use in a communication network, said distributed system comprises a plurality of nodes arranged in a form of a plurality of clusters, and configured to deliver messages within said distributed system, wherein said distributed system is characterized in that said messages comprise a data payload and a header, and wherein said header comprises a tuple of metadata associated with said data payload.
  • the metadata enables determining how a message associated therewith, will be handled.
  • the metadata comprises at least one member of a group that consists of a target, a source, an event type and an event related data.
  • each of the at least one member of said group has a binary value.
  • each of the one or more clusters comprise a cluster manager configured to determine whether a message is an important message or not, based on value of one or more of the at least one member included in that group.
  • the cluster manager is configured to determine whether a message is an important message or not based on the value of the event type member.
  • FIG. 1 illustrates a partial view of a distributed system, wherein important messages are separated from regular messages, construed in accordance with an embodiment of the present invention
  • FIG. 2 illustrates a flow chart, exemplifying a method for carrying out the present solution according to an embodiment construed in accordance with the present invention.
  • the solution provided by the present invention is based on distinguishing between important messages vis. regular messages, and to enable handling (e.g., forwarding) the important messages faster than regular ones.
  • a novel mechanism of structured binary tag messages that are being forwarded across the system is used.
  • This prefix (tag) attached to the message comprises metadata of the message’s data payload, and comprises at least one member of a group that consists of a target to which the message needs to be forwarded, a source where the message was generated, type of an event associated with that message and related data of that event.
  • each of the members discussed above which are comprised in the metadata simply indicate if the message is an important message or not. That may be done for example, per the system operator’s decision, if one of the members in the group is defined as a member that has a higher weight than any of other members, e.g., if the value of the event type in the message header is “1” whereas all other members of the group have the value “0”, the message will still be handled is such a case as an important message.
  • the system operational definition may be such that the message will still be considered as an important message. Obviously. If all four members have the value of “1”, the message will be considered an important message.
  • FIG. 1 illustrates a partial view of a distributed system 5, wherein important messages are separated from regular messages, construed in accordance with an embodiment of the present invention.
  • the regular messages are forwarded along a “slowpath” for non-urgent events (associated with regular messages) as opposed to a path for handling messages associated with events marked for relay (forwarding without further processing).
  • CM cluster manager 10
  • Information that relates to these events is forwarded by using messages generated by an application, which then sends respective messages with their metadata-tagged events comprised in the messages’ headers.
  • the messages are sent towards the local node’s element manager (EM) 25 that resides within a cluster leader 30 (CL), and element manager 25 then forwards them to the CM 10 connection.
  • EM element manager
  • the message is classified based on the information included in the respective message header. If the values included in the metadata indicates that the event is important and therefore the message has to be conveyed without further processing.
  • FIG. 2 illustrates a flow chart, exemplifying a method for carrying out the present solution according to an embodiment construed in accordance with the present invention.
  • a message is created to be conveyed via a distributed system operating in a communication network, wherein the message comprises a data payload, and a header comprises a tuple of its metadata – target, source, event type and event data.
  • the message is conveyed via the distributed system and arrives at a cluster manager (step 210).
  • the cluster manager and detects the values of the constituents included in header (step 220) and classifies, based on one or more of these values, depending on the system operator’s decision, the message as an important message or as a regular message (step 230). If the cluster manager determines that the message is an important message conveying the message without any further processing of the message, towards its destination without undue delay (step 240).
  • the classification ability by the cluster manager side by inspecting the event type. Events, which are tagged as having a type that requires to be relayed immediately, will be forwarded without additional inspection and parsing.

Landscapes

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

Abstract

L'invention concerne un procédé et un système distribué destinés à être utilisés dans un système distribué configuré pour être mis en œuvre dans une ou plusieurs grappes d'un réseau de communication pour délivrer des messages à l'intérieur du système distribué, le procédé et le système distribué étant caractérisés en ce que les messages comprennent une charge utile de données et un en-tête qui comprend un tuple de métadonnées de la charge utile de données.
EP22969089.6A 2022-12-18 2022-12-18 Mécanisme de manipulation d'événement à grande vitesse dans un système distribué Pending EP4635141A4 (fr)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/IL2022/051347 WO2024134639A1 (fr) 2022-12-18 2022-12-18 Mécanisme de manipulation d'événement à grande vitesse dans un système distribué

Publications (2)

Publication Number Publication Date
EP4635141A1 true EP4635141A1 (fr) 2025-10-22
EP4635141A4 EP4635141A4 (fr) 2025-12-24

Family

ID=91587848

Family Applications (1)

Application Number Title Priority Date Filing Date
EP22969089.6A Pending EP4635141A4 (fr) 2022-12-18 2022-12-18 Mécanisme de manipulation d'événement à grande vitesse dans un système distribué

Country Status (4)

Country Link
EP (1) EP4635141A4 (fr)
JP (1) JP2025540416A (fr)
IL (1) IL321169A (fr)
WO (1) WO2024134639A1 (fr)

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9019830B2 (en) * 2007-05-15 2015-04-28 Imagine Communications Corp. Content-based routing of information content
WO2012122555A2 (fr) * 2011-03-09 2012-09-13 Lawrence Ganeshalingam Réseaux de données biologiques et procédés associés
US10212022B2 (en) * 2013-09-13 2019-02-19 Microsoft Technology Licensing, Llc Enhanced network virtualization using metadata in encapsulation header

Also Published As

Publication number Publication date
JP2025540416A (ja) 2025-12-11
EP4635141A4 (fr) 2025-12-24
IL321169A (en) 2025-07-01
WO2024134639A1 (fr) 2024-06-27

Similar Documents

Publication Publication Date Title
US10530691B2 (en) Method and system for managing data traffic in a computing network
US7054276B2 (en) System and method for a multicast network messaging service
US9929920B2 (en) System and method for efficient classification and processing of network traffic
CN101305561B (zh) 基于通信网络中的流策略的流控制
US8639848B2 (en) Data communication efficiency
US7283463B2 (en) Non-disruptive reconfiguration of a publish/subscribe system
US20030110230A1 (en) Method and system for preserving message order when parallel processing messages
US9166927B2 (en) Network switch fabric dispersion
KR102367307B1 (ko) 컴퓨터 네트워크에서 패킷들을 프로세싱하기 위한 시스템들 및 방법들
US20130173784A1 (en) Monitoring server load balancing
US20050137998A1 (en) Carrier grade content router
CN101019385A (zh) 在整个设备堆栈中的端口聚合
JP2007529066A (ja) アフィニティ管理のための方法およびシステム
US6560237B1 (en) Packet order assurance mechanism
US8699485B2 (en) Multicast over lag and IRB in a routing device
US20140214761A1 (en) Systems and Methods for Accelerating Networking Functionality
US20240205288A1 (en) High Speed Event Handling Mechanism in a Distributed System
EP4635141A1 (fr) Mécanisme de manipulation d'événement à grande vitesse dans un système distribué
US20130024541A1 (en) Sending request messages to nodes indicated as unresolved
EP1260065B1 (fr) Procede et dispositif permettant de determiner la priorite de paquets de reseau
US20080140826A1 (en) Monitoring and controlling electronic message distribution
US8307112B2 (en) Mediated information flow
US7533183B1 (en) Central control of multiple address domains within a router
US20170214602A1 (en) Selective network address storage within network device forwarding table
US20200045005A1 (en) Intelligent real-time smtp routing

Legal Events

Date Code Title Description
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE

PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

17P Request for examination filed

Effective date: 20250530

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC ME MK MT NL NO PL PT RO RS SE SI SK SM TR

A4 Supplementary search report drawn up and despatched

Effective date: 20251125

RIC1 Information provided on ipc code assigned before grant

Ipc: H04L 41/00 20220101AFI20251119BHEP

Ipc: H04L 67/63 20220101ALI20251119BHEP

Ipc: H04L 69/22 20220101ALI20251119BHEP