We present a formalism that is able to cope with search and congestion simultaneously. This formalism avoids the problem of simulating the dynamics of the search-communication proc...
In the paper we present approaches to calculate single connections availability. Approximate calculations for the most representative protection topologies as well as for a partic...
We propose a new distributed, fault-tolerant peer-to-peer index structure called the P-tree. P-trees efficiently evaluate range queries in addition to equality queries.
Adina Crainiceanu, Prakash Linga, Johannes Gehrke,...
A simple explanation is given of an anomaly often detected in traffic measurement when packet timings are truncated to nearest whole numbers. The correct observed discrete distrib...
Vic Grout, Stuart Cunningham, Denise Oram, Rich He...
In this paper, we classified existing address autoconfiguration schemes based on two communication models: centralized and distributed schemes. We defined performance metrics and ...
Soyeon Ahn, Namhoon Kim, Woohyun Kim, Younghee Lee