arXiv subjects

Jussi Kangasharju

Publications and source records attributed to Jussi Kangasharju.

At least 19 recordsLinked to original sources

arXiv2024

A Survey on Generative AI and LLM for Video Generation, Understanding, and Streaming

This paper offers an insightful examination of how currently top-trending AI technologies, i.e., generative artificial intelligence (Generative AI) and large language models (LLMs), are reshaping the field of video technology, including video generation, understanding, and streaming. It highlights the innovative use of these technologies in producing highly realistic videos, a significant leap in bridging the gap between real-world dynamics and digital creation. The study also delves into the advanced capabilities of LLMs in video understanding, demonstrating their effectiveness in extracting meaningful information from visual content, thereby enhancing our interaction with videos. In the realm of video streaming, the paper discusses how LLMs contribute to more efficient and user-centric streaming experiences, adapting content delivery to individual viewer preferences. This comprehensive review navigates through the current achievements, ongoing challenges, and future possibilities of applying Generative AI and LLMs to video-related tasks, underscoring the immense potential these technologies hold for advancing the field of video technology related to multimedia, networking, and AI communities.

cs.CV↗

arXiv2023

5G MEC Computation Handoff for Mobile Augmented Reality

The combination of 5G and Multi-access Edge Computing (MEC) can significantly reduce application delay by lowering transmission delay and bringing computational capabilities closer to the end user. Therefore, 5G MEC could enable excellent user experience in applications like Mobile Augmented Reality (MAR), which are computation-intensive, and delay and jitter-sensitive. However, existing 5G handoff algorithms often do not consider the computational load of MEC servers, are too complex for real-time execution, or do not integrate easily with the standard protocol stack. Thus they can impair the performance of 5G MEC. To address this gap, we propose Comp-HO, a handoff algorithm that finds a local solution to the joint problem of optimizing signal strength and computational load. Additionally, Comp-HO can easily be integrated into current LTE and 5G base stations thanks to its simplicity and standard-friendly deployability. Specifically, we evaluate Comp-HO through a custom NS-3 simulator which we calibrate via MAR prototype measurements from a real-world 5G testbed. We simulate both Comp-HO and several classic handoff algorithms. The results show that, even without a global optimum, the proposed algorithm still significantly reduces the number of large delays, caused by congestion at MECs, at the expense of a small increase in transmission delay.

cs.NI↗

arXiv2022

Perspectives on Negative Research Results in Pervasive Computing

Not all research leads to fruitful results; trying new ways or methods may surpass the state of the art, but sometimes the hypothesis is not proven or the improvement is insignificant. In a systems discipline like pervasive computing, there are many sources of errors, from hardware issues over communication channels to heterogeneous software environments. However, failure to succeed is not a failure to progress. It is essential to create platforms for sharing insights, experiences, and lessons learned when conducting research in pervasive computing so that the same mistakes are not repeated. And sometimes, a problem is a symptom of discovering new research challenges. Based on the collective input of the First International Workshop on Negative Results in Pervasive Computing (PerFail 2022), co-located with the 20th International Conference on Pervasive Computing and Communications (PerCom 2022), this paper presents a comprehensive discussion on perspectives on publishing negative results and lessons learned in pervasive computing.

cs.DC↗

arXiv2022

AICP: Augmented Informative Cooperative Perception

Connected vehicles, whether equipped with advanced driver-assistance systems or fully autonomous, require human driver supervision and are currently constrained to visual information in their line-of-sight. A cooperative perception system among vehicles increases their situational awareness by extending their perception range. Existing solutions focus on improving perspective transformation and fast information collection. However, such solutions fail to filter out large amounts of less relevant data and thus impose significant network and computation load. Moreover, presenting all this less relevant data can overwhelm the driver and thus actually hinder them. To address such issues, we present Augmented Informative Cooperative Perception (AICP), the first fast-filtering system which optimizes the informativeness of shared data at vehicles to improve the fused presentation. To this end, an informativeness maximization problem is presented for vehicles to select a subset of data to display to their drivers. Specifically, we propose (i) a dedicated system design with custom data structure and lightweight routing protocol for convenient data encapsulation, fast interpretation and transmission, and (ii) a comprehensive problem formulation and efficient fitness-based sorting algorithm to select the most valuable data to display at the application layer. We implement a proof-of-concept prototype of AICP with a bandwidth-hungry, latency-constrained real-life augmented reality application. The prototype adds only 12.6 milliseconds of latency to a current informativeness-unaware system. Next, we test the networking performance of AICP at scale and show that ACIP effectively filters out less relevant packets and decreases the channel busy time.

