Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 63 for “"Unicast"”.

  1. Dynamic Resource Management in RSVP- Controlled Unicast Networks

    Resources are said to be fragmented in the network when they are available in non-contiguous blocks, and calls are dropped as they may not end sufficient resources. Hence, available resources may remain unutilized. In this thesis, the effect of resource fragmentation (RF) on RSVP-controlled …

    unt Repository record for Dynamic Resource Management in RSVP- Controlled Unicast Networks (opens in a new tab)

  2. Definição de classes para comunicação Unicast e Multicast

    … definem-se classes para a comunicação do tipo unicast e multicast, nas modalidades de envio confiável e não-confiável. Além destes serviços de comunicação básicos, foram desenvolvidas classes que permitem referenciar os participantes da comunicação através de nomes. As classes estão organizadas …

    brazil-ufrgs Repository record for Definição de classes para comunicação Unicast e Multicast (opens in a new tab)

  3. Linear algebraic approaches to coding for multiple unicast networks

    The multiple unicast network coding problem is a classical open problem in network information theory, whose applications rapidly increase especially with the occurrences in models of distributed storage and content delivery systems. In this thesis, we explore the ideas of linear algebraic …

    mit Repository record for Linear algebraic approaches to coding for multiple unicast networks (opens in a new tab)

  4. Performance evaluation of active network-based unicast and multicast congestion control protocols

    … according to their modes of operation, i.e. unicast, multicast single rate, and multicast multirate protocols. The research phase includes modelling and simulation experiments with the ns-2 network simulator. The first area of interest in this thesis is unicast congestion control protocols. …

    whiterose Repository record for Performance evaluation of active network-based unicast and multicast congestion control protocols (opens in a new tab)

  5. Fast algorithm for joint unicast and multicast beamforming in large-scale systems

    We consider a joint unicast and multi-group multicast beamforming problem for massive multiple-input multiple-output (MIMO) system with a large number of unicast users. We propose an alternating direction method of multipliers (ADMM)-based fast algorithm that efficiently obtains the beamforming …

    uoit Repository record for Fast algorithm for joint unicast and multicast beamforming in large-scale systems (opens in a new tab)

  6. A Study of the Multiple-Unicast Network Coding Conjecture Using Riemannian Manifolds

    … nodes within a network. The multiple-unicast conjecture proposed by Li and Li [18] in 2004 is one of the most well-known unsolved problems in network coding field. The conjecture asserts that, for multiple independent unicast transmissions in an undirected network, network coding has …

    calgary Repository record for A Study of the Multiple-Unicast Network Coding Conjecture Using Riemannian Manifolds (opens in a new tab)

  7. Peer-to-Peer Group Communication for City-Scale Mesh Networks

    … out of wireless access points. To test our unicast routing protocol, we built a discrete-event network simulator using SimPy. However, we make several simplifying assumptions, and unicast is not sufficient for many applications. In this thesis, I show that our simulator nevertheless achieves …

    mit Repository record for Peer-to-Peer Group Communication for City-Scale Mesh Networks (opens in a new tab)

  8. A Connection Admission Control Framework for UMTS based Satellite Systems.An Adaptive Admission Control algorithm with pre-emption control mechanism for unicast and multicast communications in satellite UMTS.

    … for a UMTS based satellite system supporting unicast and multicast traffic. The design of the system architecture for a UMTS based satellite system is presented. Based on this architecture, a CAC framework is designed consisting of three different functionalities: the admission control …

    bradford Repository record for A Connection Admission Control Framework for UMTS based Satellite Systems.An Adaptive Admission Control algorithm with pre-emption control mechanism for unicast and multicast communications in satellite UMTS. (opens in a new tab)

  9. Extensions for Multicast in Mobile Ad-hoc Networks (XMMAN): The Reduction of Data Overhead in Wireless Multicast Trees

    … to high-speed backbone networks. While many unicast MANET protocols have been explored, research involving multicast protocols has been limited. Existing multicast algorithms attempt to reduce routing overhead, but few, if any, attempt to reduce data overhead. The broadcast nature of wireless …

    vt Repository record for Extensions for Multicast in Mobile Ad-hoc Networks (XMMAN): The Reduction of Data Overhead in Wireless Multicast Trees (opens in a new tab)

  10. Layering principles for wireless networks

    … under restricted traffic models (for example, unicast, multicast and broadcast). In this thesis, the main goal is to understand the capacity of general wireless networks under a general traffic model, i.e., multiple-unicast, in which there are multiple sources intending to communicate …

    uiuc Repository record for Layering principles for wireless networks (opens in a new tab)

  11. Leveraging structure for communication in human-centric DTNs

    … consider three components. Like most networks, unicast is a fundamental and necessary form of communication for human-centric DTNs. Therefore, we develop a highly efficient and effective unicast protocol, called Encounter-based Routing (EBR). EBR is an intentionally resource-friendly protocol …

    uiuc Repository record for Leveraging structure for communication in human-centric DTNs (opens in a new tab)

  12. Optimal control for wireless networks

    … packets belonging to different sessions, such as unicast, broadcast, multicast and anycast, collectively known as the generalized flows. The goal of this thesis is to design an efficient routing, and wireless link scheduling policy, that maximizes net throughput. Currently, the only known …

    mit Repository record for Optimal control for wireless networks (opens in a new tab)

  13. Protocol design for scalable and reliable group rekeying

    … in two steps: a multicast step followed by a unicast recovery step. Proactive forward error correction (FEC) is used in multicast to reduce delivery latency and limit the number of users who need unicast recovery. The unicast recovery step provides eventual reliability; it also reduces the …

    texas Repository record for Protocol design for scalable and reliable group rekeying (opens in a new tab)

  14. Performance study of the Xpress Transfer Protocol

    … The performance measurements include unicast throughput and delay in an Ethernet network, in two different hardware configurations, one based on Sun-3 workstations, and the other one on Sun-4 workstations. The performance of the KRM is compared with that of other protocols such as the …

    concordia Repository record for Performance study of the Xpress Transfer Protocol (opens in a new tab)

  15. Cooperative Push/Pull Protocols for Live Peer-Assisted Streaming

    … streaming is today "on demand" and delivered via unicast delivery; however, many applications require delivery to many end-users and the lack of ubiquitous IP multicast remains a weakness of the Internet. Given this scenario, the peer-to-peer (P2P) or peer-assisted communications is an appealing …

    trento Repository record for Cooperative Push/Pull Protocols for Live Peer-Assisted Streaming (opens in a new tab)

  16. Topics in multi-terminal wireless networks

    … with layered decoding is presented for the unicast and multi-source wireless network and shown to be approximately optimal. This scheme is shown to allow better decoding complexity compared to previously known approximately optimal schemes. Characterizing the layered decoding scheme is shown …

    uiuc Repository record for Topics in multi-terminal wireless networks (opens in a new tab)

  17. Transmission scheduling with deadline and throughput constraints

    … we start with a wireless network with multiple unicast flows. We investigate how delay in feedback information decreases the feasibility region. Second, we consider time-varying channels and how delay in network state information decreases the feasibility region. Third, we characterize the …

    mit Repository record for Transmission scheduling with deadline and throughput constraints (opens in a new tab)

  18. Network coding for anonymous broadcast

    … to be difficult to emulate efficiently over unicast networks. This thesis introduces NCGAB, a decentralized peer-to-peer overlay network based on network coded gossip that provides a resilient, anonymous broadcast medium. Unlike most anonymous communication systems, NCGAB requires no …

    mit Repository record for Network coding for anonymous broadcast (opens in a new tab)

  19. Delay-Aware Multi-Path Routing in a Multi-Hop Network: Algorithms and Applications

    … and average delay. First, we consider a single-unicast setting where in a multi-hop network a sender requires to use multiple paths to stream a flow at a fixed rate to a receiver. Two important delay metrics are the average sender-to-receiver delay and the maximum sender-to-receiver delay. …

    vt Repository record for Delay-Aware Multi-Path Routing in a Multi-Hop Network: Algorithms and Applications (opens in a new tab)

  20. Anonymity properties of two network coded gossip protocols

    … in 2013, eciently implements broadcast over unicast and requires no pre-existing infrastructure. We propose a second protocol, CHAP, which extends NCGAB and is designed to use wireless broadcast capabilities as well as wired links. We show anonymity for some information-theoretic measures …

    mit Repository record for Anonymity properties of two network coded gossip protocols (opens in a new tab)

Page 1 of 4