Search Constraints

Start Over
Filtering by: Alternative title ssim Information report 73-3 Remove constraint Alternative title ssim: Information report 73-3 Committee Member Bose, Bella Remove constraint Committee Member: Bose, Bella Committee Member Hamdaoui, Bechir Remove constraint Committee Member: Hamdaoui, Bechir

Search Results

  • Security protocols for linear network coding

    Creator:
    Adeli, Majid
    Abstract:
    Network coding, as the next generation of data routing protocols, enables each intermediate node in a network to process and encode its received data before forwarding it to the next nodes. Hence, the core idea in network coding is to allow a network to encode the data that is being...
    Resource Type:
    Dissertation
    Full Text:
    routing protocol. Usually, each inter- mediate node utilizes a set of routing information (such as a

  • Offloading of I/O transactions in current CPU architectures

    Creator:
    Larsen, Steen K.
    Abstract:
    IO transactions within a computer system have evolved along with other system components (i.e., CPU, memory, video) from programmed IO (PIO). In current mainstream systems (spanning from HPC to mobile) the IO transactions are CPU-centric descriptor-based DMA transactions. The key benefit is that slower IO devices can DMA write system...
    Resource Type:
    Dissertation
    Full Text:
    device DMA engine, we reduce latency for small messages by 1.5 µs. 3) Device2Device: For applications

  • Coding Techniques for Achieving Efficient Wireless Sensor Networks

    Creator:
    Qassim, Yousef M.
    Abstract:
    In this dissertation, we explored multiple coding techniques to reduce energy consumption, improve performance, and secure wireless sensor networks specifically and ad-hoc networks in general. With the introduction of Internet of Things (IoT) and 5G technologies, wireless sensor networks are quickly emerging as an important and key technology in the...
    Resource Type:
    Dissertation
    Full Text:
    . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.1.2 Power Consumption . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.1.3

  • Protocol design and optimization for wireless networks

    Creator:
    Lertsutthiwong, Monchai
    Abstract:
    We investigate a number of techniques for increasing throughput and quality of media applications over wireless networks. A typical media communication application such as video streaming imposes strict requirements on the delay and throughout of its packets, which unfortunately, cannot be guaranteed by the underlying wireless network due inherently to...
    Resource Type:
    Dissertation
    Full Text:
    thank my current and former colleagues in Multimedia Information Processing and Networking (MAIN) Lab

  • Meeting End-to-End Deadlines in Real-Time Networks Using Software Defined Networking (SDN)

    Creator:
    Almahdi, Rafid M.
    Abstract:
    Network flows in Real-Time (RT) systems need to meet stringent end-to-end deadlines in order for such systems to operate safely and reliably. Today, such systems use custom or domain specific network system designs to meet end-to-end deadlines and other constraints of real-time flows. In this work we explore the design...
    Resource Type:
    Dissertation
    Full Text:
    . . . . . . . . . . . . . . . . . . . . . 3 2 Background . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.1 Quality

  • Optimizing Interconnection Topology using Deep Reinforcement Learning

    Creator:
    Zeng, Kai
    Abstract:
    As the number of nodes in high-performance computing (HPC) systems continues to grow, it becomes increasingly important to design scalable interconnection network topologies. Prior work has shown promise in adding random shortcuts on top of an existing topology to reduce average hop count and network diameter, but has been limited...
    Resource Type:
    Masters Thesis
    Full Text:
    . . . . . . . . . . . . . . . . . . . . . . . . . 7 2.3 Monte Carlo Tree Search . . . . . . . . . . . . . . . . . . . . . . . . . 9 3 Related Work