625 research outputs found

    DecVi: Adaptive Video Conferencing on Open Peer-to-Peer Networks

    Full text link
    Video conferencing has become the preferred way of interacting virtually. Current video conferencing applications, like Zoom, Teams or WebEx, are centralized, cloud-based platforms whose performance crucially depends on the proximity of clients to their data centers. Clients from low-income countries are particularly affected as most data centers from major cloud providers are located in economically advanced nations. Centralized conferencing applications also suffer from occasional outages and are embattled by serious privacy violation allegations. In recent years, decentralized video conferencing applications built over p2p networks and incentivized through blockchain are becoming popular. A key characteristic of these networks is their openness: anyone can host a media server on the network and gain reward for providing service. Strong economic incentives combined with lower entry barrier to join the network, makes increasing server coverage to even remote regions of the world. These reasons, however, also lead to a security problem: a server may obfuscate its true location in order to gain an unfair business advantage. In this paper, we consider the problem of multicast tree construction for video conferencing sessions in open p2p conferencing applications. We propose DecVi, a decentralized multicast tree construction protocol that adaptively discovers efficient tree structures based on an exploration-exploitation framework. DecVi is motivated by the combinatorial multi-armed bandit problem and uses a succinct learning model to compute effective actions. Despite operating in a multi-agent setting with each server having only limited knowledge of the global network and without cooperation among servers, experimentally we show DecVi achieves similar quality-of-experience compared to a centralized globally optimal algorithm while achieving higher reliability and flexibility

    Scalable and Anonymous Group Communication

    Get PDF
    Today\u27s Internet is not designed to protect the privacy of its users against network surveillance, and source and destination of any communication is easily exposed to third party observer. Tor, a volunteer-operated anonymity network, offers low-latency practical performance for unicast anonymous communication without central point of trust. However, Tor is known to be slow and it can not support group communication with scalable performance. Despite the extensive public interest in anonymous group communication, there is no system that provides anonymous group communication without central point of trust. This dissertation presents MTor, a low-latency anonymous group communication system. We construct MTor as an extension to Tor, allowing the construction of multi-source multicast trees on top of the existing Tor infrastructure. MTor does not depend on an external service (e.g., an IRC server or Google Hangouts) to broker the group communication, and avoids central points of failure and trust. MTor\u27s substantial bandwidth savings and graceful scalability enable new classes of anonymous applications that are currently too bandwidth-intensive to be viable through traditional unicast Tor communication---e.g., group file transfer, collaborative editing, streaming video, and real-time audio conferencing. We detail the design of MTor and then analyze its performance and anonymity. By simulating MTor in Shadow and TorPS using realistic models of the live Tor network\u27s topology and recent consensus records from the live Tor network, we show that MTor achieves 29% savings in network bandwidth and 73% reduction in transmission time as compared to the baseline approach for anonymous group communication among 20 group members. We also demonstrate that MTor scales gracefully with the number of group participants, and allows dynamic group composition over time. Importantly, as more Tor users switch to group communication, we show that the overall performance and bandwidth utilization for group communication improves. Finally, we discuss the anonymity implications of MTor and measure its resistance to traffic correlation attacks

    Compact tree plus algorithms for application-level multicast communications in multihome networks

    Get PDF
    Application-level multicast (ALM) communications replicate packets on host level to deliver them from a single source to multiple clients, so that it can efficiently realize a variety of network applications using moving pictures such as video conferences, distance learning, and video-on-demands. In this paper, we propose the CT+ (compact tree plus) algorithm for finding a better ALM routing tree in terms of delay minimization between hosts. CT+ consists of a tree construction stage from the existing CT algorithm, and a newly added iterative tree improvement stage. Then, we define the extended ALM routing problem and its heuristic algorithm ExCT+, to optimize the effectiveness of the multihome network in ALM communications by selecting multihomed hosts and connections in the ALM routing tree simultaneously. For their evaluations, we construct a network simulation model named MINET (multiple-ISP network simulator), where the topology is composed of multiple ISP backbone networks with IX connections, and the network traffic is generated by following the M/M/1 queuing process. The simulation results using MINET verify the effectiveness of our algorithms.</p

    Protocols for collaborative applications on overlay networks.

    Get PDF
    Third, we address the limitations of traditional multicasting models. Towards this, we propose a model where a source node has different switching time for each child node and the message arrival time at each child depends on the order in which the source chooses to send the messages. This model captures the heterogeneous nature of communication links and node hardware on the overlay network. Given a multicast tree with link delays and generalized switching delay vectors at each non-leaf node, we provide an algorithm which schedules the message delivery at each non-leaf node in order to minimize the delay of the multicast tree.First, we consider the floor control problem wherein the participating users coordinate among themselves to gain exclusive access to the communication channel. To solve the floor control problem, we present an implementation and evaluation of distributed Medium Access Control (MAC) protocols on overlay networks. As an initial step in the implementation of these MAC protocols, we propose an algorithm to construct an efficient communication channel among the participating users in the overlay network. We also show that our implementation scheme (one of the first among decentralized floor control protocols) preserves the causal ordering of messages.Our research is focused on the development of algorithms for the construction of overlay networks that meet the demands of the distributed applications. In addition, we have provided network protocols that can be executed on these overlay networks for a chosen set of collaborative applications: floor control and multicasting. Our contribution in this research is four fold.Fourth, we address the problem of finding an arbitrary application designer specific overlay network on the Internet. This problem is equivalent to the problem of subgraph homeomorphism and it is NP-Complete. We have designed a polynomial-time algorithm to determine if a delay constrained multicasting tree (call it a guest) can be homeomorphically embedded in a general network (call it a host). A delay constrained multicasting tree is a tree wherein the link weights correspond to the maximum allowable delay between the end nodes of the link and in addition, the link of the guest should be mapped to a shortest path in the host. Such embeddings will allow distributed application to be executed in such a way that application specific quality-of-service demands can be met. (Abstract shortened by UMI.)Second, we address the problem of designing multicasting sub-network for collaborative applications using which messages are required to arrive at the destinations within a specified delay bound and all the destinations must receive the message from a source at 'approximately' the same time. The problem of finding a multicasting sub-network with delay and delay-variation bound has been proved to be NP-Complete in the literature and several heuristics have been proposed

    A countermeasure approach for brute-force timing attacks on cache privacy in named data networking architectures

    Get PDF
    One key feature of named data networks (NDN) is supporting in-network caching to increase the content distribution for today’s Internet needs. However, previously cached contents may be threatened by side-channel timing measurements/attacks. For example, one adversary can identify previously cached contents by distinguishing between uncached and cached contents from the in-network caching node, namely the edge NDN router. The attacks can be mitigated by the previously proposed methods effectively. However, these countermeasures may be against the NDN paradigm, affecting the content distribution performance. This work studied the side-channel timing attack on streaming over NDN applications and proposed a capable approach to mitigate it. Firstly, a recent side-channel timing attack, designated by brute-force, was implemented on ndnSIM using the AT&T network topology. Then, a multi-level countermeasure method, designated by detection and defense (DaD), is proposed to mitigate this attack. Simulation results showed that DaD distinguishes between legitimate and adversary nodes. During the attack, the proposed DaD multi-level approach achieved the minimum cache hit ratio (≈0.7%) compared to traditional countermeasures (≈4.1% in probabilistic and ≈3.7% in freshness) without compromising legitimate requests.This work has been supported by FCT - Fundação para a Ciência e Tecnologia within the R&D Units Project Scope: UIDB/00319/2020

    Measuring And Improving Internet Video Quality Of Experience

    Get PDF
    Streaming multimedia content over the IP-network is poised to be the dominant Internet traffic for the coming decade, predicted to account for more than 91% of all consumer traffic in the coming years. Streaming multimedia content ranges from Internet television (IPTV), video on demand (VoD), peer-to-peer streaming, and 3D television over IP to name a few. Widespread acceptance, growth, and subscriber retention are contingent upon network providers assuring superior Quality of Experience (QoE) on top of todays Internet. This work presents the first empirical understanding of Internet’s video-QoE capabilities, and tools and protocols to efficiently infer and improve them. To infer video-QoE at arbitrary nodes in the Internet, we design and implement MintMOS: a lightweight, real-time, noreference framework for capturing perceptual quality. We demonstrate that MintMOS’s projections closely match with subjective surveys in accessing perceptual quality. We use MintMOS to characterize Internet video-QoE both at the link level and end-to-end path level. As an input to our study, we use extensive measurements from a large number of Internet paths obtained from various measurement overlays deployed using PlanetLab. Link level degradations of intra– and inter–ISP Internet links are studied to create an empirical understanding of their shortcomings and ways to overcome them. Our studies show that intra–ISP links are often poorly engineered compared to peering links, and that iii degradations are induced due to transient network load imbalance within an ISP. Initial results also indicate that overlay networks could be a promising way to avoid such ISPs in times of degradations. A large number of end-to-end Internet paths are probed and we measure delay, jitter, and loss rates. The measurement data is analyzed offline to identify ways to enable a source to select alternate paths in an overlay network to improve video-QoE, without the need for background monitoring or apriori knowledge of path characteristics. We establish that for any unstructured overlay of N nodes, it is sufficient to reroute key frames using a random subset of k nodes in the overlay, where k is bounded by O(lnN). We analyze various properties of such random subsets to derive simple, scalable, and an efficient path selection strategy that results in a k-fold increase in path options for any source-destination pair; options that consistently outperform Internet path selection. Finally, we design a prototype called source initiated frame restoration (SIFR) that employs random subsets to derive alternate paths and demonstrate its effectiveness in improving Internet video-QoE

    Resilient overlay networks

    Get PDF

    Hybrid Broadcast/Broadband TV Services and Media Synchronization. Demands, Preferences and Expectations of Spanish Consumers

    Full text link
    © 2018 IEEE. Personal use of this material is permitted. Permissíon from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertisíng or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.[EN] The combination of broadcast and broadband ( hybrid) technologies for delivering TV related media contents is already a reality. It has been motivated by the large amount and diversity of media contents, together with the ubiquity and multiple connectivity capabilities of modern consumption devices. The use of connected TVs and companion devices (e.g., tablets, smartphones etc.) is gaining momentum. It enables personalized and enriched TV media experiences, by also exploiting social communication opportunities. Likewise, the media consumption paradigm is worldwide evolving from passive and isolated consumer experiences toward interactive and group shared experiences between remote consumers. Nevertheless, despite the specification of standards, such as hybrid broadcast broadband TV, and the efforts from operators and content providers in the last years, the adoption of hybrid TV media services in Europe is still not as high as expected. This paper presents the concept and some examples of hybrid TV media services, emphasizing the importance of including a combination of media synchronization solutions, known as hybrid sync, to guarantee a satisfactory level of quality of experience. Additionally, it includes the summary and discussion of the results of a research study focused on more than 1000 Spanish users' habits, preferences, and expectations regarding four representative hybrid TV media services. Many valuable insights and conclusions have been derived. For instance, the current low market adoption of hybrid TV media services, despite their advantages and the high interest of consumers, and that key technological challenges still need to be overcome. The obtained results and impressions foresee the impact (or potential) of such services in the upcoming TV related media consumption landscape. Therefore, devising proper standard-compliant technological solutions (paying special attention to hybrid sync) and equipment should be continued producing appropriate contents, deploying proper hybrid TV media services and applications. As well, it should be convenient to undertake marketing and commercial efforts to boost their deployment. The contributions of this paper can be very valuable to the interested agents to be aware of the remaining challenges, envisage the opportunities, and drive their efforts to maximize the market adoption of such services.This work was supported in part by the Fondo Europeo de Desarrollo Regional, in part by the Spanish Ministry of Economy and Competitiveness under Its R&D&I Support Program under Project TEC2013-45492-R.Boronat, F.; Montagud, M.; Marfil-Reguero, D.; Luzón, C. (2018). Hybrid Broadcast/Broadband TV Services and Media Synchronization. Demands, Preferences and Expectations of Spanish Consumers. IEEE Transactions on Broadcasting. 64(1):52-69. https://doi.org/10.1109/TBC.2017.2737819S526964
    • …
    corecore