Coding against stragglers in distributed computation scenarios

Data and analytics capabilities have made a leap forward in recent years. The volume of available data has grown exponentially. The huge amount of data needs to be transferred and stored with extremely high reliability. The concept of coded computing , or a distributed computing paradigm that utilizes coding theory to smartly inject and leverage data/computation redundancy into distributed computing systems, mitigates the fundamental performance bottlenecks for running large-scale data analytics. In this dissertation, a distributed computing framework, first for input files distributedly stored on the uplink of a cloud radio access network architecture, is studied. It focuses on that decoding at the cloud takes place via network function virtualization on commercial off-the-shelf servers. In order to mitigate the impact of straggling decoders in this platform, a novel coding strategy is proposed, whereby the cloud re-encodes the received frames via a linear code before distributing them to the decoding processors. Transmission of a single frame is considered first, and upper bounds on the resulting frame unavailability probability as a function of the decoding latency are derived by assuming a binary symmetric channel for uplink communications. Then, the analysis is extended to account for random frame arrival times. In this case, the trade-off between an average decoding latency and the frame error rate is studied for two different queuing policies, whereby the servers carry out per-frame decoding or continuous decoding, respectively. Numerical examples demonstrate that the bounds are useful tools for code design and that coding is instrumental in obtaining a desirable compromise between decoding latency and reliability. In the second part of this dissertation large matrix multiplications are considered which are central to large-scale machine learning applications. These operations are often carried out on a distributed computing platform with a master server and multiple workers in the cloud operating in parallel. For such distributed platforms, it has been recently shown that coding over the input data matrices can reduce the computational delay, yielding a trade-off between recovery threshold, i.e., the number of workers required to recover the matrix product, and communication load, and the total amount of data to be downloaded from the workers. In addition to exact recovery requirements, security and privacy constraints on the data matrices are imposed, and the recovery threshold as a function of the communication load is studied. First, it is assumed that both matrices contain private information and that workers can collude to eavesdrop on the content of these data matrices. For this problem, a novel class of secure codes is introduced, referred to as secure generalized PolyDot codes, that generalize state-of-the-art non-secure codes for matrix multiplication. Secure generalized PolyDot codes allow a flexible trade-off between recovery threshold and communication load for a fixed maximum number of colluding workers while providing perfect secrecy for the two data matrices. Then, a connection between secure matrix multiplication and private information retrieval is studied. It is assumed that one of the data matrices is taken from a public set known to all the workers. In this setup, the identity of the matrix of interest should be kept private from the workers. For this model, a variant of generalized PolyDot codes is presented that can guarantee both secrecy of one matrix and privacy for the identity of the other matrix for the case of no colluding servers

Analyzing Voice And Video Call Service Performance Over A Local Area Network

Tez (Yüksek Lisans) -- İstanbul Teknik Üniversitesi, Fen Bilimleri Enstitüsü, 2010Thesis (M.Sc.) -- İstanbul Technical University, Institute of Science and Technology, 2010Bu çalışmada, VOIP teknolojisinden ve bu teknolojiyi kablolu ve kablosuz ortamda gerçeklemenin en önemli darboğazları anlatılacaktır. Ayrıca H.323, SIP (Session Initiation Protocol), Megaco ve MGCP gibi yaygın olarak kullanılan ses iletim protokolleri ve H.261, H.263 ve H.264 gibi görüntü iletim protokollerinden bahsedilmiştir. Ses kodek seçimi ve VOIP servis kalitesine etki eden faktörleri anlatılmaktadır. Bu tezde, ses, görüntü ve veri iletişimini aynı anda bünyesinde barındıran gerçek şebekeler simüle edilecektir. Kullanıcılara rastlantısal olarak ses, görüntü ve FTP gibi birtakım uygulamalar atanmıştır. Ayrıca önerilen kablolu şebekeye, kablosuz bir şebeke ilave edilerek sonuçlar incelenecektir. Optimal servis kalitesini sağlamak için seçilen uygun kuyruklama mekanizmaları ve kodek seçimlerini içeren senaryolar incelenecek ve OPNET ile elde edilmiş simülasyon sonuçları tartışılacaktır.In this study, we present a detailed description of the VoIP and also the most common challenges of implementing voice communication into wireline or wireless networks are discussed. Common voice protocols, such as H.323, Session Initiation Protocol (SIP), Megaco, MGCP and video protocols such as H.261, H.263, H.264 are described as well. CODEC selection and factors affecting VoIP Quality of Service are analyzed. We simulate a real network which includes both voice, video and data communication simultaneously. Workstations are randomly assigned to different applications, such as voice, video and FTP. We will also implement a wireless network to our proposed system. The scenarios including selecting appropriate queuing scheme and codec selection are presented and the simulation results with OPNET are drawn.Yüksek LisansM.Sc

