Scheduling strategies for parallel and distributed computing have mostly been oriented toward performance, while striving to achieve some notion of fairness. With the increase in ...
Darin England, Jon B. Weissman, Jayashree Sadagopa...
We study the mergeability of data summaries. Informally speaking, mergeability requires that, given two summaries on two data sets, there is a way to merge the two summaries into ...
Pankaj K. Agarwal, Graham Cormode, Zengfeng Huang,...
—We consider connection-level models of resource allocation in the Internet, where files arrive into the network according to a Poisson process and the size of each file is exp...
Address Fragmentation plays a key role in the exponential growth of DFZ routing table, known as the scalability problem of current Internet. In this paper, we measure the severity ...
The Internet Distance Map Service (IDMaps) [3] provides distance estimates between any pair of hosts connected to the Internet. The IDMaps system comprises two component types: Tr...