Paper Info
Title
Generalized $M_{m,r}$ -Network: A Case for Fixed Message Dimensions
Abstract
In this letter, we first present a class of networks named <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Generalized</italic> <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${{M}}_{{ \textit {m, r}}}$ </tex-math></inline-formula> <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">-Network</italic> for every integer <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${m} \geq 2$ </tex-math></inline-formula> and <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\forall {r} \in \{0, 1,\ldots, {m}-1\}$ </tex-math></inline-formula> and we show that every network of this class admits a vector linear solution if and only if the message dimension is an integer multiple of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${m}$ </tex-math></inline-formula> . We show that the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Generalized</italic> <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${M}$ </tex-math></inline-formula> <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">-Network</italic> presented in the work of Das and Rai and the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Dim-</italic> <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${m}$ </tex-math></inline-formula> <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Network</italic> introduced in the work of Connelly and Zeger which are generalizations to the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${M}$ </tex-math></inline-formula> -Network can be considered as special cases of Generalized <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${M}_{\textit {m, r}}$ </tex-math></inline-formula> -Network for <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${r}=1$ </tex-math></inline-formula> and <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${r}={m}-1$ </tex-math></inline-formula> respectively. Then we focus on a problem induced by depending on integer multiples of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${m}$ </tex-math></inline-formula> as message dimensions to achieve the linear coding capacity in the class of Generalized <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${M}_{\textit {m, r}}$ </tex-math></inline-formula> (proven to be equal to 1). We note that for large values of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${m}$ </tex-math></inline-formula> , packet sizes will grow beyond feasible thresholds in real-world networks. This motivates us to examine the capacity of the network in the case of fixed message dimensions. A study on the contrast among the impacts of fixed message dimensions in different networks of class <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${M}_{\textit {m, r}}$ </tex-math></inline-formula> -Network highlights the importance of the examined problem. In addition to complete/partial solutions obtained for different networks of the class Generalized <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${M}_{\textit {m, r}}$ </tex-math></inline-formula> -Network, our studies pose some open problems which make the Generalized <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${M}_{\textit {m, r}}$ </tex-math></inline-formula> -Network an attractive topic for further research.
Year
DOI
Venue
2020
10.1109/LCOMM.2019.2950193
IEEE Communications Letters
Keywords
DocType
Volume
Network coding,Linear codes,Routing,Random processes,Computer science
Journal
24
Issue
ISSN
Citations 
1
1089-7798
0
PageRank 
References 
Authors
0.34
0
8
Name
Order
Citations
PageRank
Vikrant Singh100.34
Behrouz Zolfaghari200.34
Chunduri Venkata Dheeraj Kumar300.34
Brijesh Kumar Rai49513.98
Khodakhast Bibak500.34
Gautam Srivastava635969.28
Swapnoneel Roy700.34
Takeshi Koshiba800.34