[go: up one dir, main page]

FR3061391B1 - COMPUTER NETWORK OF KNOTS COMMUNICATING BETWEEN THEM THROUGH PAIR MESSAGES AND INTERCONNECTION METHOD BETWEEN NODES ASSOCIATED THEREWITH - Google Patents

COMPUTER NETWORK OF KNOTS COMMUNICATING BETWEEN THEM THROUGH PAIR MESSAGES AND INTERCONNECTION METHOD BETWEEN NODES ASSOCIATED THEREWITH Download PDF

Info

Publication number
FR3061391B1
FR3061391B1 FR1663408A FR1663408A FR3061391B1 FR 3061391 B1 FR3061391 B1 FR 3061391B1 FR 1663408 A FR1663408 A FR 1663408A FR 1663408 A FR1663408 A FR 1663408A FR 3061391 B1 FR3061391 B1 FR 3061391B1
Authority
FR
France
Prior art keywords
nodes
interconnected
messages
consumer
communicating
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
FR1663408A
Other languages
French (fr)
Other versions
FR3061391A1 (en
Inventor
Adrien Plagnol
Chary Titouan
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.)
WORLDLINE
Original Assignee
WORLDLINE
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 WORLDLINE filed Critical WORLDLINE
Priority to FR1663408A priority Critical patent/FR3061391B1/en
Priority to PCT/FR2017/053853 priority patent/WO2018122533A1/en
Priority to CN201780086742.2A priority patent/CN110431824B/en
Priority to EP17838185.1A priority patent/EP3563558A1/en
Publication of FR3061391A1 publication Critical patent/FR3061391A1/en
Application granted granted Critical
Publication of FR3061391B1 publication Critical patent/FR3061391B1/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

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/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • 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/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H04L67/1044—Group management mechanisms 
    • H04L67/1046—Joining mechanisms
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W8/00—Network data management
    • H04W8/005—Discovery of network devices, e.g. terminals

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Computing Systems (AREA)
  • Mathematical Physics (AREA)
  • Theoretical Computer Science (AREA)
  • Computer And Data Communications (AREA)

Abstract

L'invention concerne un réseau informatique de nœuds (1, 2) communiquant entre eux par messages en pair à pair, des nœuds producteurs (1) de message envoyant leurs messages produits vers des nœuds consommateurs (2) de message, un nœud consommateur (2) pouvant être également un nœud producteur (1) à un autre niveau du réseau (6), caractérisé en ce que chaque nœud producteur (1) de message : choisit, parmi les nœuds (1, 2) enregistrés comme actifs dans le réseau, ses nœuds consommateurs (2) pour s'interconnecter avec eux, maintient à jour la liste de ses nœuds consommateurs (2) interconnectés, gère la répartition de charge de ses messages produits vers ses nœuds consommateurs (2) interconnectés, en fonction du temps de traitement, par ses nœuds consommateurs (2) interconnectés, de ses messages produits, en envoyant ses messages produits surtout à ses nœuds consommateurs (2) interconnectés à plus faible temps de traitement, modifie sa liste de nœuds consommateurs (2) interconnectés en fonction du temps de traitement, par ses nœuds consommateurs (2) interconnectés, de ses messages produits, en supprimant de sa liste au moins temporairement ses nœuds consommateurs (2) interconnectés trop lents.The invention relates to a computer network of nodes (1, 2) communicating with each other by peer-to-peer messages, message generating nodes (1) sending their generated messages to message consumer nodes (2), a consumer node ( 2) can also be a producer node (1) at another level of the network (6), characterized in that each producer node (1) of message: chooses, among the nodes (1, 2) registered as active in the network , its consumer nodes (2) to interconnect with them, maintains the list of its interconnected consumer nodes (2), manages the load distribution of its product messages to its interconnected consumer nodes (2), as a function of time processing, by its interconnected consumer nodes (2), of its generated messages, by sending its messages produced especially to its interconnected consumers nodes (2) with a lower processing time, modifies its list of consuming nodes interconnected nodes (2) based on the processing time, by its interconnected consumer nodes (2), of its generated messages, by deleting from its list at least temporarily its interconnected nodes consumers (2) too slow.

FR1663408A 2016-12-27 2016-12-27 COMPUTER NETWORK OF KNOTS COMMUNICATING BETWEEN THEM THROUGH PAIR MESSAGES AND INTERCONNECTION METHOD BETWEEN NODES ASSOCIATED THEREWITH Expired - Fee Related FR3061391B1 (en)

Priority Applications (4)

Application Number Priority Date Filing Date Title
FR1663408A FR3061391B1 (en) 2016-12-27 2016-12-27 COMPUTER NETWORK OF KNOTS COMMUNICATING BETWEEN THEM THROUGH PAIR MESSAGES AND INTERCONNECTION METHOD BETWEEN NODES ASSOCIATED THEREWITH
PCT/FR2017/053853 WO2018122533A1 (en) 2016-12-27 2017-12-27 Computer network of nodes communicating with one another by peer-to-peer messages and associated method for interconnecting between nodes
CN201780086742.2A CN110431824B (en) 2016-12-27 2017-12-27 Computer network of nodes communicating with each other by means of peer-to-peer messages and associated method for interconnecting nodes
EP17838185.1A EP3563558A1 (en) 2016-12-27 2017-12-27 Computer network of nodes communicating with one another by peer-to-peer messages and associated method for interconnecting between nodes

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
FR1663408 2016-12-27
FR1663408A FR3061391B1 (en) 2016-12-27 2016-12-27 COMPUTER NETWORK OF KNOTS COMMUNICATING BETWEEN THEM THROUGH PAIR MESSAGES AND INTERCONNECTION METHOD BETWEEN NODES ASSOCIATED THEREWITH

