[go: up one dir, main page]

Sheu et al., 2010 - Google Patents

Asymptotically optimal control of parallel tandem queues with loss

Sheu et al., 2010

Document ID
12557841247845388764
Author
Sheu R
Ziedins I
Publication year
Publication venue
Queueing Systems

External Links

Snippet

We consider admission and routing controls for a system of N parallel tandem queues with finite buffers as N becomes large, with the aim of minimizing costs due to loss. We obtain the fluid limit as N→∞, and solve a related optimization problem. Asymptotically, for N large, the …
Continue reading at link.springer.com (other versions)

Classifications

    • 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/5695—Admission control; Resource allocation
    • 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/5601—Transfer mode dependent, e.g. ATM
    • 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
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/30—Special provisions for routing multiclass traffic
    • H04L45/306—Route determination based on the nature of the carried application
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic regulation in packet switching networks
    • H04L47/70—Admission control or resource allocation
    • H04L47/80—Actions related to the nature of the flow or the user
    • H04L47/805—QOS or priority aware
    • 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/30—Special provisions for routing multiclass traffic
    • H04L45/302—Route determination based on requested QoS
    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic regulation in packet switching networks
    • H04L47/70—Admission control or resource allocation
    • H04L47/80—Actions related to the nature of the flow or the user
    • H04L47/801—Real time traffic
    • 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/25—Routing or path finding through a switch fabric
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/02—Details

Similar Documents

Publication Publication Date Title
US11876705B2 (en) Methods and systems for adaptive stochastic-based load balancing
Walton Concave switching in single and multihop networks
Ghosh et al. Optimal buffer size for a stochastic processing network in heavy traffic
TWI435224B (en) System reliability evaluation method for routing policy
CN113472671B (en) Method, device and computer readable storage medium for determining multicast route
Sheu et al. Asymptotically optimal control of parallel tandem queues with loss
KR101311572B1 (en) Method for controlling admission and assigning resources to data flows, without a priori knowledge, in a virtual network
Martin et al. End‐to‐end response time with fixed priority scheduling: trajectory approach versus holistic approach
Bramson et al. Proportional switching in first-in, first-out networks
Morita et al. An improved routing algorithm using chaotic neurodynamics for packet routing problems
Dai et al. Stability of join-the-shortest-queue networks
US20170171085A1 (en) Traffic Engineering System and Method for a Communications Network
Walton Concave switching in single-hop and multihop networks
Czachórski et al. Software defined network dynamics via diffusions
Aboelela et al. Fuzzy generalized network approach for solving an optimization model for routing in B‐ISDN
KR20140130605A (en) Deice and Method for Scheduling Packet Transmission
López et al. Priority flow admission and routing in sdn: Exact and heuristic approaches
Kong et al. SynAVB: Route and Slope Synthesis Ensuring Guaranteed Service in Ethernet AVB
Sato et al. Virtualized network graph design and embedding model to minimize provisioning cost
Ozturk et al. Many sources asymptotics for networks with small buffers
Kruk Minimal and Locally Edge Minimal Fluid Models for Resource-Sharing Networks
De Nicola et al. Stationary characteristics of homogenous Geo| Geo| 2 queue with resequencing in discrete time
Glazebrook et al. A linear programming approach to stability, optimisationand performance analysis for Markovian multiclassqueueing networks
Maity et al. Resq: Reinforcement learning-based queue allocation in software-defined queuing framework
Balasubramanian et al. An IoT-Driven Reinforcement Learning Framework for Optimized Flow Management in Autonomous Systems