We discuss what kind of overlay topology should be proactively built before an overlay routing protocol enters a route search process on top of it. The basic overlay structures we study are the K-Nearest Neighbours overlay topologies, connecting every overlay node to its K nearest peers. We introduce a family of optimizations, based on a pruning rule. As flooding is a key component of many rout...

Overlay networks are emerging as a platform to enhance the core network routing functionality. They form a new network layer on top of the Internet and offer a whole range of network enhancements, such as extra resilience, QoS (Quality of Service) support and overlay multicasting. This paper discusses how an overlay network is used to provide an end-toend QoS enabled multicast network. It descr...

⎯ This paper studies the impact of peer-to-peer (p2p) applications on network operators. P2p applications affect the way network resources are used, changing traffic behaviour at access, edge and peering levels. In particular, they make up overlay networks with topology decoupled from the underlying physical networks: a consequence is inefficiency and higher link loads at edge and peering level...

SRS is a widely used system for integrating biological databases. Currently, SRS relies only on locally provided copies of these databases. In this paper we propose a mechanism that also allows the seamless integration of remote databases. To this end, our proposed mechanism splits the existing SRS functionality into two components and adds a third component that enables us to employ peer-to-pe...

This paper proposes a novel recovery method from large-scale network failures caused by earthquakes, terrorist attacks, largescale power outages, and software bugs. Our method, which takes advantage of overlay networking technologies, pre-calculates multiple routing configurations for multiple network failures occurring simultaneously and selects the appropriate configuration immediately after ...

Selfish overlay routing is the technique whereby the sender of the packet can specify the route that the packet should take through the network. Selfish overlay routing allow end users to select routes in an egocentic fashion to optimize their own performance without considering the system wide criteria which in turn cause performance degradation .The main concept behind the selfish overlay net...

This paper presents a combinational quantum-inspired binary gravitational search algorithm (QBGSA) for solving the optimal power quality monitor (PQM) placement problem in power systems for voltage sag assessment. In this algorithm, the standard binary gravitational search algorithm is modified by applying the concept and principles of quantum behaviour as to improve the search capability with ...

Let f : R → [r] = {1, 2, . . . , r} be a measurable function, and let {Ui}i∈N be a sequence of i.i.d. random variables. Consider the random process Zi = f(Ui, ..., Ui+k−1). We show that for all q, there is a positive probability, uniform in f , that Z1 = Z2 = ... = Zq. A continuous counterpart is that if f : R → R, and Ui and Zi are as before, then there is a positive probability, uniform in f ...