Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Vijay Suryavanshi

dblp:95/2093 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2008
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 3 · 3 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Internet architecture and protocols · 77% Transport protocols and congestion control · 12% Physical-layer communications · 12%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › link-layer protocols
header compression
0.112008
Error-resilient packet header compression · IEEE Trans. Commun. 2008
Internet architecture and protocols
protocol design
0.112008
Error-resilient packet header compression · IEEE Trans. Commun. 2008
Transport protocols and congestion control
error control
0.012008
Error-resilient packet header compression · IEEE Trans. Commun. 2008
Physical-layer communications › channel coding
hybrid ARQ
0.012008
Error-resilient packet header compression · IEEE Trans. Commun. 2008

Methods — techniques the papers use, named apart from their topics

finite state machine · 0.1error control coding · 0.1
YearPublicationVenuePosition
2008 Error-resilient packet header compression
abstract
Full packet headers consume valuable bitrate, which is especially costly in satellite links and some terrestrial wireless links. This has motivated the compression of packet headers by exploiting their correlation via using finite-state machines. The drawback is that compression in the presence of channel errors (packet loss) may result in error propagation. We offer several designs by adapting error control codes for the requirements of packet header compression in uni-directional and bi-directional links, and explore the tradeoffs in complexity, delay, and system performance. For the bi-directional link, we propose a new design called predictive hybrid ARQ and evaluate its performance. Experiments show significant gains in link-layer throughput as well as improved application layer performance demonstrated via video transfer experiments.
Vijay Suryavanshi, Aria Nosratinia
IEEE Trans. Commun.1
2005 Convolutional coding for resilient packet header compression
abstract
This paper proposes a system using convolutional codes to mitigate error propagation in packet header compression. Convolutional codes are a class of forward error correction (FEC) codes, and their use is motivated because on uni-directional links loss of even one packet can render subsequent packets useless. A combination of two interleavers is used to address channel memory and increase the power of the code, and the optimum yet computationally efficient Viterbi algorithm is used for decoding at the receiver. Simulation results demonstrate the advantages of the proposed scheme.
Vijay Suryavanshi, Aria Nosratinia
GLOBECOM1
2004 Resilient packet header compression through coding
abstract
Header compression saves bandwidth, but it also introduces error propagation whenever packets are lost. We propose to use error correcting codes on the compressed packet headers. The result is an overall system that maintains most of the bandwidth savings of header compression and yet is robust with respect to errors. The key to achieving this tradeoff is appropriate distribution of parity symbols across the packets. The proposed system performs better than ordinary header compression and as well as the TWICE algorithm. In most cases, the effects of the error propagation can be almost removed, such that the end-to-end packet loss rate is similar to a system with no header compression, while the bitrate savings are largely maintained.
Vijay Suryavanshi, Aria Nosratinia, Ramakrishna Vedantham
GLOBECOM1