cs.MM↗

arXiv2021

DRLE: Decentralized Reinforcement Learning at the Edge for Traffic Light Control in the IoV

The Internet of Vehicles (IoV) enables real-time data exchange among vehicles and roadside units and thus provides a promising solution to alleviate traffic jams in the urban area. Meanwhile, better traffic management via efficient traffic light control can benefit the IoV as well by enabling a better communication environment and decreasing the network load. As such, IoV and efficient traffic light control can formulate a virtuous cycle. Edge computing, an emerging technology to provide low-latency computation capabilities at the edge of the network, can further improve the performance of this cycle. However, while the collected information is valuable, an efficient solution for better utilization and faster feedback has yet to be developed for edge-empowered IoV. To this end, we propose a Decentralized Reinforcement Learning at the Edge for traffic light control in the IoV (DRLE). DRLE exploits the ubiquity of the IoV to accelerate the collection of traffic data and its interpretation towards alleviating congestion and providing better traffic light control. DRLE operates within the coverage of the edge servers and uses aggregated data from neighboring edge servers to provide city-scale traffic light control. DRLE decomposes the highly complex problem of large area control. into a decentralized multi-agent problem. We prove its global optima with concrete mathematical reasoning. The proposed decentralized reinforcement learning algorithm running at each edge node adapts the traffic lights in real time. We conduct extensive evaluations and demonstrate the superiority of this approach over several state-of-the-art algorithms.

cs.MA↗

arXiv2019

Is two greater than one?: Analyzing Multipath TCP over Dual-LTE in the Wild

Multipath TCP (MPTCP) is a standardized TCP extension which allows end-hosts to simultaneously exploit all of their network interfaces. The recent proliferation of dual-SIM mobile phones makes multi-LTE MPTCP setup an attractive option. We perform extensive measurements of MPTCP over two LTE connections in low and high-speed mobility scenarios over five months, both in controlled and in-the-wild environments. Our findings indicate that MPTCP performance decreases at high speeds due to increased frequency of signal strength drops and handovers. Both LTE paths experience frequent changes which result in a sub-optimal subflow utilization. We also find that while path changes are unpredictable, their impact on MPTCP follows a deterministic trend. Finally, we show that both application traffic patterns and congestion control variants impact MPTCP adaptability at high speeds.

cs.NI↗

arXiv2018

QAware: A Cross-Layer Approach to MPTCP Scheduling

Multipath TCP (MPTCP) allows applications to transparently use all available network interfaces by creating a TCP subflow per interface. One critical component of MPTCP is the scheduler that decides which subflow to use for each packet. Existing schedulers typically use estimates of end-to-end path properties, such as delay and bandwidth, for making the scheduling decisions. In this paper, we show that these scheduling decisions can be significantly improved by incorporating readily available local information from the device driver queues in the decision-making process. We propose QAware, a novel cross-layer approach for MPTCP scheduling. QAware combines end-to-end delay estimates with local queue buffer occupancy information and allows for a better and faster adaptation to the network conditions. This results in more efficient use of the available resources and considerable gains in aggregate throughput. We present the design of QAware and evaluate its performance through simulations, and also through real experiments, comparing it to existing schedulers. Our results show that QAware performs significantly better than other available approaches for various use-cases and applications.

cs.NI↗

arXiv2018

eDisco: Discovering Edge Nodes Along the Path

Edge computing is seen as an enabler for upcoming applications requiring low latency offloading, such as augmented reality, and as a key building block for Internet of Things. Edge computing extends the centralized cloud computing model by distributing servers also close to the users, at the edge of the network. A key challenge for the clients remains on how to discover the nearby edge servers and how to access them. In this paper, we present eDisco, DNS-based edge discovery, that leverages existing protocols and requires no modifications to deployed infrastructure. eDisco enables service providers and clients to discover edge servers, and determine the optimal edge deployment configuration.

