Sciweavers

597 search results - page 73 / 120
» Homomorphisms of random paths
Sort
View
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
14 years 10 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
CCS
2006
ACM
14 years 1 months ago
EXE: automatically generating inputs of death
This paper presents EXE, an effective bug-finding tool that automatically generates inputs that crash real code. Instead of running code on manually or randomly constructed input,...
Cristian Cadar, Vijay Ganesh, Peter M. Pawlowski, ...
ICC
2007
IEEE
130views Communications» more  ICC 2007»
14 years 4 months ago
A Distributed Scheme for Responsive Network Engineering
— Optimal bandwidth utilisation together with resilience and recovery from failure are two key drivers for Traffic Engineering (TE) which have been widely addressed by the IP co...
Johannes Göbel, Anthony E. Krzesinski, Dieter...
INFOCOM
2003
IEEE
14 years 3 months ago
Estimation of Congestion Price Using Probabilistic Packet Marking
Abstract— One key component of recent pricing-based congestion control schemes is an algorithm for probabilistically setting the Explicit Congestion Notification bit at routers ...
Micah Adler, Jin-yi Cai, Jonathan K. Shapiro, Dona...
INFOCOM
2009
IEEE
14 years 4 months ago
Scaling Laws on Multicast Capacity of Large Scale Wireless Networks
—In this paper, we focus on the networking-theoretic multicast capacity for both random extended networks (REN) and random dense networks (RDN) under Gaussian Channel model, when...
Cheng Wang, Xiang-Yang Li, Changjun Jiang, ShaoJie...