• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 71
Next 10 →

User interactions in social networks and their implications

by Christo Wilson, Bryce Boe, Alessandra Sala, Krishna P. N. Puttaswamy, Ben Y. Zhao - IN ACM EUROSYS , 2009
"... Social networks are popular platforms for interaction, communication and collaboration between friends. Researchers have recently proposed an emerging class of applications that leverage relationships from social networks to improve security and performance in applications such as email, web browsin ..."
Abstract - Cited by 224 (26 self) - Add to MetaCart
browsing and overlay routing. While these applications often cite social network connectivity statistics to support their designs, researchers in psychology and sociology have repeatedly cast doubt on the practice of inferring meaningful relationships from social network connections alone. This leads

Implications of selfish neighbor selection in overlay networks

by Nikolaos Laoutaris, Georgios Smaragdakis, Azer Bestavros, John W. Byers - in Proc. of IEEE INFOCOM ’07 , 2007
"... Abstract — In a typical overlay network for routing or content sharing, each node must select a fixed number of immediate overlay neighbors for routing traffic or content queries. A selfish node entering such a network would select neighbors so as to minimize the weighted sum of expected access cost ..."
Abstract - Cited by 17 (6 self) - Add to MetaCart
Abstract — In a typical overlay network for routing or content sharing, each node must select a fixed number of immediate overlay neighbors for routing traffic or content queries. A selfish node entering such a network would select neighbors so as to minimize the weighted sum of expected access

Interaction of overlay networks: properties and implications

by Wenjie Jiang, John C. S. Lui - SIGMETRICS Performance Evaluation Reveview , 2005
"... Although the concept of application layer overlay routing has received much attention lately, there has been little focus on the “coexistence” and “interaction ” of overlays on top of the same physical network. In this paper, we show that when each overlay plays the optimal routing strategy so as to ..."
Abstract - Cited by 4 (2 self) - Add to MetaCart
Although the concept of application layer overlay routing has received much attention lately, there has been little focus on the “coexistence” and “interaction ” of overlays on top of the same physical network. In this paper, we show that when each overlay plays the optimal routing strategy so

An empirical evaluation of wide-area internet bottlenecks

by Aditya Akella, Srinivasan Seshan , 2003
"... Conventional wisdom has been that the performance limitations in the current Internet lie at the edges of the network – i.e last mile connectivity to users, or access links of stub ASes. As these links are upgraded, however, it is important to consider where new bottlenecks and hot-spots are likely ..."
Abstract - Cited by 141 (7 self) - Add to MetaCart
the implications of our findings on related issues such as choosing an access provider and optimizing routes through the network. We believe that these results could be valuable in guiding the design of future network services, such as overlay routing, in terms of which links or paths to avoid (and how to avoid

Consistent key mapping in structured overlays

by Andreas Haeberlen, Jeff Hoye, Alan Mislove, Peter Druschel , 2005
"... Most structured peer-to-peer overlays rely on consistent hashing to determine the node that is responsible for a given key. For consistent hashing to work properly, it requires that the nodes have a consistent view of their neighborhood in the identifier space. However, if routing anomalies occur in ..."
Abstract - Cited by 10 (0 self) - Add to MetaCart
in the underlying network, this view can become inconsistent, causing unstable overlay behavior and, worse, allowing more than one node to assume re-sponsibility for ranges of keys. We present a set of techniques for preventing in-consistencies under routing anomalies, and we propose to adopt strategies from mobile

Race conditions in coexisting overlay networks

by Ram Keralapura, Chen-nee Chuah, Nina Taft, Gianluca Iannaccone - IEEE/ACM Trans. Networking , 2008
"... Abstract — By allowing end hosts to make independent routing decisions at the application level, different overlay networks may unintentionally interfere with each other. This paper describes how multiple similar or dissimilar overlay networks could experience race conditions, resulting in oscillati ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
the implications of our study on the design of path probing process in overlay networks and examine strategies to reduce the impact of race conditions.

Network-aware superpeers-peers geometric overlay network

by Eng Keong Lua, Xiaoming Zhou - In ICCCN (2007
"... Abstract — Peer-to-Peer (P2P) overlay networks can be utilized to deploy massive Internet overlay services such as multicast, content distribution, file sharing, etc. efficiently without any underlying network support. The crucial step to meet this objective is to design network-aware overlay networ ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
network topologies connecting all nodes that offer promising properties in terms of excellent communication quality. We exploit the underlying network locality and proximity of the nodes for overlay routing and node placement strategy. In this paper, we describe in greater specific details our network

Overlay networks for wireless ad hoc networks

by Christian Scheideler - In Proc. of the IMA Workshop on Wireless Communication , 2005
"... Abstract. Radio networks are widely used today. People access voice and data services via mobile phones, Bluetooth technology replaces unhandy cables by wireless links, and wireless networking is possible via IEEE 802.11 compatible network equipment. Nodes in such networks exchange their data packet ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
routing algorithms. Designing routing algorithms for wireless ad hoc networks is an extremely challenging task and still research in progress. In this paper, we mostly focus on the simpler question of how to maintain an overlay network of wireless links between the hosts so that, as a minimum requirement

PROD: Relayed File Retrieving in Overlay Networks

by Zhiyong Xu, Dan Stefanescu, Honggang Zhang, Jizhong Han, Laxmi Bhuyan , 2008
"... To share and exchange the files among Internet users, Peer-to-Peer (P2P) applications build another layer of overlay networks on top of the Internet Infrastructure. In P2P file sharing systems, a file request takes two steps. First, a routing message is generated by the client (request initiator) an ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
To share and exchange the files among Internet users, Peer-to-Peer (P2P) applications build another layer of overlay networks on top of the Internet Infrastructure. In P2P file sharing systems, a file request takes two steps. First, a routing message is generated by the client (request initiator

Copyright © 200X Inderscience Enterprises Ltd. Impact of vehicle movement models on VDTN routing strategies for rural connectivity

by Vasco N. G. J. Soares, Farid Farahmand, Joel José, P. C. Rodrigues
"... Abstract: Vehicular delay-tolerant networks (VDTNs) appear as an alternative to provide low cost asynchronous internet access on developing countries or isolated regions, enabling non-real time services, such as e-mail, web access, telemedicine, environmental monitoring and other data collection app ..."
Abstract - Add to MetaCart
about implications of movement models on the performance of VDTNs applied to rural scenarios, leading to insights for future routing algorithm theoretic study and protocol design.
Next 10 →
Results 1 - 10 of 71
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University