Sciweavers

1859 search results - page 142 / 372
» Sketch-based path design
Sort
View
WADS
2007
Springer
130views Algorithms» more  WADS 2007»
14 years 3 months ago
Approximating the Maximum Sharing Problem
In the maximum sharing problem (MS), we want to compute a set of (non-simple) paths in an undirected bipartite graph covering as many nodes as possible of the first layer of the ...
Amitabh Chaudhary, Danny Z. Chen, Rudolf Fleischer...
WWIC
2007
Springer
109views Communications» more  WWIC 2007»
14 years 3 months ago
QoS and Authentication Experiences in a Residential Environment Within a Broadband Access Framework
It is sometimes believed that a “broadband access” network, providing ample transmission capacity to residential environments, is enough so as to allow a flawless delivery of a...
Iván Vidal, Francisco Valera, Jaime Garc&ia...
EUROMICRO
2006
IEEE
14 years 3 months ago
BGP-like TE Capabilities for SHIM6
In this paper we present a comprehensive set of mechanisms that restore to the site administrator the capacity of enforcing Traffic Engineering (TE) policies in a multiaddressed I...
Marcelo Bagnulo, Alberto García-Martí...
ICDCS
2005
IEEE
14 years 2 months ago
Characterizing and Predicting TCP Throughput on the Wide Area Network
DualPats exploits the strong correlation between TCP throughput and flow size, and the statistical stability of Internet path characteristics to accurately predict the TCP throug...
Dong Lu, Yi Qiao, Peter A. Dinda, Fabián E....
ICDCSW
2005
IEEE
14 years 2 months ago
Specifying Information-Flow Controls
The core problem in risk analysis - determining exploitable paths between attackers and system assets is essentially a problem of determining information flow. It is relatively st...
Howard Chivers, Jeremy Jacob