Sharafzadeh, 2025 - Google Patents
Identifying and addressing the implications of bursty network trafficSharafzadeh, 2025
View PDF- Document ID
- 17865890820997713328
- Author
- Sharafzadeh E
- Publication year
External Links
Snippet
Measurements of network traffic unveil periods of high link utilization that can exhaust switch buffers and lead to packet loss. Unfortunately, the diversity and ever-changing nature of networks, workloads and traffic patterns, and even host networking deployments pose a …
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic regulation in packet switching networks
- H04L47/10—Flow control or congestion control
- H04L47/24—Flow control or congestion control depending on the type of traffic, e.g. priority or quality of service [QoS]
- H04L47/2441—Flow classification
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5693—Queue scheduling in packet switching networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic regulation in packet switching networks
- H04L47/10—Flow control or congestion control
- H04L47/24—Flow control or congestion control depending on the type of traffic, e.g. priority or quality of service [QoS]
- H04L47/2458—Modification of priorities while in transit
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic regulation in packet switching networks
- H04L47/10—Flow control or congestion control
- H04L47/22—Traffic shaping
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic regulation in packet switching networks
- H04L47/10—Flow control or congestion control
- H04L47/24—Flow control or congestion control depending on the type of traffic, e.g. priority or quality of service [QoS]
- H04L47/2425—Service 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 regulation in packet switching networks
- H04L47/50—Queue scheduling
- H04L47/62—General aspects
- H04L47/6215—Individual queue per QOS, rate or priority
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic regulation in packet switching networks
- H04L47/10—Flow control or congestion control
- H04L47/32—Packet discarding or delaying
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic regulation in packet switching networks
- H04L47/10—Flow control or congestion control
- H04L47/12—Congestion avoidance or recovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic regulation in packet switching networks
- H04L47/10—Flow control or congestion control
- H04L47/19—Flow control or congestion control at layers above network layer
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic regulation in packet switching networks
- H04L47/10—Flow control or congestion control
- H04L47/21—Flow control or congestion control using leaky bucket
- H04L47/215—Token bucket
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic regulation in packet switching networks
- H04L47/10—Flow control or congestion control
- H04L47/30—Flow control or congestion control using information about buffer occupancy at either end or transit nodes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic regulation in packet switching networks
- H04L47/50—Queue scheduling
- H04L47/56—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 packet switching networks
- H04L43/08—Monitoring based on specific metrics
- H04L43/0876—Network utilization
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance or administration or management of packet switching networks
- H04L41/50—Network service management, i.e. ensuring proper service fulfillment according to an agreement or contract between two parties, e.g. between an IT-provider and a customer
- H04L41/5019—Ensuring SLA
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/90—Queuing arrangements
-
- 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
- H04L67/00—Network-specific arrangements or communication protocols supporting networked applications
- H04L67/32—Network-specific arrangements or communication protocols supporting networked applications for scheduling or organising the servicing of application requests, e.g. requests for application data transmissions involving the analysis and optimisation of the required network resources
- H04L67/322—Network-specific arrangements or communication protocols supporting networked applications for scheduling or organising the servicing of application requests, e.g. requests for application data transmissions involving the analysis and optimisation of the required network resources whereby quality of service [QoS] or priority requirements are taken into account
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10262700B2 (en) | System and method for determining a cause of network congestion | |
| Hong et al. | Finishing flows quickly with preemptive scheduling | |
| Bai et al. | Enabling {ECN} in {Multi-Service}{Multi-Queue} Data Centers | |
| US9800485B2 (en) | System and method for determining an effect of network congestion | |
| Alizadeh et al. | pFabric: Minimal near-optimal datacenter transport | |
| Susanto et al. | Stream: Decentralized opportunistic inter-coflow scheduling for datacenter networks | |
| Li et al. | Low-complexity multi-resource packet scheduling for network function virtualization | |
| CN114095457A (en) | Stream-Based Shared Buffer Resource Management | |
| Li et al. | Survey on traffic management in data center network: from link layer to application layer | |
| Li et al. | OPTAS: Decentralized flow monitoring and scheduling for tiny tasks | |
| Sharafzadeh et al. | Understanding the impact of host networking elements on traffic bursts | |
| Khabbaz et al. | Delay-aware flow scheduling in low latency enterprise datacenter networks: Modeling and performance analysis | |
| Imputato et al. | Design and implementation of the traffic control module in ns-3 | |
| Yusuf et al. | Review of path selection algorithms with link quality and critical switch aware for heterogeneous traffic in SDN | |
| Sharafzadeh et al. | {Self-Clocked}{Round-Robin} Packet Scheduling | |
| Rezaei et al. | Slytherin: Dynamic, network-assisted prioritization of tail packets in datacenter networks | |
| Sharafzadeh | Identifying and addressing the implications of bursty network traffic | |
| Susanto et al. | Creek: Inter many-to-many coflows scheduling for datacenter networks | |
| Tseng et al. | Coflow deadline scheduling via network-aware optimization | |
| Rezaei et al. | ResQueue: A smarter datacenter flow scheduler | |
| Lindner et al. | Alternative best effort (abe) for service differentiation: Trading loss versus delay | |
| Rezaei | Adaptive Microburst Control Techniques in Incast-Heavy Datacenter Networks | |
| Gomez Gaona | Improving TCP Performance Using P4-Programmable Data Planes | |
| Liu et al. | Automatic Dual Threshold Tuning for Switch Buffer Sharing in Datacenter Networking | |
| Khabbaz et al. | Prioritizing deadline-constrained data flows in cloud datacenter networks |