Nothing Special   »   [go: up one dir, main page]

Eryilmaz et al., 2006 - Google Patents

Randomized algorithms for throughput-optimality and fairness in wireless networks

Eryilmaz et al., 2006

View PDF
Document ID
8906876510884442759
Author
Eryilmaz A
Modiano E
Ozdaglar A
Publication year
Publication venue
Proceedings of the 45th IEEE Conference on Decision and Control

External Links

Snippet

In this paper, we study multi-hop wireless networks with general interference models, and describe a practical randomized routing-scheduling-congestion-control mechanism that is guaranteed to fully utilize the network capacity, and achieve fair allocation of the resources …
Continue reading at asu.mit.edu (PDF) (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/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
    • 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/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
    • H04L47/00—Traffic regulation in packet switching networks
    • H04L47/70—Admission control or resource allocation
    • H04L47/82—Miscellaneous aspects
    • 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/5041—Service implementation
    • 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
    • H04L12/00—Data switching networks
    • H04L12/02—Details
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. local area networks [LAN], wide area networks [WAN]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organizing networks, e.g. ad-hoc networks or sensor networks
    • 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/02—Topology update or discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W84/00—Network topologies
    • H04W84/02—Hierarchical pre-organized networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W72/00—Local resource management, e.g. wireless traffic scheduling or selection or allocation of wireless resources
    • H04W72/12—Dynamic Wireless traffic scheduling; Dynamically scheduled allocation on shared channel
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements

Similar Documents

Publication Publication Date Title
Wu et al. Scheduling efficiency of distributed greedy scheduling algorithms in wireless networks
Bui et al. Joint Asynchronous Congestion Control and Distributed Scheduling for Multi-Hop Wireless Networks.
Wu et al. Regulated maximal matching: A distributed scheduling algorithm for multi-hop wireless networks with node-exclusive spectrum sharing
Le et al. Optimal control of wireless networks with finite buffers
Neely et al. Fairness and optimal stochastic control for heterogeneous networks
Bui et al. Novel architectures and algorithms for delay reduction in back-pressure scheduling and routing
Eryilmaz et al. Polynomial complexity algorithms for full utilization of multi-hop wireless networks
Haque et al. SDSense: An agile and flexible SDN-based framework for wireless sensor networks
Ji et al. Throughput-optimal scheduling in multihop wireless networks without per-flow information
Wu et al. Queue-length stability of maximal greedy schedules in wireless networks
Joo et al. Greedy maximal matching: Performance limits for arbitrary network graphs under the node-exclusive interference model
Deng et al. Online routing and scheduling with capacity redundancy for timely delivery guarantees in multihop networks
Li et al. A unified approach to optimizing performance in networks serving heterogeneous flows
Mao et al. Online packet scheduling with hard deadlines in multihop communication networks
Qiu et al. Towards optimal rate allocation in multi-hop wireless networks with delay constraints: A double-price approach
Sinha et al. Network utility maximization with heterogeneous traffic flows
Bui et al. Asynchronous congestion control in multi-hop wireless networks with maximal matching-based scheduling
Venkataramanan et al. Low-complexity scheduling algorithm for sum-queue minimization in wireless convergecast
Eryilmaz et al. Randomized algorithms for throughput-optimality and fairness in wireless networks
Teymoori et al. A fair and efficient resource allocation scheme for multi-server distributed systems and networks
Majumder et al. Cognitive-Radio-Based Resource Management for Smart Transportation: A Sliding Mode Control Approach
Zhao et al. Service function chains deployment for 5G slice with bandwidth coupling
Xue et al. On reducing delay and temporal starvation of queue-length-based CSMA algorithms
Wang et al. An atomic routing game for multi-class communication networks with quality of service requirements
Douligeris et al. Fairness issues in the networking environment