Increasing QoS in selfish overlay networks

Rocha, Beatriz G S; Almeida, Virgílio A. F.; Guedes, Dorgival

doi:10.1109/mic.2006.54

Cited by 19 publications

(25 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Previous work on overlay network creation [20], [23], [21], [24], [22] has focused on physical telecommunication networks and primarily the Internet. Overlay networks are substantially different [26], [27] which prompts us to consider the following overlay network model.…”

Section: Overlay Network Model and Definitionsmentioning

confidence: 99%

“…(2) Providing abstractions of the underlying fundamental neighbor selection problem that are analytically tractable, especially via gametheoretic analysis [20], [21], [22]. To date, however, the bulk of the work and main results in this area have centered on strategic games where edges are undirected, access costs are based on hop-counts, and nodes have potentially unbounded degrees [20], [23], [21], [24], [22]. While this existing body of work is extremely helpful for laying a theoretical foundation and for building intuition, it is not clear how or whether the guidance provided by this prior work generalizes to situations of practical interest, in which underlying assumptions in these prior studies are not satisfied.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Selfish Overlay Network Creation and Maintenance

Smaragdakis

Laoutaris

Lekakis

et al. 2011

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-A foundational issue underlying many overlay network applications ranging from routing to peer-to-peer file sharing is that of the network formation, i.e., folding new arrivals into an existing overlay, and re-wiring to cope with changing network conditions. Previous work has considered the problem from two perspectives: devising practical heuristics for the case of cooperative peers, and performing game theoretic analysis for the case of selfish peers. In our work, we unify the aforementioned thrusts by defining and studying the Selfish Neighbor Selection (SNS) game and its application to overlay routing. At the heart of SNS stands the restriction that peers are allowed up to a certain number of neighbors. This makes SNS substantially different from existing network formation games that impose no bounds on peer degrees. Having bounded degrees has important practical consequences as it permits the creation of overlay structures that require O(n) instead of O(n 2 ) link monitoring overhead. We show that a node's "best response" wiring strategy amounts to solving a k-median problem on asymmetric distance. Best response wirings have substantial practical utility as they permit selfish nodes to reap substantial performance benefits when connecting to overlays of non-selfish nodes. A more intricate consequence is that even non-selfish nodes can benefit from the existence of some selfish nodes since the latter, via their local optimizations, create a highly optimized backbone, upon which even simple heuristic wirings yield good performance. To capitalize on the above properties we design, build and deploy, EGOIST, an SNS-inspired prototype overlay routing system for PlanetLab. We demonstrate that EGOIST outperforms existing heuristic overlays on a variety of performance metrics, including delay, available bandwidth, and node utilization, while it remains competitive with an optimal, but unscalable full-mesh overlay.

show abstract

Section: Overlay Network Model and Definitionsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Selfish Overlay Network Creation and Maintenance

Smaragdakis

Laoutaris

Lekakis

et al. 2011

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

show abstract

“…The proposed model considers a node's first hand interaction experience and peer testimonials for deriving node reputations. In this regard, the reputation building process in [32] is similar to our approach. However, the proposed reputation model may not be completely robust and may not provide accurate results.…”

Section: Related Workmentioning

confidence: 96%

“…In computer science, reputation has been studied both in theoretical areas and practical applications. Theoretical areas where reputation has been studied include game theory [12], Bayesian networks [37], overlay networks, [32] and social networks [6] to name a few. Theoretical literature that addressed reputation focused on proving properties of systems based on reputation.…”

Section: Related Workmentioning

confidence: 99%

“…The semantics includes characteristics, which describe how a given attribute contributes to the overall rating of a service provider and how its contribution decays over time. A similar reputation-based model using a node's first hand interaction experience is presented in [32]. The goal of the model is to increase/maintain QoS values in selfish overlay networks.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Trust Assessment for Web Services under Uncertainty

Malik

Medjahed

2010

Service-Oriented Computing

View full text Add to dashboard Cite

Abstract. We introduce a model for assessing the trust of providers in a service-oriented environment. Our model is cooperative in nature, such that Web services share their experiences of the service providers with their peers through ratings. The different ratings are aggregated using the "statistical cloud model" defined for uncertain situations. The model can uniformly describe the concepts of randomness, fuzziness, and their relationship in quantitative terms. By incorporating the credibility values of service raters in the model, we can assess a service provider's trust. Experiment results show that our proposed model performs in a fairly accurate manner.

show abstract

Trust Management for Service-Oriented Environments

Malik

Bouguettaya

2009

View full text Add to dashboard Cite

Increasing QoS in selfish overlay networks

Cited by 19 publications

References 3 publications

Selfish Overlay Network Creation and Maintenance

Selfish Overlay Network Creation and Maintenance

Trust Assessment for Web Services under Uncertainty

Trust Management for Service-Oriented Environments

Contact Info

Product

Resources

About