A Time-Efficient Strategy For Relay Selection and Link Scheduling In Wireless Communication Networks

Despite the unprecedented success and proliferation of wireless communication, sustainable reliability and stability among wireless users are still considered important issues in the underlying link protocols. Existing link-layer protocols, like ARQ [44] or HARQ [57,67] approaches are designed to achieve this goal by discarding a corrupted packet at the receiver and performing one or more retransmissions until the packet is successfully decoded or a maximum number of retransmission attempts is reached. These strategies suffer from degradation of throughput and overall system instability since packets need to be en/decode in every hop, leading to high burden for relay nodes especially when the traffic load is high. On the other hand, due to the broadcast nature of wireless communication, when a relay transmits a packet to a specific receiver, it could become interference to other receivers. Thus, rather than activating all the relays simultaneously, we can only schedule a subset of relays in each time slot such that the interference among the links will not cause some transmissions to fail. Accordingly, in this dissertation, we mainly address the following two problems: 1) Relay selection: given a route (i.e., a sequence of relays), how to select the relays to en/decode packets to minimize the latency to reach the destination? 2) Link scheduling: how to schedule relays such that the interference among the relays will not cause transmission failure and the throughput is maximized? Relay Selection Problem. To solve the relay selection problem, we propose a Code Embedded Distributed Adaptive and Reliable (CEDAR) link-layer framework that targets low latency. CEDAR is the first theoretical framework for selecting en/decoding relays to minimize packet latency in wireless communication networks. It employs a theoretically-sound framework for embedding channel codes in each packet and performs the error correcting process in selected intermediate nodes in packet\u27s route. To identify the intermediate relay nodes for en/decoding to minimize average packet latency, we mathematically analyze the average packet delay, using Finite State Markovian Channel model and priority queuing model, and then formalize the problem as a non-linear integer programming problem. To solve this problem, we design a scalable and distributed scheme which has very low complexity. The experimental results demonstrate that CEDAR is superior to the schemes using hop-by-hop decoding and destination-decoding in terms of both packet delay and throughput. In addition, the simulation results show that CEDAR can achieve the optimal performance in most cases. Link Scheduling Problem. As for the link scheduling problem, we formulate a new problem called Fading-Resistant Link Scheduling (Fadin-R-LS) problem, which aims to maximize the throughput (the sum data rate) for all the links in a single time slot. The problem is different from the existing link scheduling problems by incorporating the Rayleigh-fading model to describe the interference. This model extends the deterministic interference model based on the Signal-to-Interference Ratio (SIR) using stochastic propagation to address fading effects in wireless networks. Based on the geometric structure of Fadin-R-LS, we then propose three centralized schemes for Fadin-R-LS, with O(g(L)), O(g(L)), and O(1) performance guarantee for packet latency, where g(L) is the number of length magnitudes of link set L. Furthermore, we propose a completely distributed approach based on game theory, which has O(g(L)^2\alpha) performance guarantee. Furthermore, we incorporate a cooperative communication (CC) technique, e.g., maximum ratio combining (MRC), into our system to further improve the throughput, in which receivers are allowed to combine messages from different senders to combat transmission errors. In particular, we formulate two problems named cooperative link scheduling problem (CLS) and one-shot cooperative link scheduling problem (OCLS). The first problem aims to find a schedule of links that uses the minimum number of time slots to inform all the receivers. The second problem aims to find a set of links that can inform the maximum number of receivers in one time slot. We prove both problems to be NP-hard. As a solution, we propose an algorithm for both CLS and OCLS with g(K) approximation ratio, where g(K) is so called the diversity of key links. In addition, we propose a greedy algorithm with O(1) approximation ratio for OCLS when the number of links for each receiver is upper bounded by a constant. In addition, we consider a special case for the link scheduling problem, where there is a group of vehicles forming a platoon and each vehicle in the platoon needs to communicate with the leader vehicle to get the leader vehicle\u27s velocity and location. By leveraging a typical feature of a platoon, we devise a link scheduling algorithm, called the Fast and Lightweight Autonomous link scheduling algorithm (FLA), in which each vehicle determines its own time slot simply based on its distance to the leader vehicle. Finally, we conduct a simulation on Matlab to evaluate the performance of our proposed methods. The experimental results demonstrate the superior performance of our link scheduling methods over the previous methods

