Search
Now showing items 61-70 of 88
On the random graph induced by a randomized predistribution scheme under full visibility (Extended version)
(2008)
We consider the random graph induced by the random key predistribution scheme of Eschenauer and Gligor under the assumption of full visibility. We show the existence of a zero-one law for the absence of isolated nodes, and ...
On zero-one laws for connectivity in one-dimensional geometric random graphs
(2006)
We consider the geometric random graph where n points are distributed uniformly and independently on the unit interval [0,1]. Using the method of first and second moments, we provide a simple proof of the "zero-one" law ...
The output of a cache under the independent reference model - Where did the locality of reference go?
(2004)
We consider a cache operating under a demand-driven replacement policy when document requests are modeled according to the Independent Reference Model (IRM). We characterize the popularity pmf of the stream of misses from ...
Analysis and Adaptive Control of a Discrete-Time Single-Server Network with Random-Routing.
(1989)
This paper considers a discrete-time system composed of K infinite capacity queues that compete for the use of a single server. Customers arrive in i.i.d batches and are served according to a server allocation policy. Upon ...
Analysis and Adaptive Control of a Discrete-Time Single-Senrer Network with Random Routing.
(1989)
This paper considers a discrete time system composed of K infinite capacity queues that compete for the use of a single server. Customers arrive in i.i.d batches and are served according to a server allocation policy. Upon ...
When Are On-Off Sources SIS? Conditions and Applications
(2002)
Recent advances from the theory of multivariate stochastic orderings can be used to formalize the lqlq folk theorem" to the effect that positive correlations lead to larger buffer levels at a discrete-time infinite capacity ...
On random graphs associated with a pairwise key distribution scheme
(2010-01-01)
The pairwise key distribution scheme of Chan
et al. was proposed as an alternative to the key distribution scheme of Eschenauer and Gligor to enable network security in wireless sensor networks. We consider the random ...
Asymptotic optimality of the Round--Robin policy in multipath routing with resequencing
(2005)
We consider a model of a multipath routing system, where arriving customers are routed to a set of identical, parallel, single server queues, according to balancing policies operating without state information. After ...
Distribution of path durations in mobile ad-hoc networks - Palm's Theorem at work
(2003)
We study the distribution of a path duration in multi-hop wireless networks. We show that as the number of hops along a path increases, the path duration distribution can be accurately approximated by an exponential ...