[go: up one dir, main page]

Epstein et al., 2009 - Google Patents

Efficient graph topologies in network routing games

Epstein et al., 2009

View PDF
Document ID
7201965163588203561
Author
Epstein A
Feldman M
Mansour Y
Publication year
Publication venue
Games and Economic Behavior

External Links

Snippet

A topology is efficient for network games if, for any game over it, every Nash equilibrium is socially optimal. It is well known that many topologies are not efficient for network games. We characterize efficient topologies in network games with a finite set of players, each …
Continue reading at www.cs.tau.ac.il (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
    • 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
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • 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]
    • H04L12/46—Interconnection of networks
    • H04L12/4604—LAN interconnection over a backbone network, e.g. Internet, Frame Relay
    • H04L12/462—LAN interconnection over a bridge based backbone
    • 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/04—Interdomain routing, e.g. hierarchical routing
    • 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/48—Routing tree calculation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • 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
    • 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
    • H04L41/00—Arrangements for maintenance or administration or management of packet switching networks
    • H04L41/12—Arrangements for maintenance or administration or management of packet switching networks network topology discovery or management
    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • 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

Similar Documents

Publication Publication Date Title
Epstein et al. Efficient graph topologies in network routing games
Sallam et al. Shortest path and maximum flow problems under service function chaining constraints
Nace et al. Max-min fairness and its applications to routing and load-balancing in communication networks: a tutorial
Zhuo et al. Traffic dynamics on layered complex networks
CN105681153B (en) A virtual network mapping method and device
Li et al. Resource allocation with multi-factor node ranking in data center networks
Szczepanski et al. A new approach to betweenness centrality based on the shapley value
Shahrivar et al. The strategic formation of multi-layer networks
Zhang et al. Virtual network embedding with substrate support for parallelization
CN106681795B (en) A Virtual Network Mapping Method for Node Local Topology and Available Resource Capacity
CN107528731A (en) Network applied to NS3 parallel artificials splits optimized algorithm
Lin et al. Scheduling algorithms for time-constrained big-file transfers in the Internet of Vehicles
Wang et al. Joint optimization on bandwidth allocation and route selection in QoE-aware traffic engineering
Bilo et al. Improved lower bounds on the price of stability of undirected network design games
Yang et al. Scalable forwarding tables for supporting flexible policies in enterprise networks
Liu et al. Flow splitting scheme over link‐disjoint multiple paths in software‐defined networking
Shu et al. Advance bandwidth reservation for energy efficiency in high-performance networks
Busch et al. Atomic routing games on maximum congestion
Li et al. Exascale interconnect topology characterization and parameter exploration
Caraccio et al. Joint Stationary Distribution Of Queues In Homogenous M| M| 3 Queue With Resequencing.
Sperber How to find Nash equilibria with extreme total latency in network congestion games?
Absar et al. Performance measurement of open shortest path first (OSPF) protocol in IP networks
Elmiligi et al. A delay-aware topology-based design for networks-on-chip applications
Qingqi et al. Multi-objective mapping for network-on-chip based on bio-inspired optimization algorithms
Rubino On Kleinrock's power metric for queueing systems