Tatiana Polishchuk

dblp:40/10923 · DBLP profile ↗
← Back
7ranked-venue papers
1as first author
1since 2021 · last 2025
0000-0002-9869-5992ORCID · corroborated

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

Computer networks · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2Theory of computation · 2 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1
YearPublicationVenuePosition
2025 On Two Simple[st] Learning Tasks
Omrit Filtser, Kien C. Huynh, Anastasia Lemetti, Joseph S. B. Mitchell, Tatiana Polishchuk, Valentin Polishchuk
CIAC (1)5
2017 Optimized Adaptive Streaming of Multi-video Stream Bundles
abstract
In contrast to traditional video, multi-view video streaming allows viewers to interactively switch among multiple perspectives provided by different cameras. One approach to achieve such a service is to encode the video from all of the cameras into a single stream, but this has the disadvantage that only a portion of the received video data will be used, namely that required for the selected view at each point in time. In this paper, we introduce the concept of a “multi-video stream bundle” that consists of multiple parallel video streams that are synchronized in time, each providing the video from a different camera capturing the same event or movie. For delivery we leverage the adaptive features and time-based chunking of HTTP-based adaptive streaming, but now employing adaptation in both content and rate. Users are able to change their viewpoint on-demand and the client player adapts the rate at which data are retrieved from each stream based on the user's current view, the probabilities of switching to other views, and the user's current bandwidth conditions. A crucial component of such a system is the prefetching policy. For this we present an optimization model as well as a simpler heuristic that can balance the playback quality and the probability of playback interruptions. After analytically and numerically characterizing the optimal solution, we present a prototype implementation and sample results. Our prefetching and buffer management solution is shown to provide close to seamless playback switching when there is sufficient bandwidth to prefetch the parallel streams.
Niklas Carlsson, Derek L. Eager, Vengatanathan Krishnamoorthi, Tatiana Polishchuk
IEEE Trans. Multim.4
2016 Automatic Design of Aircraft Arrival Routes with Limited Turning Angle
abstract
We present an application of Integer Programming to the design of arrival routes for aircraft in a Terminal Maneuvering Area (TMA). We generate operationally feasible merge trees of curvature-constrained routes, using two optimization criteria: (1) total length of the tree, and (2) distance flown along the tree paths. The output routes guarantee that the overall traffic pattern in the TMA can be monitored by air traffic controllers; in particular, we keep merge points for arriving aircraft well separated, and we exclude conflicts between arriving and departing aircraft. We demonstrate the feasibility of our method by experimenting with arrival routes for a runway at Arlanda airport in the Stockholm TMA. Our approach can easily be extended in several ways, e.g., to ensure that the routes avoid no-fly zones.
Tobias Andersson Granberg, Tatiana Polishchuk, Valentin Polishchuk, Christiane Schmidt 0001
ATMOS2
2015 isBF: Scalable in-packet bloom filter based multicast
Ilya Nikolaevskiy, Andrey Lukyanenko, Tatiana Polishchuk, Valentin Polishchuk, Andrei V. Gurtov
Comput. Commun.3
2012 Mediating Multimedia Traffic with Strict Delivery Constraints
abstract
Internet multimedia traffic currently occupies more than half of the total Internet traffic and it continues to expand tremendously. Targeting to meet strict constraints imposed by the requirements of real-time multimedia applications appropriate error-correction techniques should be implemented within the data dissemination network. We propose to introduce multipurpose relay nodes called Mediators into several positions within the tree networks typical for multicasting and broadcasting scenarios. By utilizing the error-correction domain separation paradigm in combination with selective insertion of the supplementary data from parallel networks, when the corresponding content is available, the proposed mechanism reduces the total network load and improves scalability of multicast/broadcast transmission. We share our view on how the existing application frameworks could benefit from the incremental deployment of the proposed mechanism. Experimental results confirm suitability and applicability of our assumptions.
Michael Karl 0002, Tatiana Polishchuk, Thorsten Herfet, Andrei V. Gurtov
ISM2
2012 Scalable architecture for multimedia multicast Internet applications
abstract
We propose a scalable multicast architecture for potentially large overlay networks. Our techniques address suboptimality of the adaptive hybrid error correction (AHEC) scheme in the multicast scenarios. A hierarchical multi-stage multicast tree topology is constructed in order to improve performance of AHEC and guarantee QoS for the multicast clients. The multicast tree is divided into subtrees, called regions. Every region is assigned a control node, which serves the individual redundancy and retransmission requirements of the receivers within the region. Region sizes are bounded by the maximum cost per region, which defines the ability of the control nodes to serve the receivers of the assigned regions. We show that the multistage multicast architecture significantly reduces the amount of redundancy information introduced into the network and brings it closer to the Shannon bound.
Tatiana Polishchuk, Michael Karl 0002, Thorsten Herfet, Andrei V. Gurtov
WOWMOM1
2009 Secure multipath transport for legacy Internet applications
abstract
Multi-interface mobile devices and multihomed residential Internet connections are becoming commonplace. However, standard transport protocols TCP and SCTP are unable to take advantage of several available paths so that the application using a single transport connection would receive the aggregate
Andrei V. Gurtov, Tatiana Polishchuk
BROADNETS2