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

Nguyen Tuong

dblp:73/5393 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2001
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 1

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 · 44% Content delivery and video streaming · 44% Network performance modeling · 13%
Computer graphics and multimedia
1 paper
Audio and music processing · 100%

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

TopicWeightPapersLastEvidence papers
Audio and music processing › speech coding
packet loss concealment
0.012001
Intra-flow loss recovery and control for VoIP · ACM Multimedia 2001
Audio and music processing
speech quality
0.012001
Intra-flow loss recovery and control for VoIP · ACM Multimedia 2001
Content delivery and video streaming › error resilience
packet loss recovery
0.012001
Intra-flow loss recovery and control for VoIP · ACM Multimedia 2001
Internet architecture and protocols
voice over IP
0.012001
Intra-flow loss recovery and control for VoIP · ACM Multimedia 2001
Network performance modeling › packet loss
loss modeling
0.012001
Intra-flow loss recovery and control for VoIP · ACM Multimedia 2001

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

loss concealment · 0.1intra-flow loss recovery · 0.1hop-by-hop support · 0.1
YearPublicationVenuePosition
2001 Intra-flow loss recovery and control for VoIP
abstract
"Best effort" packet-switched networks, like the Internet, do not offer a reliable transmission of packets to applications with real-time constraints such as voice. Thus, the loss of packets impairs the application-level utility. For voice this utility impairment is twofold: on one hand, even short bursts of lost packets may decrease significantly the ability of the receiver to conceal the packet loss and the speech signal playout is interrupted. On the other hand, some packets may be particular sensitive to loss as they carry more important information in terms of user perception than other packets.We first develop an end-to-end model based on loss run-lengths with which we can describe the loss distribution within a flow. These packet-level metrics are then linked to user-level objective speech quality metrics. Using this framework, we find that for low-compressing sample-based codecs (PCM) with loss concealment isolated packet losses can be concealed well, whereas burst losses have a higher perceptual impact. For high-compressing frame-based codecs (G.729) on one hand the impact of loss is amplified through error propagation caused by the decoder filter memories, though on the other hand such coding schemes help to perform loss concealment by extrapolation of decoder state. Contrary to sample-based codecs we show that the concealment performance may "break" at transitions within the speech signal however.We then propose mechanisms which differentiate between packets within a voice data flow to minimize the impact of packet loss. We designate these methods as "intra-flow" loss recovery and control. At the end-to-end level, identification of packets sensitive to loss (sender) as well as loss concealment (receiver) takes place. Hop-by-hop support schemes then allow to (statistically) trade the loss of one packet, which is considered more important, against another one of the same flow which is of lower importance. As both packets require the same cost in terms of network transmission, a gain in user perception is obtainable. We show that significant speech quality improvements can bem achieved and additional data and delay overhead can be avoided while still maintaining a network service which is virtually identical to best effort in the long term.
Henning Sanneck, Nguyen Tuong, Long Le, Adam Wolisz, Georg Carle
ACM Multimedia2