Understanding user experience of mobile video: Framework, measurement, and optimization

Since users have become the focus of product/service design in last decade, the term User eXperience (UX) has been frequently used in the field of Human-Computer-Interaction (HCI). Research on UX facilitates a better understanding of the various aspects of the user’s interaction with the product or service. Mobile video, as a new and promising service and research field, has attracted great attention. Due to the significance of UX in the success of mobile video (Jordan, 2002), many researchers have centered on this area, examining users’ expectations, motivations, requirements, and usage context. As a result, many influencing factors have been explored (Buchinger, Kriglstein, Brandt & Hlavacs, 2011; Buchinger, Kriglstein & Hlavacs, 2009). However, a general framework for specific mobile video service is lacking for structuring such a great number of factors. To measure user experience of multimedia services such as mobile video, quality of experience (QoE) has recently become a prominent concept. In contrast to the traditionally used concept quality of service (QoS), QoE not only involves objectively measuring the delivered service but also takes into account user’s needs and desires when using the service, emphasizing the user’s overall acceptability on the service. Many QoE metrics are able to estimate the user perceived quality or acceptability of mobile video, but may be not enough accurate for the overall UX prediction due to the complexity of UX. Only a few frameworks of QoE have addressed more aspects of UX for mobile multimedia applications but need be transformed into practical measures. The challenge of optimizing UX remains adaptations to the resource constrains (e.g., network conditions, mobile device capabilities, and heterogeneous usage contexts) as well as meeting complicated user requirements (e.g., usage purposes and personal preferences). In this chapter, we investigate the existing important UX frameworks, compare their similarities and discuss some important features that fit in the mobile video service. Based on the previous research, we propose a simple UX framework for mobile video application by mapping a variety of influencing factors of UX upon a typical mobile video delivery system. Each component and its factors are explored with comprehensive literature reviews. The proposed framework may benefit in user-centred design of mobile video through taking a complete consideration of UX influences and in improvement of mobile videoservice quality by adjusting the values of certain factors to produce a positive user experience. It may also facilitate relative research in the way of locating important issues to study, clarifying research scopes, and setting up proper study procedures. We then review a great deal of research on UX measurement, including QoE metrics and QoE frameworks of mobile multimedia. Finally, we discuss how to achieve an optimal quality of user experience by focusing on the issues of various aspects of UX of mobile video. In the conclusion, we suggest some open issues for future study

Unsplittable Load Balancing in a Network of Charging Stations Under QoS Guarantees

The operation of the power grid is becoming more stressed, due to the addition of new large loads represented by Electric Vehicles (EVs) and a more intermittent supply due to the incorporation of renewable sources. As a consequence, the coordination and control of projected EV demand in a network of fast charging stations becomes a critical and challenging problem. In this paper, we introduce a game theoretic based decentralized control mechanism to alleviate negative impacts from the EV demand. The proposed mechanism takes into consideration the non-uniform spatial distribution of EVs that induces uneven power demand at each charging facility, and aims to: (i) avoid straining grid resources by offering price incentives so that customers accept being routed to less busy stations, (ii) maximize total revenue by serving more customers with the same amount of grid resources, and (iii) provide charging service to customers with a certain level of Quality-of-Service (QoS), the latter defined as the long term customer blocking probability. We examine three scenarios of increased complexity that gradually approximate real world settings. The obtained results show that the proposed framework leads to substantial performance improvements in terms of the aforementioned goals, when compared to current state of affairs.Comment: Accepted for Publication in IEEE Transactions on Smart Gri

Possible Collision Avoidance with Off-line Route Selection

The paper describes the traffic flow problems in telecommunication networks based on the Internet protocol. The main aim of telecommunication network operator today is to offer an SLA (Service Level Agreement) contract to end users, with provided QoS (Quality of Service) for different classes of services. In order to achieve this, it is necessary to establish the routes between marginal network nodes meeting the network traffic requirements and optimizing the network performances free of simultaneous flows conflicts. In DiffServ/MPLS (Multi-Protocol Label Switching) networks traffic flows traverse the network simultaneously and there may come to collision of concurrent flows. They are distributed among LSPs (Labeled Switching Paths) related to service classes. In LSP creation the IGP (Interior Gateway Protocol) uses simple on-line routing algorithms based on the shortest path methodology. In highly loaded networks this becomes an insufficient technique. In this suggested approach LSP need not necessarily be the shortest path solution. It can be pre-computed much earlier, possibly during the SLA negotiation process. In that sense an effective algorithm for collision control is developed. It may find a longer but lightly loaded path, taking care of the collision possibility. It could be a very good solution for collision avoidance and for better load-balancing purpose where links are running close to capacity. The algorithm can be significantly improved through heuristic approach. Heuristic options are compared in test-examples and their application for collision control is explained. KEYWORDS: Telecommunication networks, collision avoidance, multi-constraint route selection, self-organizing systems, MPLS, Qo