cs.NI↗

arXiv2017

More Than The Sum Of Its Parts: Exploiting Cross-Layer and Joint-Flow Information in MPTCP

Multipath TCP (MPTCP) is an extension to TCP which aggregates multiple parallel connections over available network interfaces. MPTCP bases its scheduling decisions on the individual RTT values observed at the subflows, but does not attempt to perform any kind of joint optimization over the subflows. Using the MPTCP scheduler as an example, in this paper we demonstrate that exploiting cross-layer information and optimizing scheduling decisions jointly over the multiple flows, can lead to significant performance gains. While our results only represent a single data point, they illustrate the need to look at MPTCP from a more holistic point of view and not treat the connections separately, as is currently being done. We call for new approaches and research into how multiple parallel connections offered by MPTCP should be used in an efficient and fair manner.

cs.NI↗

arXiv2017

FairCache: Introducing Fairness to ICN Caching - Technical Report

Information-centric networking extensively uses universal in-network caching. However, developing an efficient and fair collaborative caching algorithm for selfish caches is still an open question. In addition, the communication overhead induced by collaboration is especially poorly understood in a general network setting such as realistic ISP and Autonomous System networks. In this paper, we address these two problems by modeling the in-network caching problem as a Nash bargaining game. We show that the game is a convex optimization problem and further derive the corresponding distributed algorithm. We analytically investigate the collaboration overhead on general graph topologies, and theoretically show that collaboration has to be constrained within a small neighborhood due to its cost growing exponentially. Our proposed algorithm achieves at least 16% performance gain over its competitors on different network topologies in the evaluation, and guarantees provable convergence, Pareto efficiency and proportional fairness.

cs.NI↗

arXiv2017

Edge-Fog Cloud: A Distributed Cloud for Internet of Things Computations

Internet of Things typically involves a significant number of smart sensors sensing information from the environment and sharing it to a cloud service for processing. Various architectural abstractions, such as Fog and Edge computing, have been proposed to localize some of the processing near the sensors and away from the central cloud servers. In this paper, we propose Edge-Fog Cloud which distributes task processing on the participating cloud resources in the network. We develop the Least Processing Cost First (LPCF) method for assigning the processing tasks to nodes which provide the optimal processing time and near optimal networking costs. We evaluate LPCF in a variety of scenarios and demonstrate its effectiveness in finding the processing task assignments.

cs.DC↗

arXiv2016

You Really Need A Good Ruler to Measure Caching Performance in Information-Centric Networks

Information-centric networks are an interesting new paradigm for distributing content on the Internet. They bring up many research challenges, such as addressing content by name, securing content, and wide-spread caching of content. Caching has caught a lot of attention in the research community, but a lot of the work suffers from a poor understanding of the different metrics with which caching performance can be measured. In this paper we not only present a comprehensive overview of different caching metrics that have been proposed for information-centric networks, but also propose the coupling factor as a new metric to capture the relation- ship between content popularity and network topology. As we show, many commonly used metrics have several failure modes which are largely ignored in literature. We identify these problems and propose remedies and new metrics to address these failures. Our work highlights the fundamental differences between information-centric caches and "traditional" cache networks and we demonstrate the need for a systematic understanding of the metrics for information- centric caching. We also discuss how experimental work should be done when evaluating networks of caches.

cs.NI↗

arXiv2015

Two Hops or More: On Hop-Limited Search in Opportunistic Networks

While there is a drastic shift from host-centric networking to content-centric networking, how to locate and retrieve the relevant content efficiently, especially in a mobile network, is still an open question. Mobile devices host increasing volume of data which could be shared with the nearby nodes in a multi-hop fashion. However, searching for content in this resource-restricted setting is not trivial due to the lack of a content index, as well as, desire for keeping the search cost low. In this paper, we analyze a lightweight search scheme, hop-limited search, that forwards the search messages only till a maximum number of hops, and requires no prior knowledge about the network. We highlight the effect of the hop limit on both search performance (i.e., success ratio and delay) and associated cost along with the interplay between content availability, tolerated waiting time, network density, and mobility. Our analysis, using the real mobility traces, as well as synthetic models, shows that the most substantial benefit is achieved at the first few hops and that after several hops the extra gain diminishes as a function of content availability and tolerated delay. We also observe that the return path taken by a response is on average longer than the forward path of the query and that the search cost increases only marginally after several hops due to the small network diameter.

