| 1. |
- Foerster, Klaus-Tycho, et al.
(författare)
-
TI-MFA : Keep Calm and Reroute Segments Fast
- 2018
-
Ingår i: IEEE INFOCOM 2018 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS). - : IEEE. - 9781538659793 ; , s. 415-420
-
Konferensbidrag (refereegranskat)abstract
- Segment Routing (SR) promises to provide scalable and fine-grained traffic engineering. However, little is known today on how to implement resilient routing in SR, i.e., routes which tolerate one or even multiple failures. This paper initiates the theoretical study of static fast failover mechanisms which do not depend on reconvergence and hence support a very fast reaction to failures. We introduce formal models and identify fundamental tradeoffs on what can and cannot be achieved in terms of static resilient routing. In particular, we identify an inherent price in terms of performance if routing paths need to be resilient, even in the absence of failures. Our main contribution is a first algorithm which is resilient even to multiple failures and which comes with provable resiliency and performance guarantees. We complement our formal analysis with simulations on real topologies, which show the benefits of our approach over existing algorithms.
|
|
| 2. |
- He, Qing, et al.
(författare)
-
Minimizing Age of Correlated Information for Wireless Camera Networks
- 2018
-
Ingår i: IEEE INFOCOM 2018 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS). - : IEEE. - 9781538659793 ; , s. 547-552
-
Konferensbidrag (refereegranskat)abstract
- Freshness of information is of critical importance for a variety of applications based on wireless camera networks where multi-view image processing is required. In this study, we propose to jointly optimize the use of communication and computing resources such that information from multiple views is delivered is obtained in a timely fashion. To this end, we extend the concept of age of information to capture packets carrying correlated data. We consider the joint optimization of processing node assignment and camera transmission policy, so as to minimize the maximum peak age of information from all sources. We formulate the multi-view age minimization problem (MVAM) and prove that it is NP-hard. We provide fundamental results including tractable cases and optimality conditions. To solve the MVAM efficiently, we develop a modular optimization algorithm following a decomposition approach. Numerical results show that, by employing our approach, the maximum peak age is significantly reduced in comparison to a traditional centralized solution with minimum-time scheduling.
|
|
| 3. |
- Josilo, Sladana, et al.
(författare)
-
Poster Abstract : Decentralized Fog Computing Resource Management for Offloading of Periodic Tasks
- 2018
-
Ingår i: IEEE INFOCOM 2018 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS). - : IEEE. - 9781538659793
-
Konferensbidrag (refereegranskat)abstract
- Fog computing is recognized as a promising approach for meeting the computational and delay requirements of a variety of emerging applications in the Internet of Things. This work presents a game theoretical treatment of the resource allocation problem in a fog computing system where wireless devices periodically generate computationally intensive tasks, and aim at minimizing their own cost.
|
|
| 4. |
- Khan, Amin M., et al.
(författare)
-
Demo Abstract : Towards IoT Service Deployments on Edge Community Network Microclouds
- 2018
-
Ingår i: IEEE INFOCOM 2018 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS). - : IEEE. - 9781538659793
-
Konferensbidrag (refereegranskat)abstract
- Internet of Things (IoT) services for personal devices and smart homes provided by commercial solutions are typically proprietary and closed. These services provide little control to the end users, for instance to take ownership of their data and enabling services, which hinders these solutions' wider acceptance. In this demo paper, we argue for an approach to deploy professional IoT services on user-controlled infrastructure at the network edge. The users would benefit from the ability to choose the most suitable service from different IoT service offerings, like the one which satisfies their privacy requirements, and third-party service providers could offer more tailored IoT services at customer premises. We conduct the demonstration on microclouds, which have been built with the Cloudy platform in the Guifi. net community network. The demonstration is conducted from the perspective of end users, who wish to deploy professional IoT data management and analytics services in volunteer microclouds.
|
|
| 5. |
- Ranaweera, Chathurika, et al.
(författare)
-
Optical X-haul Options for 5G Fixed Wireless Access : Which One to Choose?
- 2018
-
Ingår i: IEEE INFOCOM 2018 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS). - : IEEE. - 9781538659793
-
Konferensbidrag (refereegranskat)abstract
- 5G is anticipated to be a significant leap in the evolution of mobile communication. Being designed to facilitate 10 to 100 times more capacity than 4G, 5G is considered to be the most cost-efficient solution to provide Fixed Wireless Access (FWA)to households on a large scale where providing last mile access using wired solution might not be economically viable. With a range of promises to deliver user experience improvements, facilitating cost-efficient data transportation between FWA users and network core still remains an unsolved issue, given the enormous volume of data that will be traversing the superior 5G network. This work addresses this compelling problem by formulating a joint-optimization framework to plan and analyze the optimal deployment of diverse optical x-haul strategies that can be used in 5G-based FWA networks. The work provides a cornerstone for deployment strategies that will be imperative to realize future-proof FWA network.
|
|
| 6. |
- Varma Champati, Jaya Prakash, et al.
(författare)
-
Statistical Guarantee Optimization for Age of Information for the D/G/1 Queue
- 2018
-
Ingår i: IEEE INFOCOM 2018 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS). - : IEEE. - 9781538659793 - 9781538659809 ; , s. 130-135
-
Konferensbidrag (refereegranskat)abstract
- Age of Information (AoI) has proven to be a useful metric in networked systems where timely information updates are of importance. Recently, minimizing the "average age" has received considerable attention. However, various applications pose stricter age requirements on the updates which demand knowledge of the AoI distribution. In this work, we study the distribution of the AoI and devise a problem of minimizing the tail of the AoI distribution function with respect to the frequency of generating information updates, i.e., the sampling rate of monitoring a process, for the D/G/1 queue model under FCFS queuing discipline. We argue that computing an exact expression for the AoI distribution may not always be feasible. Therefore, we opt for computing a bound on the tail of the AoI distribution and use it to formulate a tractable alpha-relaxed Upper Bound Minimization Problem (alpha-UBMP), where alpha > 1 is an approximation factor. This approximation can be used to obtain "good" heuristic solutions. We demonstrate the efficacy of our approach by solving alpha-UBMP for the D/M/1 queue. We show, using simulation, that the rate solutions obtained are near optimal for minimizing the tail of the AoI distribution.
|
|
