Monitoring end-to-end paths in an overlay network is essential for evaluating end-system performance and for troubleshooting anomalous behavior. However, conducting measurements between all pairs of overlay nodes can be cumbersome and expensive, especially in a large network. In this paper, we take a different approach and explore an additional degree of freedom, namely, monitoring native links...

Growing demand for use of Internet/Web-based services in large scale real-time distributed virtual simulation (RT-DVS) and other real-time applications is fueling extensive interest in overlay multicast protocols. These applications require many-to-many multicast services that are not available as an open Internet service today and are not likely to be offered as an Internet-wide service in the...

The main goal of the research is to evaluate suitability landforms in Zamaqi valley basin for Human uses, dependence on satellite images which have been received from (Landsat8 OLI) (NASA) https://earthexplorer.usgs.gov (USGS) site, by using Geographical information system, depending function of(overlay-weighted overlay) a tool (Special Analyst tools).rather than used (Geology information, Topo...

Overlay networks are an important kind of P2P infrastructures. The range of applications and requirements is broad. Consequently, our research objective are overlay networks which organize and adapt themselves at runtime. This article describes the current state of our project and gives an overview of the steps envisioned. We briefly show the necessity for self-organization in overlay networks....

The simplicity of multicast as a communication primitive belies its broad utility as a building block for distributed applications. Nevertheless, creating and maintaining multicast structures can be challenging, particularly when networks are transient and/or dynamic. We introduce a new unstructured multi-source multicast (UMM) overlay approach that we argue is less complex than, but as efficie...

In this paper we propose a theoretical framework to analyze and assess the properties of overlay networks with the goal of studying problems related to rival resource sharing. We study optimality goals for the construction of such overlay networks and focus on fairness issues by defining perfectly reciprocal overlays, in which every peer receives exactly the same amount of resources it offers. ...

The growth of peer-to-peer applications on the Internet motivates interest in general purpose overlay networks. The construction of overlays connecting a large population of transient nodes poses several challenges. First, connections in the overlay should reflect the underlying network topology, in order to avoid overloading the network and to allow good application performance. Second, connec...

Every peer-to-peer system is based on some overlay network connecting its peers. Many of the overlay network concepts proposed in the scientific community are based on the concept of virtual space. These designs are usually highly scalable, but they do not guarantee robustness against adversarial attacks, especially when considering open peer-to-peer systems. In these systems, determined advers...

A fundamental problem for overlay networks is to safely exclude leaving nodes, i.e., the nodes requesting to leave the overlay network are excluded from it without affecting its connectivity. There are a number of studies for safe node exclusion if the overlay is in a well-defined state, but almost no formal results are known for the case in which the overlay network is in an arbitrary initial ...

In this paper, we examine the effect of overlay structure in live peer-to-peer (P2P) streaming applications, on the inter-AS traffic. We identify a collection of edge ASes whose clients are likely to participate in P2P streaming applications. We derive the AS-level path between all pairs of selected edge ASes by simulating BGP routing over a snapshot of ASlevel topology. We consider three diffe...