The Experts below are selected from a list of 7647 Experts worldwide ranked by ideXlab platform

Weaver Alex - One of the best experts on this subject based on the ideXlab platform.

  • Asynchronous Gossip in Smartphone Peer-to-Peer Networks
    2021
    Co-Authors: Newport Calvin, Weaver Alex, Zheng Chaodong
    Abstract:

    In this paper, we study gossip algorithms in communication models that describe the peer-to-peer Networking Functionality included in most standard smartphone operating systems. We begin by describing and analyzing a new synchronous gossip algorithm in this setting that features both a faster round complexity and simpler operation than the best-known existing solutions. We also prove a new lower bound on the rounds required to solve gossip that resolves a minor open question by establishing that existing synchronous solutions are within logarithmic factors of optimal. We then adapt our synchronous algorithm to produce a novel gossip strategy for an asynchronous model that directly captures the interface of a standard smartphone peer-to-peer Networking library (enabling algorithms described in this model to be easily implemented on real phones). Using new analysis techniques, we prove that this asynchronous strategy efficiently solves gossip. This is the first known efficient asynchronous information dissemination result for the smartphone peer-to-peer setting. We argue that our new strategy can be used to implement effective information spreading subroutines in real world smartphone peer-to-peer network applications, and that the analytical tools we developed to analyze it can be leveraged to produce other broadly useful algorithmic strategies for this increasingly important setting

  • Random Gossip Processes in Smartphone Peer-to-Peer Networks
    2019
    Co-Authors: Newport Calvin, Weaver Alex
    Abstract:

    In this paper, we study random gossip processes in communication models that describe the peer-to-peer Networking Functionality included in standard smartphone operating systems. Random gossip processes spread information through the basic mechanism of randomly selecting neighbors for connections. These processes are well-understood in standard peer-to-peer network models, but little is known about their behavior in models that abstract the smartphone peer-to-peer setting. With this in mind, we begin by studying a simple random gossip process in the synchronous mobile telephone model (the most common abstraction used to study smartphone peer-to-peer systems). By introducing a new analysis technique, we prove that this simple process is actually more efficient than the best-known gossip algorithm in the mobile telephone model, which required complicated coordination among the nodes in the network. We then introduce a novel variation of the mobile telephone model that removes the synchronized round assumption, shrinking the gap between theory and practice. We prove that simple random gossip processes still converge in this setting and that information spreading still improves along with graph connectivity. This new model and the tools we introduce provide a solid foundation for the further theoretical analysis of algorithms meant to be deployed on real smartphone peer-to-peer networks. More generally, our results in this paper imply that simple random information spreading processes should be expected to perform well in this emerging new peer-to-peer setting

Newport Calvin - One of the best experts on this subject based on the ideXlab platform.

  • Asynchronous Gossip in Smartphone Peer-to-Peer Networks
    2021
    Co-Authors: Newport Calvin, Weaver Alex, Zheng Chaodong
    Abstract:

    In this paper, we study gossip algorithms in communication models that describe the peer-to-peer Networking Functionality included in most standard smartphone operating systems. We begin by describing and analyzing a new synchronous gossip algorithm in this setting that features both a faster round complexity and simpler operation than the best-known existing solutions. We also prove a new lower bound on the rounds required to solve gossip that resolves a minor open question by establishing that existing synchronous solutions are within logarithmic factors of optimal. We then adapt our synchronous algorithm to produce a novel gossip strategy for an asynchronous model that directly captures the interface of a standard smartphone peer-to-peer Networking library (enabling algorithms described in this model to be easily implemented on real phones). Using new analysis techniques, we prove that this asynchronous strategy efficiently solves gossip. This is the first known efficient asynchronous information dissemination result for the smartphone peer-to-peer setting. We argue that our new strategy can be used to implement effective information spreading subroutines in real world smartphone peer-to-peer network applications, and that the analytical tools we developed to analyze it can be leveraged to produce other broadly useful algorithmic strategies for this increasingly important setting

  • Random Gossip Processes in Smartphone Peer-to-Peer Networks
    2019
    Co-Authors: Newport Calvin, Weaver Alex
    Abstract:

    In this paper, we study random gossip processes in communication models that describe the peer-to-peer Networking Functionality included in standard smartphone operating systems. Random gossip processes spread information through the basic mechanism of randomly selecting neighbors for connections. These processes are well-understood in standard peer-to-peer network models, but little is known about their behavior in models that abstract the smartphone peer-to-peer setting. With this in mind, we begin by studying a simple random gossip process in the synchronous mobile telephone model (the most common abstraction used to study smartphone peer-to-peer systems). By introducing a new analysis technique, we prove that this simple process is actually more efficient than the best-known gossip algorithm in the mobile telephone model, which required complicated coordination among the nodes in the network. We then introduce a novel variation of the mobile telephone model that removes the synchronized round assumption, shrinking the gap between theory and practice. We prove that simple random gossip processes still converge in this setting and that information spreading still improves along with graph connectivity. This new model and the tools we introduce provide a solid foundation for the further theoretical analysis of algorithms meant to be deployed on real smartphone peer-to-peer networks. More generally, our results in this paper imply that simple random information spreading processes should be expected to perform well in this emerging new peer-to-peer setting

