FR3135851B1 - Dispositif et procédé de routage de flux dans les réseaux sensibles au temps - Google Patents

Dispositif et procédé de routage de flux dans les réseaux sensibles au temps Download PDF

Info

Publication number
FR3135851B1
FR3135851B1 FR2204878A FR2204878A FR3135851B1 FR 3135851 B1 FR3135851 B1 FR 3135851B1 FR 2204878 A FR2204878 A FR 2204878A FR 2204878 A FR2204878 A FR 2204878A FR 3135851 B1 FR3135851 B1 FR 3135851B1
Authority
FR
France
Prior art keywords
routing
time
packets
path
flow
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.)
Active
Application number
FR2204878A
Other languages
English (en)
Other versions
FR3135851A1 (fr
Inventor
Hadj Said Siwar Ben
Michael Boc
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.)
Commissariat a lEnergie Atomique et aux Energies Alternatives CEA
Original Assignee
Commissariat a lEnergie Atomique CEA
Commissariat a lEnergie Atomique et aux Energies Alternatives CEA
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 Commissariat a lEnergie Atomique CEA, Commissariat a lEnergie Atomique et aux Energies Alternatives CEA filed Critical Commissariat a lEnergie Atomique CEA
Priority to FR2204878A priority Critical patent/FR3135851B1/fr
Priority to PCT/EP2023/061786 priority patent/WO2023222397A1/fr
Priority to US18/864,889 priority patent/US20250202789A1/en
Priority to EP23723557.7A priority patent/EP4527055A1/fr
Publication of FR3135851A1 publication Critical patent/FR3135851A1/fr
Application granted granted Critical
Publication of FR3135851B1 publication Critical patent/FR3135851B1/fr
Active 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
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/28—Flow control; Congestion control in relation to timing considerations
    • H04L47/283—Flow control; Congestion control in relation to timing considerations in response to processing delays, e.g. caused by jitter or round trip time [RTT]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/0852—Delays
    • 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/12—Shortest path evaluation
    • H04L45/121—Shortest path evaluation by minimising delays
    • 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/302—Route determination based on requested QoS
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2425—Traffic characterised by specific attributes, e.g. priority or QoS for supporting services specification, e.g. SLA
    • H04L47/2433—Allocation of priorities to traffic types
    • 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
    • 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/56—Queue scheduling implementing delay-aware scheduling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/10—Active monitoring, e.g. heartbeat, ping or trace-route
    • H04L43/106—Active monitoring, e.g. heartbeat, ping or trace-route using time related information in packets, e.g. by adding timestamps

Landscapes

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

Abstract

La présente invention propose un procédé de routage (600) d’un flux de données dans un réseau déterministe sensible au temps, pour router les paquets d’un flux de données depuis un terminal émetteur vers un terminal récepteur, le réseau comprenant des commutateurs pour la transmission des paquets, les commutateurs étant configurés pour mettre en œuvre une planification de transmission prédéfinie sur des cycles de temps répétés ayant des créneaux de temps de longueur fixe. Le procédé de routage de l’invention utilise la latence d’un chemin comme métrique pour calculer (604) les k chemins les plus courts entre un terminal émetteur et un terminal récepteur, puis pour chaque chemin, détermine pour chaque commutateur situé sur ce chemin, un intervalle de tolérance (406) qui définit pour combien de temps les paquets d’un flux peuvent patienter au niveau du commutateur avant d’être transférés vers le commutateur suivant, sans dépasser la date limite d’arrivée de chaque paquet du flux à destination, afin de réserver des créneaux libres (408). Figure pour l’abrégé : Fig.4
FR2204878A 2022-05-20 2022-05-20 Dispositif et procédé de routage de flux dans les réseaux sensibles au temps Active FR3135851B1 (fr)

Priority Applications (4)

Application Number Priority Date Filing Date Title
FR2204878A FR3135851B1 (fr) 2022-05-20 2022-05-20 Dispositif et procédé de routage de flux dans les réseaux sensibles au temps
PCT/EP2023/061786 WO2023222397A1 (fr) 2022-05-20 2023-05-04 Dispositif et procede de routage de flux dans les reseaux sensibles au temps
US18/864,889 US20250202789A1 (en) 2022-05-20 2023-05-04 Device and method for routing flows in time-sensitive networks
EP23723557.7A EP4527055A1 (fr) 2022-05-20 2023-05-04 Dispositif et procede de routage de flux dans les reseaux sensibles au temps

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
FR2204878A FR3135851B1 (fr) 2022-05-20 2022-05-20 Dispositif et procédé de routage de flux dans les réseaux sensibles au temps
FR2204878 2022-05-20

Publications (2)

