University of Surrey

Test tubes in the lab Research in the ATI Dance Research

Delay Minimisation in Network Coding.

Mostafavi, S. Mostafa. (2010) Delay Minimisation in Network Coding. Doctoral thesis, University of Surrey (United Kingdom)..

[img]
Preview
Text
27696202.pdf
Available under License Creative Commons Attribution Non-commercial Share Alike.

Download (8MB) | Preview

Abstract

Network coding is a promising generalization of routing which provides a mechanism to improve the performance of multicast networks. The core notion of network coding is to allow and encourage mixing of data at intermediate network nodes and enable the final receiver to deduce the original message from the mixed message data packets that it receives. Thanks to the above features; network coding seems an appealing solution in wireless networks that are characterized by limited energy, computational and communication resources. In the case of multicast network coding it is essential to have multipath routing from a source to destinations. The transmitted coded packets will be sent over different paths to the multiple receivers and then will be decoded at the receivers for data extraction once all the coded packets are received. A key component of an efficient network coding based on multipath routing in multicast networks is the delay minimisation that deals with how to minimise the delay of the encoded packets distributed amongst the multiple paths from a source to destinations. This is an important issue as coding is performed over a block of packets and the actual delay is the time needed for the receiver to wait for receiving all the necessary packets within the block for decoding. To address this issue, two broad set of approaches have been proposed in the literature. In the first category, delay reduction is achieved through better coding techniques whereas in the second approach, delay reduction is achieved through better routing and rate control schemes. In this thesis we have investigated delay minimisation in network coding based on multipath routing using an appropriate routing and rate control approach over the network. We have shown that delay minimisation in network coding from one source to several destinations is subset of delay minimisation on the multi path network from one source to one destination. To achieve such delay minimisation two strategies of average delay minimisation and maximum delay minimisation, through an appropriate route selection and traffic allocation were analytically investigated. Using analysis and simulation we have proved that delay synchronisation is the key policy for delay minimisation in network coding. Based on this finding we proposed an adaptive algorithm to achieve delay synchronisation. By applying this algorithm to the network coding scenario in butterfly network we have shown that the proposed end to end delay minimisation solution allows the network to obtain the maximum achievable throughput with finite delay.

Item Type: Thesis (Doctoral)
Divisions : Theses
Authors : Mostafavi, S. Mostafa.
Date : 2010
Additional Information : Thesis (Ph.D.)--University of Surrey (United Kingdom), 2010.
Depositing User : EPrints Services
Date Deposited : 06 May 2020 14:15
Last Modified : 06 May 2020 14:18
URI: http://epubs.surrey.ac.uk/id/eprint/856087

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year


Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800