An Efficient Algorithm for Congestion Control in Highly Loaded DiffServ/MPLS Networks

Optimal QoS path provisioning of coexisted and aggregated traffic in networks is still demanding problem. All traffic flows in a domain are distributed among LSPs (Label Switching Path) related to N service classes, but the congestion problem of concurrent flows can appear. As we know the IGP (Interior Getaway Protocol) uses simple on-line routing algorithms (e.g. OSPFS, IS-IS) based on shortest path methodology. In QoS end-to-end provisioning where some links may be reserved for certain traffic classes (for particular set of users) it becomes insufficient technique. On other hand, constraint-based explicit routing (CR) based on IGP metric ensures traffic engineering (TE) capabilities. But in overloaded and poorly connected MPLS/DiffServ networks the CR becomes insufficient technique. As we need firm correlation with bandwidth management and traffic engineering (TE) the initial (pro-active) routing can be pre-computed in the context of all priority traffic flows (former contracted SLAs) traversing the network simultaneously. It mean that LSP can be pre-computed much earlier, possibly during SLA (Service Level Agreement) negotiation process. In the paper a new load simulation technique for load balancing control purpose is proposed. The algorithm proposed in the paper may find a longer but lightly loaded path, better than the heavily loaded shortest path. It could be a very good solution for congestion avoidance and for better load-balancing purpose where links are running close to capacity. Also, such technique could be useful in inter-domain end-to-end provisioning, where bandwidth reservation has to be negotiated with neighbor ASes (Autonomous System). To be acceptable for real applications such complicated routing algorithm can be significantly improved. Algorithm was tested on the network of M core routers on the path (between edge routers) and results are given for N=3 service classes. Further improvements through heuristic approach are made and results are discussed

Bolja spektralna iskoristivost linka za višestruke kapacitete koji pokazuju prometnu međuovisnost

Network providers need very effective optimization tool for good utilization of scarce link capacities during exploitation. In the case of multiple link capacities with mutual traffic correlation such problem could be more demanding. The sizing problem is explained for satellite link, but it could be applicable for other transmission resources. Dimensioning of getaway link (G-link) can be realized only by new constructions (new channel equipment) on the Earth side. Mathematical model for optimal capacity sizing of N different link elements (capacity types) is explained, minimizing the total cost (expansion, conversion and maintenance). Instead of nonlinear convex optimization technique, that could be very exhausting, the network optimization method is applied. With such approach an efficient heuristic algorithm for three different capacity types is being developed. Through numerical test-examples this approach shows the significant complexity savings, but giving us very close to optimal result. However, in real circumstances some adding limitations on capacity state values have to be introduced. In comparison to other options it is obvious that heuristic option M_H (with only one negative value per capacity state) shows the best ratio between complexity reduction and result deterioration.Mrežni operateri nužno trebaju vrlo efikasan optimizacijski alat za učinkovito iskorištenje oskudnih kapaciteta na prijenosnim linkovima kroz određeno eksploatacijsko razdoblje. U slučaju višestrukih kapaciteta, a koji pokazuju prometnu međuovisnost, takav problem postaje još složeniji. Članak se koncentrira na probleme satelitskog linka, ali je primjenjiv i za neke druge prijenosne kapacitete. Proširenje G-linka može se ostvariti samo uvođenjem nove kanalske opreme na Zemlji. U radu je prikazan matematički model za optimalno dimenzioniranje linka sa N različitih kapacitivnih elemenata, s ciljem minimiziranja troškova ekspanzije, konverzije i održavanja kanalske opreme. Umjesto nelinearnog konveksnog programiranja, a koje može biti vrlo iscrpljujuće, primjenjuje se metoda mrežne optimizacije. Potom je razvijen i testiran heuristički algoritam za tri vrste kapaciteta. Algoritam pokazuje visoku učinkovitost, a nerijetko postiže i najbolji mogući rezultat, pri čemu se značajno smanjuje složenost. Ipak u realnim uvjetima uvode se dodatna ograničenja na vrijednosti kapacitivnih točaka, pa govorimo o algoritamskim varijantama. Algoritamska varijanta M_H (samo jedna negativna vrijednost po kapacitivnoj točki) pokazuje najbolji odnos između kompleksnosti algoritma i odstupanja od najboljeg mogućeg rezultata, odnosno pogrješke