Publication Number Publication Date
FR3135851A1 FR3135851A1 (fr) 2023-11-24
FR3135851B1 true FR3135851B1 (fr) 2025-06-06

Family

ID=84331073

Family Applications (1)

Application Number Title Priority Date Filing Date
FR2204878A Active FR3135851B1 (fr) 2022-05-20 2022-05-20 Dispositif et procédé de routage de flux dans les réseaux sensibles au temps

Country Status (4)

Country Link
US (1) US20250202789A1 (fr)
EP (1) EP4527055A1 (fr)
FR (1) FR3135851B1 (fr)
WO (1) WO2023222397A1 (fr)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN120223620B (zh) * 2025-05-28 2025-08-12 四川更元科技有限公司 一种基于延迟容忍的启发式流量调度方法

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CA924254A (en) 1970-10-01 1973-04-10 Sherritt Gordon Mines Limited Diverting and sampling gate
US10404608B2 (en) * 2014-10-31 2019-09-03 Huawei Technologies Co., Ltd. Systems, devices, and methods for low-jitter communication over a packet-switched network
US11072356B2 (en) * 2016-06-30 2021-07-27 Transportation Ip Holdings, Llc Vehicle control system
EP3869752B1 (fr) * 2020-02-24 2024-02-14 Moxa Inc. Dispositif et procédé de gestion de trajets de routage pour des flux dans un réseau sensible au temps
US11411891B2 (en) * 2020-10-30 2022-08-09 Ge Aviation Systems Llc System and method for a time-sensitive network
KR102595945B1 (ko) * 2022-01-04 2023-10-30 네스트필드(주) 산업용 ＩｏＴ에서 사용되는 ＴＳＮ 네트워크를 위한 비결정적 중단을 제거하는 공동 트래픽 라우팅 및 스케줄링 방법
CN119071209A (zh) * 2023-05-30 2024-12-03 四零四科技股份有限公司 路由路径决定方法及网络装置

Also Published As

Publication number Publication date
US20250202789A1 (en) 2025-06-19
WO2023222397A1 (fr) 2023-11-23
EP4527055A1 (fr) 2025-03-26
FR3135851A1 (fr) 2023-11-24

Similar Documents

Publication Publication Date Title
US7233574B2 (en) Multi-path dynamic routing algorithm
CN101939954B (zh) 终端装置和n-树构筑方法
KR100716153B1 (ko) 비동기 패킷 전송망에서의 단대단 지연 측정 방법, 비동기패킷 송신기 및 수신기
JP2006254452A (ja) Ｉｐ電話のためのサービス品質保証
Kodialam et al. Online multicast routing with bandwidth guarantees: a new approach using multicast network flow
Sharma et al. Routing and scheduling for 1+ 1 protected DetNet flows
Chen et al. A new approach to routing with dynamic metrics
Morawski et al. MPTCP or MPQUIC-which one is better for general-purpose networking
CN101127705B (zh) 实现网络传输服务质量的方法
US20190319880A1 (en) Software defined network and method for operating the same
Miserez et al. Routing protocols exploiting queue information for deterministic networks
Kamei et al. Evaluation of routing algorithms and network topologies for MIPLS traffic engineering
Sllame et al. Performance comparison of VoIP over wireless ad hoc networks using different routing protocols and queuing techniques
Lu et al. Contention reduction in core optical packet switches through electronic traffic smoothing and scheduling at the network edge
Hua et al. A DTN congestion mechanism based on Distributed Storage
Tahir et al. Performance analysis of MPLS based networks with conventional networks
Christodoulopoulos et al. Relaxing delayed reservations: An approach for quality of service differentiation in optical burst switching networks
Yasin et al. Improving triple play services using multi protocol label switching technology
KR20060015051A (ko) 멀티프로토콜 레이블 스위칭 망에서의 서비스 품질 보장형라우팅 경로 설정 방법
Prakash et al. A feasible path selection QoS Routing Algorithm with two constraints in Packet Switched Networks
Akinsipe et al. Evaluating IP, MPLS and MPLS RSVP-TE Networks
Pagani et al. Measurement-based admission control for dynamic multicast groups in Diff-Serv networks
Rangaswamy et al. Adaptive Routing Algorithms in Distributed Networks
Parra et al. Performance evaluation in IP/MPLS networks
Zeng et al. Delay Variation Optimized Traffic Allocation Based on Network Calculus for Multi-path Routing in Wireless Mesh Networks

Legal Events

Date Code Title Description
PLFP Fee payment

Year of fee payment: 2

PLSC Publication of the preliminary search report

Effective date: 20231124

PLFP Fee payment

Year of fee payment: 3

PLFP Fee payment

Year of fee payment: 4