Sciweavers

1639 search results - page 271 / 328
» Degree-constrained network flows
Sort
View
INFOCOM
2006
IEEE
14 years 4 months ago
Bottleneck Routing Games in Communication Networks
—We consider routing games where the performance of each user is dictated by the worst (bottleneck) element it employs. We are given a network, finitely many (selfish) users, eac...
Ron Banner, Ariel Orda
MOBICOM
2006
ACM
14 years 3 months ago
On optimal communication cost for gathering correlated data through wireless sensor networks
In many energy-constrained wireless sensor networks, nodes cooperatively forward correlated sensed data to data sinks. In order to reduce the communication cost (e.g. overall ener...
Junning Liu, Micah Adler, Donald F. Towsley, Chun ...
VRML
2006
ACM
14 years 3 months ago
A case for 3D streaming on peer-to-peer networks
One of the most serious issues holding back the widespread of 3D contents on Internet has been their inaccessibility due to large data volume. Many compression and progressive tra...
Shun-Yun Hu
IMC
2005
ACM
14 years 3 months ago
An Information-theoretic Approach to Network Monitoring and Measurement
Network engineers and operators are faced with a number of challenges that arise in the context of network monitoring and measurement. These include: i) how much information is in...
Yong Liu, Donald F. Towsley, Tao Ye, Jean-Chrysost...
VIZSEC
2005
Springer
14 years 3 months ago
Multiple Coordinated Views for Network Attack Graphs
While efficient graph-based representations have been developed for modeling combinations of low-level network attacks, relatively little attention has been paid to effective tech...
Steven Noel, Michael Jacobs, Pramod Kalapa, Sushil...