Publications (2)

Publication Number Publication Date
FR3061391A1 FR3061391A1 (en) 2018-06-29
FR3061391B1 true FR3061391B1 (en) 2019-05-31

Family

ID=58737663

Family Applications (1)

Application Number Title Priority Date Filing Date
FR1663408A Expired - Fee Related FR3061391B1 (en) 2016-12-27 2016-12-27 COMPUTER NETWORK OF KNOTS COMMUNICATING BETWEEN THEM THROUGH PAIR MESSAGES AND INTERCONNECTION METHOD BETWEEN NODES ASSOCIATED THEREWITH

Country Status (4)

Country Link
EP (1) EP3563558A1 (en)
CN (1) CN110431824B (en)
FR (1) FR3061391B1 (en)
WO (1) WO2018122533A1 (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112019689B (en) * 2019-05-29 2025-03-25 北京奇虎科技有限公司 Incoming call show service processing system and method
FR3150679A1 (en) * 2023-06-29 2025-01-03 Orange Energy production device in a network comprising a plurality of nodes, energy consuming node and corresponding methods

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7627678B2 (en) * 2003-10-20 2009-12-01 Sony Computer Entertainment America Inc. Connecting a peer in a peer-to-peer relay network
US20070097986A1 (en) * 2005-11-02 2007-05-03 Abu-Amara Hosame H Peer-to-peer communication architecture and terminals
EP1903816A1 (en) * 2006-09-22 2008-03-26 Nokia Siemens Networks Gmbh & Co. Kg Method for operating an access node and access node thereof
BRPI0814556A2 (en) * 2007-07-10 2015-01-06 Thomson Licensing METHOD FOR AUTOMATICALLY DETERMINING A GROUP OF COUPLE LOCATED NEAR ANOTHER COUPLE IN A COMMUNICATION NETWORK AND ASSOCIATED SERVER, ANALYSIS DEVICE AND COMMUNICATION DEVICE
US9786164B2 (en) * 2008-05-23 2017-10-10 Leverage Information Systems, Inc. Automated camera response in a surveillance architecture
EP2374255B1 (en) * 2008-12-30 2017-03-15 Telecom Italia S.p.A. Method and system for data management in peer-to- peer network
CN105898388B (en) * 2016-04-05 2019-07-23 合一网络技术(北京)有限公司 A kind of node download schedule method and apparatus

Also Published As

Publication number Publication date
FR3061391A1 (en) 2018-06-29
WO2018122533A1 (en) 2018-07-05
CN110431824B (en) 2022-05-10
EP3563558A1 (en) 2019-11-06
CN110431824A (en) 2019-11-08

Similar Documents

Publication Publication Date Title
Sayed Diffusion adaptation over networks
FR2938998B1 (en) SYSTEM AND METHOD FOR DYNAMIC DEPLOYMENT OF DISTRIBUTED PROCESSES.
FR3056201B1 (en) BURNER SYSTEM FOR DISTRIBUTION OF GOODS IN URBAN ENVIRONMENT
JP2012530982A5 (en)
FR3061391B1 (en) COMPUTER NETWORK OF KNOTS COMMUNICATING BETWEEN THEM THROUGH PAIR MESSAGES AND INTERCONNECTION METHOD BETWEEN NODES ASSOCIATED THEREWITH
EP2753024A3 (en) System and method for continuously monitoring and searching social networking media
MA52826A1 (en) LONG-RANGE DECENTRALIZED MOBILE PAYMENT NETWORK USING BLUETOOTH TECHNOLOGY
CN106682848A (en) Distribution warehouse location selection method and device for multiple distribution points
Fujihara et al. On the use of congestion information for rerouting in the disaster evacuation guidance using opportunistic communication
Matsumura et al. Endogenous flexibility in the flexible manufacturing system
US9460206B2 (en) Active platform system
Catan An integrated marketing communications campaign for Travel Lab Philippines
FR3059502B1 (en) DEVICE FOR MUTUALIZING INTERNET CONNECTIONS
Čech et al. Modeling metallurgical supply chain resilience using Markov process
田中祥司 Impact of brand authenticity on word-of-mouth for tourism souvenirs
FR3092220B1 (en) Communication method within a dynamic communication network between a plurality of products
El_Sayed Sadek et al. THE VALUE CHAIN ANALYSIS OF OLIVE IN FAYOUM GOVERNORATE
Nishii CAN REGULATORY FOCUS INFLUENCE THE JUDGEMENT OF “THESE SUIT ME!”? A COMPARISON BETWEEN WESTERN AND EASTERN CONSUMERS
Omelyanenko et al. ICT Tools for R&D and Industrial Nanotechnology Networks within the Industry 4.0
Kwagalakwe et al. The Role of Pre-Existing Structures in the Initiation of the Northern Western Branch of the East African Rift System.
Peterzon Elites,'patrimonial state'en sociaal kapitaal. De Gezworene Meente van Groningen na de aansluiting bij de Republiek.
Trishchuk et al. CONDITIONS FOR EFFECTIVE FUNCTIONING AND PROMOTION OF MEDIA IN SOCIAL NETWORKS
David et al. Louisiana VOLUME75
Frischknecht et al. Indigenous destination development: Nudging key players to generate impact in sustainable tourism.
Akbarzadeh Totonchi Studies in Systems, Decision and Control: Control and Systems Engineering

Legal Events

Date Code Title Description
PLFP Fee payment

Year of fee payment: 2

PLSC Publication of the preliminary search report

Effective date: 20180629

PLFP Fee payment

Year of fee payment: 4

ST Notification of lapse

Effective date: 20210806