Sciweavers

2796 search results - page 527 / 560
» The coolest path problem
Sort
View
COMCOM
2008
158views more  COMCOM 2008»
14 years 12 months ago
Load aware traffic engineering for mesh networks
Wireless Mesh Network (WMN) is a multi-hop mesh network that consists of mesh routers and mesh clients, where mesh routers are static and form the backbone of the mesh network. Th...
Devu Manikantan Shila, Tricha Anjali
CORR
2008
Springer
108views Education» more  CORR 2008»
14 years 12 months ago
On Maximizing Coverage in Gaussian Relay Networks
Results for Gaussian relay channels typically focus on maximizing transmission rates for given locations of the source, relay and destination. We introduce an alternative perspecti...
Vaneet Aggarwal, Amir Bennatan, A. Robert Calderba...
DAM
2010
167views more  DAM 2010»
14 years 12 months ago
A new characterization of P6-free graphs
We study P6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P6-free if an...
Pim van 't Hof, Daniël Paulusma
EOR
2010
87views more  EOR 2010»
14 years 12 months ago
On the system optimum of traffic assignment in M/G/c/c state-dependent queueing networks
-- The classical Wardrop System Optimum (SO) assignment model assumes that the users will cooperate with each other in order to minimize the overall travel costs. The importance of...
Frederico R. B. Cruz, Tom Van Woensel, James MacGr...
CN
2006
79views more  CN 2006»
14 years 12 months ago
Explicit rate multicast congestion control
In this article, we propose a new single-rate end-to-end multicast congestion control scheme called Explicit Rate Multicast Congestion Control (ERMCC) based on a new metric, TRAC ...
Jiang Li, Murat Yuksel, Shivkumar Kalyanaraman