Fair Allocation of Substrate Resources among Multiple Overlay Networks

Demirci, Mehmet; Ammar, Mostafa

doi:10.1109/mascots.2010.21

Cited by 4 publications

(2 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In Demirci and Ammar (2010) the problem of how to best allocate bandwidth among competing and coexisting overlay networks running on the same physical network infrastructure is examined. A fairness metric is introduced in order to regulate bandwidth sharing with quite promising results.…”

Section: Coexistence Of Multiple Overlaysmentioning

confidence: 99%

State-of-the-art survey on P2P overlay networks in pervasive computing environments

Malatras

2015

Journal of Network and Computer Applications

View full text Add to dashboard Cite

a b s t r a c t P2P overlay networks have attracted significant research interest due to their utility as virtualized abstractions of complex network infrastructures, optimized to satisfy specific criteria, e.g. minimum delay or shortest diameter. In the context of modern pervasive environments, which are characterized by complexity, heterogeneity, dynamicity, and mobility in terms of the underlying networks, the utilization of P2P overlays accordingly offers a series of advantages by countering the aforementioned adverse characteristics. The widespread deployment of pervasive environments and the plethora of proposed P2P systems, both call for a systematic way to study related research works. In this paper we review related research on P2P (peer-to-peer) overlay networks in pervasive environments. In this respect, we therefore analyze relevant requirements and discuss the application and deployment of P2P overlays and systems on top of the networking infrastructures that are supported by pervasive environments. Aspects such as scalability, resource discovery, algorithmic complexity, security, and support for dynamicity are examined for existing research works, in an effort to identify the most suitable P2P overlay for the requirements set by the nature of pervasive environments. We also taxonomize P2P overlays using the well-established classification scheme in regard to their structure or lack of it. Furthermore, we study the notions of multi-layer and bio-inspired P2P overlays that have great synergies with pervasive environments due to their inherent characteristics, especially in terms of flexibility and robustness. By describing and critically analyzing existing systems and discussing current research and open issues, we aim to instigate further research in this domain, while at the same time this work should serve as a point of reference for state-of-the-art P2P overlays in pervasive environments.

show abstract

Section: Coexistence Of Multiple Overlaysmentioning

confidence: 99%

State-of-the-art survey on P2P overlay networks in pervasive computing environments

Malatras

2015

Journal of Network and Computer Applications

View full text Add to dashboard Cite

show abstract

“…In this context, a virtual network (VN) is built on top of a substrate network and is granted a portion of the substrate physical resources. This decoupling of virtual networks from the physical substrate provides opportunities for flexible VN management when allocating substrate resources [6], [7], [8], [9]). Figure 1 shows by example multiple VNs that are built on top of the same substrate network.…”

Section: Introductionmentioning

confidence: 99%

Virtual network migration on real infrastructure: A PlanetLab case study

Ammar

Zegura

et al. 2014

2014 IFIP Networking Conference

Self Cite

View full text Add to dashboard Cite

Network virtualization enables the deployment of novel network architectures and services on existing Internet infrastructure. In addition, virtual networks (VNs) can share the resources in the physical substrate. To enable efficient resource reallocation and network agility, VNs must sometimes migrate, i.e., change their placements on a substrate network. While VN placement, and to a lesser extent migration, has been studied in the past, little attention has been devoted to deploying and evaluating these functions over a real infrastructure. In this paper, we study the VN migration problem based on network virtualization in PlanetLab. We create a tool, PL-VNM, that orchestrates the VN migration on PlanetLab for a given new VN placement. The design and deployment of the tool reveal challenges and constraints. Some are particular to PlanetLab while others apply more generally to any virtualized infrastructure. Most significantly, we find that while in principle one can specify a migration schedule (sequence of migration steps) as an input to our tool, certain PlanetLab features make VN migration scheduling very difficult if not infeasible. Our work leads to recommendations about the features of a general virtualization environment and specific recommendations for PlanetLab that enable VN migration and migration scheduling. We believe that the recommended features make long-term experiments and application deployments on PlanetLab and other realistic virtualized infrastructures possible.

show abstract