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...
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...
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...
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...
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...