Sciweavers

1657 search results - page 153 / 332
» Network flow spanners
Sort
View
SAGT
2009
Springer
163views Game Theory» more  SAGT 2009»
15 years 7 months ago
Nash Equilibria and the Price of Anarchy for Flows over Time
We study Nash equilibria and the price of anarchy in the context of flows over time. Many results on static routing games have been obtained over the last ten years. In flows ov...
Ronald Koch, Martin Skutella
TAMC
2009
Springer
15 years 7 months ago
A Simple Greedy Algorithm for the k-Disjoint Flow Problem
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
Maren Martens
100
Voted
IEEEARES
2008
IEEE
15 years 7 months ago
Rapid Detection of Constant-Packet-Rate Flows
—The demand for effective VoIP and online gaming traffic management methods continues to increase for purposes such as QoS provisioning, usage accounting, and blocking VoIP call...
Kuan-Ta Chen, Jing-Kai Lou
IPPS
2007
IEEE
15 years 7 months ago
New Results on the Performance Effects of Autocorrelated Flows in Systems
Temporal dependence within the workload of any computing or networking system has been widely recognized as a significant factor affecting performance. More specifically, burstin...
Evgenia Smirni, Qi Zhang, Ningfang Mi, Alma Riska,...
87
Voted
IPPS
2007
IEEE
15 years 7 months ago
Speculative Flow Control for High-Radix Datacenter Interconnect Routers
High-radix switches are desirable building blocks for large computer interconnection networks, because they are more suitable to convert chip I/O bandwidth into low latency and lo...
Cyriel Minkenberg, Mitchell Gusat