Volume

Dagstuhl Seminar Proceedings, Volume 6131

Publication Details

  • published at: 2006-12-15
  • Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik

Access Numbers

Documents

No documents found matching your filter selection.
Document
DOI: 10.4230/DagSemProc.06131.1
06131 Abstracts Collection – Peer-to -Peer -Systems and -Applications

Authors: Anthony D. Joseph, Ralf Steinmetz, Ion Stoica, and Klaus Wehrle

Abstract
From 26.03.06 to 29.03.06, the Dagstuhl Seminar 06131 ``Peer-to-Peer-Systems and -Applications'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

Anthony D. Joseph, Ralf Steinmetz, Ion Stoica, and Klaus Wehrle. 06131 Abstracts Collection – Peer-to -Peer -Systems and -Applications. In Peer-to-Peer-Systems and -Applications. Dagstuhl Seminar Proceedings, Volume 6131, pp. 1-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{joseph_et_al:DagSemProc.06131.1,
  author =	{Joseph, Anthony D. and Steinmetz, Ralf and Stoica, Ion and Wehrle, Klaus},
  title =	{{06131 Abstracts Collection – Peer-to -Peer -Systems and -Applications}},
  booktitle =	{Peer-to-Peer-Systems and -Applications},
  pages =	{1--10},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{6131},
  editor =	{Anthony D. Joseph and Ralf Steinmetz and Klaus Wehrle},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06131.1},
  URN =		{urn:nbn:de:0030-drops-8455},
  doi =		{10.4230/DagSemProc.06131.1},
  annote =	{Keywords: Peer-to-Peer, self-organisation, massively distributed systems}
}
Document
DOI: 10.4230/DagSemProc.06131.2
06131 Executive Summary – Peer-to-Peer-Systems and -Applications

Authors: Anthony D. Joseph, Ralf Steinmetz, Ion Stoica, and Klaus Wehrle

Abstract
This is the executive summary of Dagstuhl Seminar 06131, "Peer-to-Peer-Systems and -Applications". The seminar was held from March 26th to March 29th, 2006, at the International Conference and Research Center for Computer Science at Castle Dagstuhl, Germany.
Cite as

Anthony D. Joseph, Ralf Steinmetz, Ion Stoica, and Klaus Wehrle. 06131 Executive Summary – Peer-to-Peer-Systems and -Applications. In Peer-to-Peer-Systems and -Applications. Dagstuhl Seminar Proceedings, Volume 6131, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{joseph_et_al:DagSemProc.06131.2,
  author =	{Joseph, Anthony D. and Steinmetz, Ralf and Stoica, Ion and Wehrle, Klaus},
  title =	{{06131 Executive Summary – Peer-to-Peer-Systems and -Applications}},
  booktitle =	{Peer-to-Peer-Systems and -Applications},
  pages =	{1--4},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{6131},
  editor =	{Anthony D. Joseph and Ralf Steinmetz and Klaus Wehrle},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06131.2},
  URN =		{urn:nbn:de:0030-drops-8522},
  doi =		{10.4230/DagSemProc.06131.2},
  annote =	{Keywords: Peer-to-Peer, self-organisation, massively distributed systems}
}
Document
DOI: 10.4230/DagSemProc.06131.3
Fairness in Peer-to-Peer Networks

Authors: Kolja Eger and Ulrich Killat

Abstract
The first Peer-to-Peer (P2P) networks were based mainly on the altruistic behaviour of its peers. Although newer implementations incorporate some kind of incentive mechanism to award sharing peers, no P2P network assures some quality of service. Our work is meant as a first step towards the development of P2P networks with quality of service. We propose a distributed resource allocation algorithm where peers control the service rate to its neighbours. This algorithm is based on the congestion pricing principle known from IP networks and ensures some form of fairness. Hence a peer gets a fair share of the resources available in the P2P network weighted by its contribution to the network. We present the first simulation results about the convergence of our algorithm and its functionality in large and varying networks.
Cite as

