Grant: Idea to Innovation
University of Alberta
$9,974.00
New class of linear-complexity overhead-optimized random linear network codes
FY 2013-14
Summary
Increased demand for data broadcasting, large data downloads, on-line video, internet TV, teleconferencing, etc., has led to an ever increasing usage of communication network resources. Cisco has projected the Internet traffic to reach 1.4 trillion gigabytes and the number of Internet connected devices to reach 3 devices per capita by 2017. Existing network communication protocols will not be able to handle this enormous demand unless at the cost of adding much new infrastructure, e.g., increasing the connection bandwidth or increasing the number of servers. Obviously, adding new infrastructure is a very costly solution and is not always feasible due to scarcity of resources. Furthermore, the dynamic nature of most modern communication networks (such as wireless networks) makes the conventional protocols even more inefficient. As a result, new solutions are needed or the capacity of our existing network infrastructure will soon be overwhelmed.Network coding is an elegant technique shown to significantly enhance packet networks' throughput. In random linear network coding (RLNC), close-to-optimal throughput for multicast can be achieved even without any centralized knowledge of the network topology. This makes RLNC a very attractive solution for dynamic networks. In addition to increasing the throughput, network coding has been shown to provide other benefits such as increasing bandwidth and energy efficiency, increasing robustness and adaptability, increasing security, and reducing overheads in distributed data storage. These make network coding appealing for various applications. The benefits of RLNC, however, come with a price: high computational complexity which is prohibitive even for moderate block lengths. Existing low-complexity RLNC solutions suffer from a large reception overhead. Recently, we have developed a low-complexity low-overhead RLNC solution that outperforms existing solutions by a wide margin. In this I2I Market Assessment proposal, we identifying the key market demands and commercial potential of this technology.
Program
Idea to Innovation
Recipient
Location
Alberta, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
451934-2013
Name nom
Ardakani, Masoud
Department département
Electrical and Computer Engineering
Organization id
9
Institution établissement
University of Alberta
Province en
Alberta
Province fr
Alberta
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2013
Competition year année de concours
2013
Award amount
9974
Program id
I2IPJ
Program name en
Idea to Innovation
Program name fr
De l'idée à l'innovation
Group en
Research partnerships programs
Group fr
Programmes de partenariat
Committee code
96
Committee name en
RPP Internal Decision Cttee
Committee name fr
Cté de décision interne - PPR
Area of application code
802
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Information systems and technology
Area of application fr
Systèmes d'information et technologie de l'information
Research subject code
2513
Research subject group en
Electrical and electronic engineering
Research subject group fr
Génie électrique et électronique
Research subject en
Data communications
Research subject fr
Transmission des données
Partie
1
Nb partie
1
Application title
New class of linear-complexity overhead-optimized random linear network codes
Keyword
NSERC
Application summary
Increased demand for data broadcasting, large data downloads, on-line video, internet TV, teleconferencing, etc., has led to an ever increasing usage of communication network resources. Cisco has projected the Internet traffic to reach 1.4 trillion gigabytes and the number of Internet connected devices to reach 3 devices per capita by 2017. Existing network communication protocols will not be able to handle this enormous demand unless at the cost of adding much new infrastructure, e.g., increasing the connection bandwidth or increasing the number of servers. Obviously, adding new infrastructure is a very costly solution and is not always feasible due to scarcity of resources. Furthermore, the dynamic nature of most modern communication networks (such as wireless networks) makes the conventional protocols even more inefficient. As a result, new solutions are needed or the capacity of our existing network infrastructure will soon be overwhelmed.Network coding is an elegant technique shown to significantly enhance packet networks' throughput. In random linear network coding (RLNC), close-to-optimal throughput for multicast can be achieved even without any centralized knowledge of the network topology. This makes RLNC a very attractive solution for dynamic networks. In addition to increasing the throughput, network coding has been shown to provide other benefits such as increasing bandwidth and energy efficiency, increasing robustness and adaptability, increasing security, and reducing overheads in distributed data storage. These make network coding appealing for various applications. The benefits of RLNC, however, come with a price: high computational complexity which is prohibitive even for moderate block lengths. Existing low-complexity RLNC solutions suffer from a large reception overhead. Recently, we have developed a low-complexity low-overhead RLNC solution that outperforms existing solutions by a wide margin. In this I2I Market Assessment proposal, we identifying the key market demands and commercial potential of this technology.