Name
Abstract | ||
|---|---|---|
Lossy communication networks may be one of the most challenging issues for Transmission Control Protocol (TCP), as random loss could be erroneously interpreted into congestion due to the original mechanism of TCP. Network coding (NC) promises significant improvement in such environment thanks to its ability to mix data across time and flows. Therefore, it has been proposed to combine with TCP called TCPNC by MIT. In this paper, we dedicated to quantifying the R, a key parameter for redundant packets, and make it close to the loss rate as much as possible, which has not been considered in the previous research. All of these are done by the sender who is completely unconscious of the network situation. Simulation results by NS2 under both wired and wireless networks showed that our method retains all the advantages of TCP-NC, and meanwhile outperforms TCP-NC and the other TCP variants in timevarying lossy networks. Copyright © 2015 The Institute of Electronics, Information and Communication Engineers. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1587/transfun.E98.A.400 | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences |
Keywords | Field | DocType |
lossy networks, TCP, network coding, dynamic redundancy | Linear network coding,Transmission (mechanics),Theoretical computer science,Mathematics | Journal |
Volume | Issue | ISSN |
E98A | 1 | 0916-8508 |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pan Kai | 1 | 4 | 4.47 |
| Weiyang Liu | 2 | 31 | 6.29 |
| Dongcheng Wu | 3 | 1 | 1.39 |
| Li Hui | 4 | 173 | 34.14 |