Satellite Networks: Architectures, Applications, and Technologies

Since global satellite networks are moving to the forefront in enhancing the national and global information infrastructures due to communication satellites' unique networking characteristics, a workshop was organized to assess the progress made to date and chart the future. This workshop provided the forum to assess the current state-of-the-art, identify key issues, and highlight the emerging trends in the next-generation architectures, data protocol development, communication interoperability, and applications. Presentations on overview, state-of-the-art in research, development, deployment and applications and future trends on satellite networks are assembled

Dinamička distribucija sigurnosnih ključeva i koalicijski protokol IP adresa za mobilne ad hoc mreže

In mobile adhoc networks (MANETs) a tree-based dynamic address auto-configuration protocol (T-DAAP) is one of the best protocols designed for address assignment as far as the network throughput and packet delays are concerned. Moreover, MANET security is an important factor for many applications given that any node can listen to the channel and overhear the packets being transmitted. In this paper, we merge the address assignment with the security key delivery into one protocol, such that a node in the MANET is configured with IP address and security key simultaneously. To the best of our knowledge, no single protocol provides concurrent assignment of IP addresses and security keys for MANET nodes. The proposed method, which is based on T-DAAP, shows significant enhancements in the required control packets needed for assigning network nodes IP addresses and security keys, MAC layer packets, total end-to-end delay, and channel throughput over those obtained when using separate protocols. Additionally, it provides not only efficient security keys to the nodes from the first moment they join the network, but also secure delivery of the address and security key to all participating nodes. It is noteworthy to mention that providing a complete security model for MANET to detect and countermeasure network security threats and attacks is beyond the scope of our proposed protocol.Kod mobilnih ad hoc mreža (MANET) dinamički protokol za autokonfiguraciju adresa baziran na stablu (T-DAAP) je jedan od najboljih protokola dizajniranih za dodjelu adresa iz perspektive propusnosti mreže i i kašnjenja paketa. štoviše, sigurnost MANET-a je važan faktor za mnoge aplikacije s obzirom da bilo koji čvor može osluškivati kanal i slučajno čuti pakete koji se šalju. U ovom radu, dodjela adresa i dostava sigurnosnih ključeva spojeni su u jedan protokol tako da je čvor u MANET-u konfiguriran simultano s IP adresom i sigurnosnim ključem. Prema saznanjima autora, niti jedan postojeći protokol ne pruža istovremeno dodjeljivanje IP adrese i sigurnosnog ključa za MANET čvorove. Predložena metoda, koja se bazira na T-DAAP-u, pokazuje značajna poboljšanja u odnosu na metode koje koriste odvojene porotokole, kod traženih kontrolnih paketa koji su potrebni za dodjeljivanje IP adresa i sigurnosnih ključeva čvorovima mreže, MAC paketa, ukupnog end-to-end kašnjenja i propusnosti kanala. Dodatno pruža ne samo efikasne sigurnosne ključeve čvorovima od trenutka kad se priključe mreži, nego i sigurno dostavljanje adrese i sigurnosnog ključa svim čvorovima koji sudjeluju u mreži. Važno je spomenuti da je pružanje cjelokupnog sigurnosnog modela za MANET koji detektira dodatno i protumjere prijetnjama i napadima na sigurnost mreže izvan dosega predloženog protokola