SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Bianzino Aruna Prem) "

Sökning: WFRF:(Bianzino Aruna Prem)

  • Resultat 1-4 av 4
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Bianzino, Aruna Prem, et al. (författare)
  • Cooperative proxies: Optimally trading energy and quality of service in mobile devices
  • 2014
  • Ingår i: Computer Networks. - : Elsevier. - 1389-1286 .- 1872-7069. ; 75:Part A, s. 297-312
  • Tidskriftsartikel (refereegranskat)abstract
    • This work studies the energy and quality of service (QoS) trade-off in the context of mobile devices with two communication interfaces (a high energy and a low energy interface). We propose an optimisation scheme during underload scenarios where proxy groups are dynamically formed exploiting both interfaces. The scheme integrates a reward mechanism that compensates a proxy while carrying other group members’ traffic, and deals with churn (joining and leaving of nodes) in a cell area. For traffic flows that approximate knowledge about current services we show that the scheme can achieve energy savings of 60% for all mobile nodes as whole. We also demonstrate the impact on disruption-sensitive flows as a function of the traffic mix, and that the use of rewards for selection of proxies is a fair mechanism in the long term.
  •  
2.
  • Bianzino, Aruna Prem, et al. (författare)
  • The Green-Game: Accounting for Device Criticality in Resource Consolidation for Backbone IP Networks
  • 2014
  • Ingår i: Strategic Behavior and the Environment. - : Now Publishers Inc.. - 1944-012X .- 1944-0138. ; 4:2, s. 131-153
  • Tidskriftsartikel (refereegranskat)abstract
    • The reduction of the energy expenditure of communication networks rep- resents a key issue for the research community. A promising technique acting in this direction is known as “resource consolidation”. It consists in concen- trating the workload of an infrastructure on a reduced set of devices, while switching off the others. Deciding on the set of devices that can be safely switched off requires an accurate evaluation of their criticality in the net- work. We define here a measure of criticality that takes into account the network topology, but also the traffic, and different possible network config- urations. We model the scenario as a coalitional game. Shapley value ranking is efficiently used to drive the resource consolidation procedure. Numerical results, on real network scenarios, confirm the robustness and relevance of the proposed index in measuring criticality, yielding a good tradeoff between energy efficiency and network robustness, and outperforming other classical indexes. 
  •  
3.
  • Ciarrocchi, Marcos, et al. (författare)
  • Energy-Aware Weight Assignment Framework for Circuit Oriented GMPLS Networks
  • 2013
  • Konferensbidrag (refereegranskat)abstract
    •  branch of green networking research is consoli- dating. It aims at routing traffic with the goal of reducing the network energy consumption. It is usually referred to as Energy- Aware Routing. Previous works in this branch only focused on pure IP networks, e.g., assuming an Open Shortest Path First (OSPF) control plane, and best effort packet forwarding on the data plane. In this work, we consider instead Generalized Multi- Protocol Label Switching (GMPLS) backbone networks, where optical technologies allow to design “circuit switching” network management policies with strict bandwidth reservation policies.We define a simple and generic framework which generates a family of routing algorithms, based on an energy-aware weight assignment. In particular, routing weights are functions of both the energy consumption and the actual load of network devices. Using such weights, a simple minimum-cost routing allows finding the current least expensive circuit, minimising the additional energy cost. Results obtained on realistic case studies show that our weight assignment policy favours a consistent reduction of the network power consumption, without significantly affecting the network performance. Furthermore, the framework allows to trade energy efficiently and network performance, a desirable property at which ISPs are looking for. Simple and robust parameter settings allow reaching a win-win situation, with excellent performance in terms of both energy efficiency and network resource utilization. 
  •  
4.
  • Santos, Javier, et al. (författare)
  • Monkey Gamer: Automatic profiling of Android games
  • 2014
  • Ingår i: International Conference on Mobile Computing, Applications and Services (MobiCASE). - : IEEE conference proceedings. ; , s. 1-8
  • Konferensbidrag (refereegranskat)abstract
    • Creation of smartphone applications has undergone a massive explosion in recent years and there is an urgent need for evaluation of their resource efficiency, trustworthiness and reliability. A large proportion of these apps are going to be within the gaming area. In this paper we classify game apps on the basis of their development process, their I/O process and their interaction level. We present Monkey Gamer, a software to automatically play a large class of Android games and collect execution traces, based on a state machine to partially describe the game structure and interactions. A significant similarity is shown when comparing the results obtained by the Monkey Gamer and by human players, for three of the most popular Android games. We evaluate the performance of the Monkey Gamer by comparing the traces it generates with traces created when humans play the games, and find significant similarity in the trace sets.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-4 av 4

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy