Filters








1,711 Hits in 7.3 sec

Towards a universal approach for the finite departure problem in overlay networks

Andreas Koutsopoulos, Christian Scheideler, Thim Strothmann
2017 Information and Computation  
We study this problem in two variants: the Finite Departure Problem (FDP) and the Finite Sleep Problem (FSP).  ...  There are a number of studies for safe node exclusion if the overlay is in a well-defined state, but almost no formal results are known for the case in which the overlay network is in an arbitrary initial  ...  [15] proposed to study this problem in two variants: the Finite Departure Problem (FDP) and the Finite Sleep Problem (FSP).  ... 
doi:10.1016/j.ic.2016.12.006 fatcat:d445thobenggzgdd3vjfsljrma

Towards a Universal Approach for the Finite Departure Problem in Overlay Networks [chapter]

Andreas Koutsopoulos, Christian Scheideler, Thim Strothmann
2015 Lecture Notes in Computer Science  
We study this problem in two variants: the Finite Departure Problem (FDP) and the Finite Sleep Problem (FSP).  ...  There are a number of studies for safe node exclusion if the overlay is in a well-defined state, but almost no formal results are known for the case in which the overlay network is in an arbitrary initial  ...  [15] proposed to study this problem in two variants: the Finite Departure Problem (FDP) and the Finite Sleep Problem (FSP).  ... 
doi:10.1007/978-3-319-21741-3_14 fatcat:j37kcfcdzjg4bc7mm7kafsob54

A Distributed Algorithm for Throughput Optimal Routing in Overlay Networks [article]

Anurag Rai, Rahul Singh, Eytan Modiano
2016 arXiv   pre-print
We address the problem of optimal routing in overlay networks. An overlay network is constructed by adding new overlay nodes on top of a legacy network.  ...  We develop a throughput optimal dynamic routing algorithm for such overlay networks called the Optimal Overlay Routing Policy (OORP).  ...  Thus, an implementation of a throughput optimal scheme usually requires a complete overhaul of the network. An overlay architecture for a gradual move towards optimal routing was proposed in [6] .  ... 
arXiv:1612.05537v1 fatcat:b6mv4yhhv5edpchuhbre5ewyty

Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures

Christian Scheideler, Alexander Setzer, Thim Strothmann, Marc Herbstritt
2016 International Conference on Principles of Distributed Systems  
Additionally, we extend our protocol to deal with node departures in terms of the Finite Departure Problem of Foreback et al. (SSS 2014).  ...  For these overlay networks to preserve their functionality, they should be able to recover from various problems like membership changes or faults.  ...  Our study of the Finite Departure Problem is heavily inspired by [7] , in which the authors propose the aforementioned problem to study graceful departures of nodes in a self-stabilizing setting, i.e.  ... 
doi:10.4230/lipics.opodis.2015.24 dblp:conf/opodis/ScheidelerSS15 fatcat:b5enpl2t3najfamwbcjslzsuni

GeoP2P: An adaptive peer-to-peer overlay for efficient search and update of spatial information [article]

Shah Asaduzzaman, Gregor v. Bochmann
2009 arXiv   pre-print
Peer-to-peer systems for geographic or multidimensional range queries built on existing DHTs suffer from the inaccuracy in linearization of the multidimensional space.  ...  This paper proposes a fully decentralized peer-to-peer overlay structure GeoP2P, to facilitate geographic location based search and retrieval of information.  ...  Peer Departure and Network Retraction Besides growing due to newly joining peers, the overlay may also shrink in size due to departure of peers.  ... 
arXiv:0903.3759v1 fatcat:5meyl7z4l5a3hcl4nviwxckpdq

Dynamic Bandwidth Auctions in Multioverlay P2P Streaming with Network Coding

Chuan Wu, Baochun Li, Zongpeng Li
2008 IEEE Transactions on Parallel and Distributed Systems  
In the case of multiple overlays, it is a challenging task to design an appropriate bandwidth allocation protocol, such that these overlays efficiently share the available upload bandwidth on peers, media  ...  Since such strategies of conflict are game theoretic in nature, we characterize them as a decentralized collection of dynamic auction games, in which downstream peers bid for upload bandwidth at the upstream  ...  Introducing Lagrangian multiplier λ for the constraint in (4) and ν = (ν i , ∀i : (i, j) ∈ A s ) for the constraints in (5) , we obtain the KKT conditions for the problem Bidding j s as follows (pp. 244  ... 
doi:10.1109/tpds.2008.30 fatcat:pz3d257trrfehhf7mrcmuvzzdm

A novel robust on-line protocol for load-balancing in structured peer-to-peer systems

George Tsatsanifos, Vasilis Samoladas
2012 Computing  
Load-balancing is of major significance for large-scale decentralized networks in terms of enhanced scalability and performance.  ...  In this paper, we revisit the problem of load-balancing structured peer-to-peer systems with on-line protocols.  ...  In particular, taking advantage of the structure of our scheme, we maintain for each overlay node a cached replica, which can otherwise described as hidden from the overlay network, in a sense that a cached  ... 
doi:10.1007/s00607-012-0199-7 fatcat:chqv5ma4wne2tk3ixary4rlo4i

A state management and persistency architecture for peer-to-peer massively multi-user virtual environments

John Gilmore
2013 ACM SIGMultimedia Records  
Acknowledgements I would like to express my sincere gratitude to the following people and organisations:  ...  The Markov model assumes the presence of a finite sized network, with some maximum number of nodes N . The departure rate of nodes from the network is dependant on the number of nodes in the network.  ...  MODELLING OBJECT LIFETIMES IN FINITE NETWORKS UNDER CHURN Equation (7.2.1) allows for the transitional rates matrix for replica departure to be calculated as 172 first column a state transition occurs  ... 
doi:10.1145/2484912.2484917 fatcat:zugdcqbgn5dsdfftiayngsouwm

Optimal Routing for Delay-Sensitive Traffic in Overlay Networks [article]

Rahul Singh, Eytan Modiano
2019 arXiv   pre-print
We design dynamic routing policies for an overlay network which meet delay requirements of real-time traffic being served on top of an underlying legacy network, where the overlay nodes do not know the  ...  in a distributed fashion, is optimal.  ...  in order for them to be counted towards "timelythroughput" [39] .  ... 
arXiv:1703.07419v2 fatcat:fkummv7cybc5nbirmvl7e3kpam

Multi swarms for neighbor selection in peer-to-peer overlay networks

Ajith Abraham, Hongbo Liu, Aboul Ella Hassanien
2010 Telecommunications Systems  
In this paper, we investigate a multi-swarm approach to the problem of neighbor selection (NS) in P2P networks.  ...  The results indicate that it usually required shorter time to obtain better results than the other considered methods, specially for large scale problems.  ...  Acknowledgements The authors would like to thank Prof. Xiukun Wang, Drs. Ran He, Shichang Sun and Mingyan Zhao for their scientific collaboration in this research work.  ... 
doi:10.1007/s11235-010-9285-3 fatcat:e6nrp7fsmzfrpfasatj3vc3ac4

A lightweight, robust P2P system to handle flash crowds

Angelos Stavrou, Dan Rubenstein, Sambit Sahu
2002 Computer communication review  
We evaluate PROOFS' robustness in environments in which clients join and leave the P2P network as well as in environments in which clients are not always fully cooperative.  ...  Through a mix of simulation and prototype experimentation in the Internet, we show that randomized approaches like PROOFS should effectively relieve flash crowd symptoms in dynamic, limited-participation  ...  ACKNOWLEDGMENTS The authors would like to thank the anonymous reviewers for JSAC and ICNP whose comments helped improve the quality of this work.  ... 
doi:10.1145/571697.571706 fatcat:oyw6cuuk55ffbaguxp4s75rqey

A Lightweight, Robust P2P System to Handle Flash Crowds

A. Stavrou, D. Rubenstein, S. Sahu
2004 IEEE Journal on Selected Areas in Communications  
We evaluate PROOFS' robustness in environments in which clients join and leave the P2P network as well as in environments in which clients are not always fully cooperative.  ...  Through a mix of simulation and prototype experimentation in the Internet, we show that randomized approaches like PROOFS should effectively relieve flash crowd symptoms in dynamic, limited-participation  ...  ACKNOWLEDGMENTS The authors would like to thank the anonymous reviewers for JSAC and ICNP whose comments helped improve the quality of this work.  ... 
doi:10.1109/jsac.2003.818778 fatcat:5dz4j5zqk5genoovb4vftedvqy

Formal Methods and Fault-Tolerant Distributed Comp.: Forging an Alliance (Dagstuhl Seminar 18211)

Javier Esparza, Pierre Fraignaud, Anca Muscholl, Sergio Rajsbaum, Michael Wagner
2018 Dagstuhl Reports  
Its goal was to strengthen the interaction between researchers from formal methods and from distributed computing, and help the two communities to better identify common research challenges.  ...  The Dagstuhl Seminar "Formal Methods and Fault-Tolerant Distributed Computing: Forging an Alliance" took place May 22-25, 2018.  ...  Pretend Synchrony is the title of a recent talk at VDS in Essaouira, Morocco 2018 by Ranjit Jhala where a restricted computational model is shown to be sufficient to verify correctness assertions for several  ... 
doi:10.4230/dagrep.8.5.60 dblp:journals/dagstuhl-reports/EsparzaFMR18 fatcat:72a6n5b32bd7rh7bgl4fb64fmy

Adaptive Distributed b-Matching in Overlays with Preferences [chapter]

Giorgos Georgiadis, Marina Papatriantafilou
2012 Lecture Notes in Computer Science  
In this paper we present an adaptive, distributed algorithm for the many-to-many matching problem with preferences that works over any network, provides a guaranteed approximation for the total satisfaction  ...  in the network and guarantees convergence.  ...  In addition to the above, none of the currently available distributed algorithms for the b-matching problem can handle the dynamic aspect of overlay networks (e.g. node arrivals/departures and preference  ... 
doi:10.1007/978-3-642-30850-5_19 fatcat:nujzj3xpdvd3hksldl7r25sm2u

Strategic Planning of Aircraft Movements with a Three-Cost Objective

Daniel S. Zachary, Jessica Gervais, Ulrich Leopold, Georges Schutz, Viola S. T. Huck, Christian Braun
2011 Journal of Aircraft  
These hypotheses imply that the NLIP problem of Eq. (10) is converted to a set of five separate integer programming problems. The results are given in Tables 3 and 4. For a resolution of 100 x 100 m?  ...  The first part of the balanced approach works toward environ- mental improvement.  ... 
doi:10.2514/1.c031090 fatcat:mzvkylbhnvbazofd2fbdbjzxde
« Previous Showing results 1 — 15 out of 1,711 results