cs.NI↗

arXiv2014

Renewable Energy-Aware Information-Centric Networking

The ICT industry today is placed as one of the major consumers of energy, where recent reports have also shown that the industry is a major contributor to global carbon emissions. While renewable energy-aware data centers have been proposed, these solutions have certain limitations. The primary limitation is due to the design of data centers which focus on large-size facilities located in selected locations. This paper addresses this problem, by utilizing in-network caching with each router having storage and being powered by renewable energy sources (wind and solar). Besides placing contents closer to end users, utilizing in-network caching could potentially increase probability of capturing renewable energy in diverse geographical locations. Our proposed solution is dual- layered: on the first layer a distributed gradient-based routing protocol is used to discover the paths along routers that are powered by the highest renewable energy, and on the second layer, a caching mechanism will pull the contents from the data centre and place them on routers of the paths that are discovered by our routing protocol. Through our experiments on a testbed utilizing real meteorological data, our proposed solution has demonstrated increased quantity of renewable energy consumption, while reducing the workload on the data centers.

cs.NI↗

arXiv2014

Inference on the Network Evolution in BitTorrent Mainline DHT

Network size is a fundamental statistic for a peer-to-peer system but is generally considered to contain too little information to be useful. However, most existing work only considers the metric by itself and does not explore what features could be extracted from this seem- ingly trivial metric. In this paper, we show that Fourier transform allows us to extract frequency features from such time series data, which can further be used to characterize user behaviors and detect system anoma- lies in a peer-to-peer system automatically without needing to resort to visual comparisons. By using the proposed algorithm, our system suc- cessfully discovers and clusters countries of similar user behavior and captures the anomalies like Sybil attacks and other real-world events with high accuracy. Our work in this paper highlights the usefulness of more advanced time series processing techniques in analyzing network measurements.

cs.NI↗

arXiv2013

Effects of Cooperation Policy and Network Topology on Performance of In-Network Caching

We model the cooperation policy with only two parameters -- search radius $r$ and number of copies in the network $N_{copy}$. These two parameters represent the range of cooperation and tolerance of duplicates. We show how cooperation policy impacts content distribution, and further illustrate the relation between content popularity and topological properties. Our work leads many implications on how to take advantage of topological properties in in-network caching strategy design.

cs.NI↗

arXiv2013

In-Network Caching vs. Redundancy Elimination

Network-level Redundancy Elimination (RE) techniques have been proposed to reduce the amount of traffic in the Internet. and the costs of the WAN access in the Internet. RE middleboxes are usually placed in the network access gateways and strip off the repeated data from the packets. More recently, generic network-level caching architectures have been proposed as alternative to reduce the redundant data traffic in the network, presenting benefits and drawbacks compared to RE. In this paper, we compare a generic in-network caching architecture against state-of-the-art redundancy elimination (RE) solutions on real network topologies, presenting the advantages of each technique. Our results show that in-network caching architectures outperform state-of-the-art RE solutions across a wide range of traffic characteristics and parameters.

cs.NI↗

arXiv2013

LiteLab: Efficient Large-scale Network Experiments

Large-scale network experiments is a challenging problem. Simulations, emulations, and real-world testbeds all have their advantages and disadvantages. In this paper we present LiteLab, a light-weight platform specialized for large-scale networking experiments. We cover in detail its design, key features, and architecture. We also perform an extensive evaluation of LiteLab's performance and accuracy and show that it is able to both simulate network parameters with high accuracy, and also able to scale up to very large networks. LiteLab is flexible, easy to deploy, and allows researchers to perform large-scale network experiments with a short development cycle. We have used LiteLab for many different kinds of network experiments and are planning to make it available for others to use as well.

cs.DC↗