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

Szymon Jakubczak

dblp:35/7256 · also Szymon Chachulski · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 2011
—ORCID · none

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

Computer networks · 4 · 4 first-authorApplied, interdisciplinary, general and emerging computing · 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
4 papers
Content delivery and video streaming · 50% Wireless networking · 14% Transport protocols and congestion control · 10%
Computer graphics and multimedia
1 paper
Multimedia systems and quality of experience · 100%

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

TopicWeightPapersLastEvidence papers
Wireless networking
broadcast
0.112011
A cross-layer design for scalable mobile video · MobiCom 2011
Content delivery and video streaming › wireless video streaming
cross-layer video streaming
0.112011
A cross-layer design for scalable mobile video · MobiCom 2011
Content delivery and video streaming › video delivery
mobile video
0.112011
A cross-layer design for scalable mobile video · MobiCom 2011
Internet architecture and protocols
network coding
0.112011
Network Coding Meets TCP: Theory and Implementation · Proc. IEEE 2011
Transport protocols and congestion control
TCP
0.112011
Network Coding Meets TCP: Theory and Implementation · Proc. IEEE 2011
Content delivery and video streaming
video multicast
0.112011
A cross-layer design for scalable mobile video · MobiCom 2011
Content delivery and video streaming › video transmission
analog video transmission
0.112010
SoftCast: one-size-fits-all wireless video · SIGCOMM 2010
Content delivery and video streaming
wireless video streaming
0.112010
SoftCast: one-size-fits-all wireless video · SIGCOMM 2010
Internet of things and sensor networks › iot networks
MAC and routing integration
0.112007
Trading structure for randomness in wireless opportunistic routing · SIGCOMM 2007
Routing and switching
opportunistic routing
0.112007
Trading structure for randomness in wireless opportunistic routing · SIGCOMM 2007
Multimedia systems and quality of experience
video quality assessment
0.012011
A cross-layer design for scalable mobile video · MobiCom 2011
Coding theory
network coding
0.012011
Network Coding Meets TCP: Theory and Implementation · Proc. IEEE 2011
Physical-layer communications › wireless channel
mobile radio channel
0.012010
SoftCast: one-size-fits-all wireless video · SIGCOMM 2010
Wireless networking
medium access control
0.012007
Trading structure for randomness in wireless opportunistic routing · SIGCOMM 2007
Wireless networking
spatial reuse
0.012007
Trading structure for randomness in wireless opportunistic routing · SIGCOMM 2007

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

softcast · 0.2simulation · 0.2random linear network coding · 0.2linear transform · 0.2softcast encoding · 0.1H.264/AVC · 0.1opportunistic routing protocol design · 0.1
YearPublicationVenuePosition
2011 A cross-layer design for scalable mobile video
abstract
Today's mobile video suffers from two limitations: 1) it cannot reduce bandwidth consumption by leveraging wireless broadcast to multicast popular content to interested receivers, and 2) it lacks robustness to wireless interference and errors. This paper presents SoftCast, a cross-layer design for mobile video that addresses both limitations. To do so, SoftCast changes the network stack to act like a linear transform. As a result, the transmitted video signal becomes linearly related to the pixels' luminance. Thus, when noise perturbs the transmitted signal samples, the perturbation naturally translates into approximation in the original video pixels. This enables a video source to multicast a single stream that each receiver decodes to a video quality commensurate with its channel quality. It also increases robustness to interference and errors which now reduce the sharpness of the received pixels but do not cause the video to glitch or stall. We have implemented SoftCast and evaluated it in a testbed of software radios. Our results show that it improves the average video quality for multicast users by 5.5dB, eliminates video glitches caused by mobility, and increases robustness to packet loss by an order of magnitude.
Szymon Jakubczak, Dina Katabi
MobiCom1
2011 Network Coding Meets TCP: Theory and Implementation
abstract
The theory of network coding promises significant benefits in network performance, especially in lossy networks and in multicast and multipath scenarios. To realize these benefits in practice, we need to understand how coding across packets interacts with the acknowledgment (ACK)-based flow control mechanism that forms a central part of today's Internet protocols such as transmission control protocol (TCP). Current approaches such as rateless codes and batch-based coding are not compatible with TCP's retransmission and sliding-window mechanisms. In this paper, we propose a new mechanism called TCP/NC that incorporates network coding into TCP with only minor changes to the protocol stack, thereby allowing incremental deployment. In our scheme, the source transmits random linear combinations of packets currently in the congestion window. At the heart of our scheme is a new interpretation of ACKs-the sink acknowledges every degree of freedom (i.e., a linear combination that reveals one unit of new information) even if it does not reveal an original packet immediately. Thus, our new TCP ACK rule takes into account the network coding operations in the lower layer and enables a TCP-compatible sliding-window approach to network coding. Coding essentially masks losses from the congestion control algorithm and allows TCP/NC to react smoothly to losses, resulting in a novel and effective approach for congestion control over lossy networks such as wireless networks. An important feature of our solution is that it allows intermediate nodes to perform re-encoding of packets, which is known to provide significant throughput gains in lossy networks and multicast scenarios. Simulations show that our scheme, with or without re-encoding inside the network, achieves much higher throughput compared to TCP over lossy wireless links. We present a real-world implementation of this protocol that addresses the practical aspects of incorporating network coding and decoding with TCP's window management mechanism. We work with TCP-Reno, which is a widespread and practical variant of TCP. Our implementation significantly advances the goal of designing a deployable, general, TCP-compatible protocol that provides the benefits of network coding.
Jay Kumar Sundararajan, Devavrat Shah, Muriel Médard, Szymon Jakubczak, Michael Mitzenmacher, João Barros
Proc. IEEE4
2010 SoftCast: one-size-fits-all wireless video
abstract
The focus of this demonstration is the performance of streaming video over the mobile wireless channel. We compare two schemes: the standard approach to video which transmits H.264/AVC-encoded stream over 802.11-like PHY, and SoftCast -- a clean-slate design for wireless video where the source transmits one video stream that each receiver decodes to a video quality commensurate with its specific instantaneous channel quality.
Szymon Jakubczak, Dina Katabi
SIGCOMM1
2009 One-Size-Fits-All Wireless Video
Szymon Jakubczak, Hariharan Rahul, Dina Katabi
HotNets1
2007 Trading structure for randomness in wireless opportunistic routing
abstract
Opportunistic routing is a recent technique that achieves high throughput in the face of lossy wireless links. The current opportunistic routing protocol, ExOR, ties the MAC with routing, imposing a strict schedule on routers' access to the medium. Although the scheduler delivers opportunistic gains, it misses some of the inherent features of the 802.11 MAC. For example, it prevents spatial reuse and thus may underutilize the wireless medium. It also eliminates the layering abstraction, making the protocol less amenable to extensions to alternate traffic types such as multicast.
Szymon Jakubczak, Michael Jennings, Sachin Katti, Dina Katabi
SIGCOMM1