Andrzej Bęben

Dr. Andrzej Bęben


Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 March 2011 in IEEE Communications Magazine
Verified
Journal Article
Closed access
WCWei Koong Chai
Wei Koong Chai
NWNing Wang
Ning Wang
IPIoannis Psaras
Ioannis Psaras
GPGeorge Pavlou
George Pavlou
CWChaojiong Wang
Chaojiong Wang
EHEleftheria Hadjioannou
Eleftheria Hadjioannou
CURLING, a Content-Ubiquitous Resolution and Delivery Infrastructure for Next Generation Services, aims to enable a future content-centric Internet that will overcome the current intrinsic constraints by efficiently diffusing media content of massive scale. It entails a holistic approach, supporting content manipulation capabilities that encompass the entire content life cycle, from content publication to content resolution and, finally, to content delivery. CURLING provides to both content providers and customers high flexibility in expressing their location preferences when publishing and requesting content, respectively, thanks to the proposed scoping and filtering functions. Content manipulation operations can be driven by a variety of factors, including business relationships between ISPs, local ISP policies, and specific content provider and customer preferences. Content resolution is also natively coupled with optimized content routing techniques that enable efficient unicast and multicast- based content delivery across the global Internet.

10 May 2016
Verified
Conference Paper
Open access
Andrzej BębenAndrzej Bęben
Andrzej Bęben
PWP. Wiśniewski
P. Wiśniewski
JBJordi Mongay Batalla
Jordi Mongay Batalla
PKP. Krawiec
P. Krawiec
Currently exploited adaptive video streaming algorithms mainly focus on maximizing video representation while they usually not assess the risk of video freezing and not care about the influence of video representation switching. We propose a new Adaptation & Buffer Management Algorithm, called ABMA+, which selects video representation based on the predicted probability of video freezing. The algorithm continuously estimates segment download time characteristics and use the pre-computed playout buffer map to select the maximum video representation which guarantee smooth content playout. Our algorithm, thanks to the buffer map, avoids heavy online computation so it could be widely deployed on different terminals. The performed simulation and trial experiments confirm the efficiency of our approach.

20 February 2007 in IEEE Communications Magazine
Verified
Journal Article
Open access
XMXavi Masip-Bruin
Xavi Masip-Bruin
MYMarcelo Yannuzzi
Marcelo Yannuzzi
RSRene Serral-Gracia
Rene Serral-Gracia
JDJordi Domingo-Pascual
Jordi Domingo-Pascual
JEJose Enriquez-Gabeiras
Jose Enriquez-Gabeiras
LCLuís Cordeiro
Luís Cordeiro
EuQoS is the acronym for "end-to-end quality of service support over heterogeneous networks", which is a European research project aimed at building an entire QoS framework, addressing all the relevant network layers, protocols, and technologies. This framework, which includes the most common access networks (xDSL, UMTS, WiFi, and LAN) is being prototyped and tested in a multidomain scenario throughout Europe, composing what we call the EuQoS system. In this article we present the novel QoS routing mechanisms that are being developed and evaluated in the framework of this project. The preliminary performance results validate the design choices of the EuQoS system, and confirm the potential impact this project is likely to have in the near future

27 July 2009 in Computer Communications
Verified
Journal Article
Closed access
EME. Mingozzi
E. Mingozzi
Giovanni SteaGiovanni Stea
Giovanni Stea
MCM.A. Callejo-Rodríguez
M.A. Callejo-Rodríguez
JEJ. Enríquez-Gabeiras
J. Enríquez-Gabeiras
GGG. García-De-Blas
G. García-De-Blas
EME. Monteiro
E. Monteiro

6 June 2016 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
JBJordi Mongay Batalla
Jordi Mongay Batalla
PKPiotr Krawiec
Piotr Krawiec
Andrzej BębenAndrzej Bęben
Andrzej Bęben
PWPiotr Wisniewski
Piotr Wisniewski
ACAndrzej Chydzinski
Andrzej Chydzinski
New trends of the future Internet aim to overcome the best effort service and offer guaranteed service to the users. Guarantees should be acquired not only at the network level but also at higher layers in order to deliver the best quality of experience. This paper presents a new approach for HTTP-compliant adaptive applications. This solution fulfills the guarantees of maximum rebuffering probability even in highly variable environments as the future Internet seems to be. Guaranteed low rebuffering improves visibly the user's quality of experience during multimedia events. The tests performed confirmed that, unlike rate-based adaptation algorithms, our solution ensures maximum rebuffering and it decisively reduces rate switches in comparison with buffer-based adaptation algorithms.

29 August 2012 in Annals of Telecommunications
Verified
Journal Article
Open access
PDF file
Andrzej BębenAndrzej Bęben
Andrzej Bęben
JBJordi Mongay Batalla
Jordi Mongay Batalla
WCWei Koong Chai
Wei Koong Chai
JŚJarosław Śliwiński
Jarosław Śliwiński
Today’s Internet is prominently used for content distribution. Various platforms such as content delivery networks (CDNs) have become an integral part of the digital content ecosystem. Most recently, the information-centric networking (ICN) paradigm proposes the adoption of native content naming for secure and efficient content delivery. This further enhances the flexibility of content access where a content request can be served by any source within the Internet. In this paper, we propose and evaluate a multi-criteria decision algorithm for efficient content delivery applicable for content networks in general (among others, CDN and ICN). Our algorithm computes the best available source and path for serving content requests taking into account information about content transfer requirements, location of the consumer, location of available content servers, content server load and content delivery paths between content servers and consumer. The proposed algorithm exploits two closely related processes. The first level discovers multiple content delivery paths and gathers their respective transfer characteristics. This discovery process is based on long-term network measurements and performed offline. The second process is invoked for each content request to find the best combined content server and delivery path. The cooperation between both levels allows our algorithm to increase the number of satisfied content requests thanks to efficient utilisation of network and server resources. The proposed decision algorithm was evaluated by simulation using Internet scale network model. The results confirm the effectiveness gain of content network architectures that introduce network awareness. Moreover, the simulation process allows for a comparison between different routing algorithms and, especially, between single and multipath routing algorithms.