Filters








5,099 Hits in 7.7 sec

Generic Emergent Overlays in Arbitrary Peer Identifier Spaces [chapter]

Wojciech Galuba, Karl Aberer
Lecture Notes in Computer Science  
to define its own peer identifier space.  ...  This together with the ability to adjust both the identifier space and the tradeoff between the path length and the node degree makes the overlay customizable in ways that are not possible in the existing  ...  Algorithm 1 : 1 Overlay routing and maintenance algorithm for arbitrary peer identifier spaces function forwardMessage(Message(payload,src,dest,visited)) next hop = argmin x∈neigh\visited d(id(x), id(dest  ... 
doi:10.1007/978-3-540-74917-2_9 fatcat:63lcag6c5nbixjreg2sjrhnita

Peer the peers

Matthias Wählisch, Thomas C. Schmidt
2009 Proceedings of the 5th international student workshop on Emerging networking experiments and technologies - Co-Next Student Workshop '09  
We present an architecture which serves unstructured and structured overlay peers with a generic overlay ID that jointly reflects AS-paths and peering topologies, and is unbiased by unilateral ISP interests  ...  However, ISPs offering transits rejoice in additional traffic and may provide localization data to delocalize peers.  ...  Overlay ID creation The AS topology will be mapped on an overlay identifier space. An overlay ID is composed of the following parts: <IXP ID>:<AS path>:<subnet>: <endhost ID>.  ... 
doi:10.1145/1658997.1659022 dblp:conf/conext/WahlischS09a fatcat:otn2izammrcmtkwbuuxtoe7wvy

A Framework for Structured Peer-to-Peer Overlay Networks [chapter]

Luc Onana Alima, Ali Ghodsi, Seif Haridi
2005 Lecture Notes in Computer Science  
Structured peer-to-peer overlay networks have recently emerged as good candidate infrastructure for building novel large-scale and robust Internet applications in which participating peers share computing  ...  Moreover, the administrative costs are significantly reduced, as peer-to-peer systems are in general built on autonomous systems, without a centralized administration.  ...  As previously mentioned, a generic function m P is used for the management of the identifier space.  ... 
doi:10.1007/978-3-540-31794-4_12 fatcat:qe4qimzxbrc47olf5ht42csixe

Overlay Structure for Large Scale Content Sharing: Leveraging Geography as the Basis for Routing Locality [article]

Shah Asaduzzaman, Gregor v. Bochmann
2009 arXiv   pre-print
In this paper we place our arguments on two related issues in the design of generalized structured peer-to-peer overlays.  ...  We then outline the design principles and present a design for the generalized routing overlay based on adaptive hierarchical partitioning of the geographical space.  ...  Ever since the emergence of the peer-to-peer content sharing application, there have been growing complaints and consequent policing from the ISPs on the traffic generated by peer-to-peer applications.  ... 
arXiv:0903.4113v1 fatcat:pym5gof6kbfrbb5eosnz4ootnu

A locality preserving routing overlay using geographic coordinates

Shah Asaduzzaman, Gregor v. Bochmann
2009 2009 IEEE International Conference on Internet Multimedia Services Architecture and Applications (IMSAA)  
space.  ...  This paper presents a design for a general locality preserving routing overlay network based on geographic coordinates of nodes.  ...  The numeric identifier space used in the hierarchical DHTs can be thought being hierarchically divided into zones and sub-zones, each zone containing all the peers with identifiers of a certain prefix  ... 
doi:10.1109/imsaa.2009.5439468 fatcat:wv3exhl335fu3hpltpk4ddq5na

VegaNet: A peer-to-peer overlay network for mobile social applications

Joonhyun Bae, Seunghun Lee, Sangwook Kim
2009 2009 IEEE 13th International Symposium on Consumer Electronics  
In this paper, we propose VegaNet, a peer-to-peer overlay network enhancing the performance and reliability of DHT routing using social links.  ...  The nodes in VegaNet are identified by the users' social identity, and it is structured by underlying DHT overlay exploiting social identities and social relationships.  ...  Lookup The basic operation of structured peer-to-peer overlay networks is to find a node which is closest to a given arbitrary key k.  ... 
doi:10.1109/isce.2009.5156842 fatcat:cnhnhdegmng3los3o6ekb7prwe

Susceptibility Analysis of Structured P2P Systems to Localized Eclipse Attacks

Daniel Germanus, Robert Langenberg, Abdelmajid Khelil, Neeraj Suri
2012 2012 IEEE 31st Symposium on Reliable Distributed Systems  
To obtain effective placement of malicious peers, LEAs significantly benefit from overlay topology-awareness.  ...  Peer-to-Peer (P2P) protocols are susceptible to Localized Eclipse Attacks (LEA), i.e., attacks where a victim peer's environment is masked by malicious peers which are then able to instigate progressively  ...  The previous consideration is discussed in detail in [19] . The authors show how to obtain an overlay ID in a desired ID space region even with a considerable small set of external identifiers.  ... 
doi:10.1109/srds.2012.70 dblp:conf/srds/GermanusLKS12 fatcat:dlarcak245flxijw2rrpakpe34

P2P-based Network and Service Operation for the Emerging Future Internet

K. Tutschku
2007 PIK - Praxis der Informationsverarbeitung und Kommunikation  
Part I: Trends and Challenges by the Emerging Future Internet II. TRENDS Today's Internet does not show a general overload situation which would ask for a new network architecture.  ...  Due to the increased application of abstraction layers, like the Internet Protocol (IP) or overlay techniques, services can be consumed now in a variety of wireless and wireline networks such as ADSL,  ...  Generally, in P2P system resources are placed in general on arbitrary peers. Resource mediation functions are used to locate the resources in the overlay.  ... 
doi:10.1515/piko.2007.68 fatcat:4sgxllu3k5h4tkdomjxuijh7da

A framework for constructing peer-to-peer overlay networks in Java

Rui Shen, Ji Wang, Shengdong Zhang, Siqi Shen, Pei Fan
2009 Proceedings of the 7th International Conference on Principles and Practice of Programming in Java - PPPJ '09  
In this paper, we present a framework for constructing peer-topeer overlay networks in Java.  ...  Peer-to-peer emerges as a better way for building applications on the Internet that require high scalability and availability.  ...  RELATED WORK As an emerging technology, many peer-to-peer overlay networks have been designed and implemented.  ... 
doi:10.1145/1596655.1596662 dblp:conf/pppj/ShenWZSF09 fatcat:cpecqe6tbvht5k4qe6ft4dv6wi

A common API for hybrid group communication

Matthias Wahlisch, Thomas C. Schmidt, Georg Wittenburg
2009 2009 IEEE 34th Conference on Local Computer Networks  
First, we explore the problem space of designing a protocol stack for hybrid group communication that covers structured P2P networks.  ...  Second, we propose a transparent API that encapsulates a middleware abstraction layer for implementing hybrid multicast, and allows for overlay-underlay agnostic programming.  ...  The idea is to provide overlay services in a generic multicast module.  ... 
doi:10.1109/lcn.2009.5355084 dblp:conf/lcn/WahlischSW09 fatcat:hzudb74asjbh3auhdvzjgeuwze

Self-Organizing Schema Mappings in the GridVine Peer Data Management System

Philippe Cudré-Mauroux, Suchit Agarwal, Adriana Budura, Parisa Haghani, Karl Aberer
2007 Very Large Data Bases Conference  
We illustrate these functionalities using bioinformatic schemas and data in a network running on several hundreds of peers simultaneously.  ...  GridVine is a Peer Data Management System based on a decentralized access structure.  ...  Once the address space is discovered, the peer forwards the query to the peer(s) responsible for that space using a Retrieve(key, q) operation.  ... 
dblp:conf/vldb/Cudre-MaurouxABHA07 fatcat:tjbaqy52b5cobnaudp4d3podjq

On Small World Graphs in Non-uniformly Distributed Key Spaces

S. Girdzijauskas, A. Datta, K. Aberer
2005 21st International Conference on Data Engineering Workshops (ICDEW'05)  
In this paper we show that the topologies of most logarithmic-style P2P systems like Pastry, Tapestry or P-Grid resemble small-world graphs.  ...  With such a model we are setting a reference base for nowadays emerging P2P systems that need to support uneven key distributions.  ...  Search efficiency in terms of the number of overlay hops can't be guaranteed in CAN for arbitrary partitioning of the key-space (zones).  ... 
doi:10.1109/icde.2005.254 dblp:conf/icde/GirdzijauskasDA05 fatcat:oojeomsevrhspdfvcxcm7gbjmu

Effects of Network Structure Improvement on Distributed RDF Querying [chapter]

Liaquat Ali, Thomas Janson, Georg Lausen, Christian Schindelhauer
2013 Lecture Notes in Computer Science  
In this paper, we analyze the performance of distributed RDF systems in a peer-to-peer (P2P) environment.  ...  This is achieved by grouping related data in branches of the tree, which tend to be accessed combined in a query, e.g. data of a university domain is in one branch.  ...  The routing in query processing in the Chord overlay almost needs the same time like arbitrary routing steps between arbitrary peers with nearly no effect.  ... 
doi:10.1007/978-3-642-40053-7_6 fatcat:dkpdxxdsovbblgj4nbbdd3nv4i

On the stability of chord-based P2P systems

A. Binzenhofer, D. Staehle, R. Henjes
2005 GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.  
The main goal is to be able to store and retrieve data in a decentralized manner. The challenge in doing so consists in creating a stable overlay network that allows for fast and efficient searches.  ...  The current generation of P2P networks is intended to provide cost-effective alternatives to the traditional client-server architecture.  ...  Since we are assuming an identifier space of size 2 m and an overlay network of size n with equally spaced peer IDs, the distance to the direct successor of the peer is 2 m n .  ... 
doi:10.1109/glocom.2005.1577765 dblp:conf/globecom/BinzenhoferSH05 fatcat:3zzcps5aajaxni2auehocqe3oe

Distributed Lookup in Structured Peer-to-Peer Ad-Hoc Networks [chapter]

Raphaël Kummer, Peter Kropf, Pascal Felber
2006 Lecture Notes in Computer Science  
Related Work Peer-to-peer overlays have emerged from file sharing applications on top of the Internet, leveraging from its routing infrastructure and the intrinsic peer-to-peer property of the IP protocol  ...  Most of them are unstructured and use some form of flooding to locate content, because the physical constraints of the underlying network make the construction of arbitrary application-layer overlays impractical  ...  The nodes are randomly distributed in the physical space and are randomly assigned their identifiers in the DHT space.  ... 
doi:10.1007/11914952_37 fatcat:xqim5qxq6rhhddkhwzh4lq3sy4
« Previous Showing results 1 — 15 out of 5,099 results