Kolja Eger and Ulrich Killat. Fairness in Peer-to-Peer Networks. In Peer-to-Peer-Systems and -Applications. Dagstuhl Seminar Proceedings, Volume 6131, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{eger_et_al:DagSemProc.06131.3,
  author =	{Eger, Kolja and Killat, Ulrich},
  title =	{{Fairness in Peer-to-Peer Networks}},
  booktitle =	{Peer-to-Peer-Systems and -Applications},
  pages =	{1--6},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{6131},
  editor =	{Anthony D. Joseph and Ralf Steinmetz and Klaus Wehrle},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06131.3},
  URN =		{urn:nbn:de:0030-drops-6452},
  doi =		{10.4230/DagSemProc.06131.3},
  annote =	{Keywords: Pricing, Rate Control, Resource Allocation, Distributed Optimisation, Fairness, P2P Networks}
}
Document
DOI: 10.4230/DagSemProc.06131.4
On the Topologies Formed by Selfish Peers

Authors: Stefan Schmid, Thomas Moscibroda, and Roger Wattenhofer

Abstract
Many P2P systems are only proven efficient for static environments. However, in practice, P2P systems are often very dynamic in the sense that peers can join and leave a system at any time and concurrently. In the first part of my talk, I will present a DHT we have developed recently in our group which maintains desirable properties under worst-case churn. In the second part of my talk, we will briefly look at another challenge of prime importance in P2P computing, namely selfishness. Concretely, some results are presented concerning the impact of selfish behavior on the performance of P2P topologies.
Cite as

Stefan Schmid, Thomas Moscibroda, and Roger Wattenhofer. On the Topologies Formed by Selfish Peers. In Peer-to-Peer-Systems and -Applications. Dagstuhl Seminar Proceedings, Volume 6131, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{schmid_et_al:DagSemProc.06131.4,
  author =	{Schmid, Stefan and Moscibroda, Thomas and Wattenhofer, Roger},
  title =	{{On the Topologies Formed by Selfish Peers}},
  booktitle =	{Peer-to-Peer-Systems and -Applications},
  pages =	{1--5},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{6131},
  editor =	{Anthony D. Joseph and Ralf Steinmetz and Klaus Wehrle},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06131.4},
  URN =		{urn:nbn:de:0030-drops-6431},
  doi =		{10.4230/DagSemProc.06131.4},
  annote =	{Keywords: Churn, Selfishness, P2P Topologies}
}
Document
DOI: 10.4230/DagSemProc.06131.5
Taming Dynamic and Selfish Peers

Authors: Stefan Schmid, Fabian Kuhn, Thomas Moscibroda, and Roger Wattenhofer

Abstract
Peer-to-peer systems are often faced with the problem of frequent membership changes. However, many systems are only proven efficient or correct in static environments. In my talk, I will present techniques to maintain desirable properties of a distributed hash table (low peer degree, low network diameter) in spite of ongoing and concurrent dynamics. I will then go on and study the effect of peers not acting according to our protocols. Concretely, I assume that peers are selfish and choose the behavior which maximizes their utility. I will report on our results concerning the impact of selfishness on the peer-to-peer topology.
Cite as

Stefan Schmid, Fabian Kuhn, Thomas Moscibroda, and Roger Wattenhofer. Taming Dynamic and Selfish Peers. In Peer-to-Peer-Systems and -Applications. Dagstuhl Seminar Proceedings, Volume 6131, pp. 1-14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{schmid_et_al:DagSemProc.06131.5,
  author =	{Schmid, Stefan and Kuhn, Fabian and Moscibroda, Thomas and Wattenhofer, Roger},
  title =	{{Taming Dynamic and Selfish Peers}},
  booktitle =	{Peer-to-Peer-Systems and -Applications},
  pages =	{1--14},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{6131},
  editor =	{Anthony D. Joseph and Ralf Steinmetz and Klaus Wehrle},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06131.5},
  URN =		{urn:nbn:de:0030-drops-6477},
  doi =		{10.4230/DagSemProc.06131.5},
  annote =	{Keywords: Churn, Selfishness, P2P Topologies}
}

Filters

  • Authors
  • E
  • Eger, Kolja
  • J
  • Joseph, Anthony D.
  • K
  • Killat, Ulrich
  • Kuhn, Fabian
  • M
  • Moscibroda, Thomas
  • S
  • Schmid, Stefan
  • Steinmetz, Ralf
  • Stoica, Ion
  • W
  • Wattenhofer, Roger
  • Wehrle, Klaus

Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact