The intrinsically secure communications graph (-graph) is a random graph which captures the connections that can be securely established over a large-scale network, in the presence...
In Kahn process network (KPN), the processes (nodes) communicate by unbounded unidirectional FIFO channels (arcs), with the property of non-blocking writes and blocking reads on t...
Syed Suhaib, Deepak Mathaikutty, Sandeep K. Shukla
The population protocol model [2] has emerged as an elegant computation paradigm for describing mobile ad hoc networks, consisting of a number of mobile nodes that interact with e...
We present an extensive analysis of long-term statistics of the queries to websites using logs collected on several web caches in Russian academic networks and on US IRCache cache...
Serge A. Krashakov, Anton B. Teslyuk, Lev N. Shchu...
Motivated by a scheduling problem that arises in the study of optical networks we prove the following result, which is a variation of a conjecture of Haxell, Wilfong and Winkler. ...