Content Aware Network Based on Virtual Infrastructure

Bęben, Andrzej; Wiśniewski, P.; Krawiec, Piotr; Nowak, Mateusz; Pecka, Piotr; Batalla, Jordi Mongay; Białoń, Paweł; Olender, P.; Gutkowski, Jakub; Belter, Bartosz; Łopatowski, Ł.

doi:10.1109/snpd.2012.68

Cited by 9 publications

(3 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Then, segment requests generated by DASH client are translated to CCN interests, whereas responses from HTTP server are translated to CCN content objects. Although it is considered that CCN architecture, as well as other name-based approaches such as the ones presented in [29], can provide many benefits to IoT [25], the main drawback of the proposed solution is that CCN follows a clean slate design concept and operates on the new network stack, thus it is incompatible with the existing network infrastructure and its deployment requires building the network from scratch [5]. In turn, [36] presents DASH-based video platform for IoT, called WVSNP-DASH, that provides a specific naming syntax for video segments.…”

Section: Adaptive Streaming In Iot Scenariomentioning

confidence: 99%

DASCo: dynamic adaptive streaming over CoAP

Krawiec

Sosnowski

Batalla

et al. 2017

Multimed Tools Appl

View full text Add to dashboard Cite

This paper presents the Dynamic Adaptive Streaming over CoAP (DASCo), a solution for adaptive media streaming in the Internet of Things (IoT) environment. DASCo combines DASH (Dynamic Adaptive Streaming over HTTP), the widespread open standard for HTTP-compliant streaming, with Constrained Application Protocol (CoAP), the vendorindependent web transfer protocol designed for resource-constrained devices. The proposed solution uses DASH formats and mechanisms to make media segments available for consumers, and exploits CoAP to deliver media segments to consumers' applications. Consequently, the DASCo player offers native interoperability with IoT devices that are accessed via CoAP, thus it allows easy access to data collected by different sensors in order to enrich the multimedia services. In the paper we present an overview of constraints of default CoAP implementation with respect to media streaming, and propose guidelines for development of adaptive streaming service over CoAP. Moreover, we discuss the features of CoAP that can be investigated when designing an efficient adaptive algorithm for DASCo. Presented experimental results show poor performance of DASCo when default values of CoAP transmission parameters have been used. However, adjusting the parameters according to the network conditions considerably improves DASCo efficiency. Furthermore, in bad network conditions the enhanced DASCo is characterized by a more stable download rate compared to DASH. This feature is important in the context of dynamic media adaptation, since it allows an adaptation algorithm to better fit media bit rate with download conditions.

show abstract

Section: Adaptive Streaming In Iot Scenariomentioning

confidence: 99%

DASCo: dynamic adaptive streaming over CoAP

Krawiec

Sosnowski

Batalla

et al. 2017

Multimed Tools Appl

View full text Add to dashboard Cite

show abstract

“…Actually, the algorithm described in the paper comes from a management module in a virtualized network, as described later. The considered traffic pattern might be as well present in post-IP data-centric, or content-aware networks [2], data-intensive grid computing, cloud computing and multi-host data centers [23]. However, in most applications, an augmentation of the presented approach would be necessary to account for the respective structural specificity, for example for multicast, limited radio reach and energy constraints, scheduling of computations.…”

Section: Problemmentioning

confidence: 99%

A randomized rounding approach to a k-splittable multicommodity flow problem with lower path flow bounds affording solution quality guarantees

Białoń

2016

Telecommun Syst

View full text Add to dashboard Cite

In 2005, Baier et al. introduced a "k-splittable" variant of the multicommodity flow (MCF) problem in which a given commodity was allowed to flow through a number of paths limited by a small integer. This problem enables a better use of the link capacities than the classical Kleinberg's unsplittable MCF problem while not overloading the used devices and protocols with a large number of paths. We solve a minimum-congestion k-splittable MCF problem coming from a practice of managing an software-defined, circuit switching network. We introduce a lower bound for a path flow in order to model a QoS demand for a single connection running the path. Instead of reducing the problem to the unsplittable flow problem, as suggested by Baier et al., we propose a potentially more exact method. We directly enhance the Raghavan and Thompson's randomized rounding for ordinary MCF problems to account for k-splittability and the lower flow bounds. A mechanism is constructed that prevents rounding up low flows in the subproblem solution to big values. It is based on modifying the continuous subproblem by additionally penalizing flows of certain commodities in certain links. When k = 1, this allows us to prove a property similar to the O( √ log m) approximation factor, where m denotes the number of network links. We give probabilistic guarantees for the solution quality and examine the behavior of the method experimentally.

show abstract

“…One of the Parallel Internets running simultaneously in the IIP system is the CAN network [14]. It uses its own transmission protocols in its interior, however, the users and the content storing servers connect to the network via TCP/IP access networks.…”

Section: Problem Originmentioning

confidence: 99%

A Practical Approach to Traffic Engineering using an Unsplittable Multicommodity Flow Problem with QoS Constraints

Białoń

2016

JTIT

View full text Add to dashboard Cite

The paper presents a practical approach to calculating intra-domain paths within a domain of a content-aware network (CAN) that uses source routing. This approach was used in the prototype CAN constructed as a part of the Future Internet Engineering project outcome. The calculated paths must satisfy demands for capacity (capacity for a single connection and for aggregate connections using the given path are considered distinctly) and for a number of path-additive measures like delay, loss ratio. We state a suitable variant of QoS-aware unsplittable multicommodity ow problem and present the solving algorithm. The algorithm answers to the needs of its immediate application in the constructed system: a quick return within a short and fairly predictable time, simplicity and modiability, good behavior in the absence of a feasible solution (returning approximately-feasible solutions, showing how to modify demands to retain feasibility). On the other hand, a certain level of overdimensioning of the network is explored, unlike in a typical optimization algorithm. The algorithm is a mixture of: (i) shortest path techniques, (ii) simpli ed reference-level multicriteria techniques and parametric analysis applied to aggregate the QoS criteria (iii) penalty and mutation techniques to handle the common constraints. Numerical experiments assessing various aspects of the algorithm behavior are given.

show abstract

Content Aware Network Based on Virtual Infrastructure

Cited by 9 publications

References 6 publications

DASCo: dynamic adaptive streaming over CoAP

DASCo: dynamic adaptive streaming over CoAP

A randomized rounding approach to a k-splittable multicommodity flow problem with lower path flow bounds affording solution quality guarantees

A Practical Approach to Traffic Engineering using an Unsplittable Multicommodity Flow Problem with QoS Constraints

Contact Info

Product

Resources

About