Zheng Chaodong - One of the best experts on this subject based on the ideXlab platform.

  • Asynchronous Gossip in Smartphone Peer-to-Peer Networks
    2021
    Co-Authors: Newport Calvin, Weaver Alex, Zheng Chaodong
    Abstract:

    In this paper, we study gossip algorithms in communication models that describe the peer-to-peer Networking Functionality included in most standard smartphone operating systems. We begin by describing and analyzing a new synchronous gossip algorithm in this setting that features both a faster round complexity and simpler operation than the best-known existing solutions. We also prove a new lower bound on the rounds required to solve gossip that resolves a minor open question by establishing that existing synchronous solutions are within logarithmic factors of optimal. We then adapt our synchronous algorithm to produce a novel gossip strategy for an asynchronous model that directly captures the interface of a standard smartphone peer-to-peer Networking library (enabling algorithms described in this model to be easily implemented on real phones). Using new analysis techniques, we prove that this asynchronous strategy efficiently solves gossip. This is the first known efficient asynchronous information dissemination result for the smartphone peer-to-peer setting. We argue that our new strategy can be used to implement effective information spreading subroutines in real world smartphone peer-to-peer network applications, and that the analytical tools we developed to analyze it can be leveraged to produce other broadly useful algorithmic strategies for this increasingly important setting

Marios D Dikaiakos - One of the best experts on this subject based on the ideXlab platform.

  • g social enhancing integrated e science tools with social Networking Functionality
    International Conference on e-Science, 2012
    Co-Authors: Andriani Stylianou, Nicholas Loulloudes, Marios D Dikaiakos
    Abstract:

    During the last decade, the scientific community has witnessed an unprecedented deployment of large-scale, federated e-Infrastructures such as Grid Computing, primarily for supporting data-intensive scientific exploration and coordinated problem solving. However, practical experience and user studies have indicated that the adoption of such e-Infrastructures is lagging behind original expectations, a fact which is mainly attributed to the limited support that available tools provide for user collaboration and information sharing. The goal of this paper is twofold, first to lay down the foundations for building a collaboration environment in the form of abstractions and second to show the effectiveness of these abstractions through g-Social, an Eclipse-based, open-source environment as an extension to g-Eclipse, that provides a powerful, user-friendly, platform-independent toolset for users, application developers and administrators of Grid infrastructures. g-Social enables user collaboration and resource sharing through Online Social Networking services, capitalizing on the success that these services have.

Piet Demeester - One of the best experts on this subject based on the ideXlab platform.

  • Applying intelligent optical Networking Functionality in the deployment of the next-generation internet.
    2002
    Co-Authors: Qiang Yan, Didier Colle, Bart Puype, Sophie De Maesschalck, Ilse Lievens, Mario Pickavet, Piet Demeester
    Abstract:

    Intelligent Optical Networks (IONs) are capable of automatically setting-up and tearing-down lightpaths. This offers the opportunity to dynamically reconfigure the logical IP network (i.e., the capacity and topology in the IP layer). IONs also enable the use of Multi-layer Traffic Engineering (MTE) to improve the Quality of Service (QoS) in IP-over-Optical networks. This paper discusses what is understood by MTE, how it works and what issues need to be resolved when developing a MTE strategy. The benefits of MTE are highlighted by means of two case studies. 1