Sciweavers

1806 search results - page 336 / 362
» Randomness and halting probabilities
Sort
View
INFOCOM
2006
IEEE
14 years 3 months ago
Looking at Large Networks: Coding vs. Queueing
— Traditionally, network buffer resources have been used at routers to queue transient packets to prevent packet drops. In contrast, we propose a scheme for large multi-hop netwo...
Sandeep Bhadra, Sanjay Shakkottai
INFOCOM
2006
IEEE
14 years 3 months ago
Accelerating Simulation of Large-Scale IP Networks: A Network Invariant Preserving Approach
— In this paper, we propose a simulation framework, TranSim, that reduces the rate at which packet-events are generated, in order to accelerate large-scale simulation of IP netwo...
Hwangnam Kim, Hyuk Lim, Jennifer C. Hou
INFOCOM
2006
IEEE
14 years 3 months ago
Utility-Optimal Medium Access Control: Reverse and Forward Engineering
— This paper analyzes and designs medium access control (MAC) protocols for wireless ad-hoc networks through the network utility maximization (NUM) framework. We first reverse-e...
Jang-Won Lee, Mung Chiang, A. Robert Calderbank
SIGMETRICS
2006
ACM
14 years 3 months ago
Robust network connectivity: when it's the big picture that matters
This work analyzes the connectivity of large diameter networks where every link has an independent probability p of failure. We give a (relatively simple) topological condition th...
Enoch Peserico, Larry Rudolph
FOCS
2005
IEEE
14 years 3 months ago
Truthful and Near-Optimal Mechanism Design via Linear Programming
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
Ron Lavi, Chaitanya Swamy