Pub Date : 2014-07-08DOI: 10.1109/INFCOMW.2014.6849248
H. Kang, Kown Y. Park, K. Cho, C. Kang
We consider a mobile content delivery network (mCDN) in which a special form of mobile devices designated as caching servers (caching-server device: CSD) can provide the near-by devices with some popular contents on demand via device-to-device (D2D) communication links. On the assumption that mobile CSDs are randomly distributed by a Poisson point process (PPP), an optimization problem is formulated to determine the probability of storing the individual content in each server in a manner that minimizes the average caching failure rate. Further, we present a low-complexity search algorithm, optimum dual-solution searching algorithm (ODSA), for solving this optimization problem. We identify the important characteristics of the optimal caching policies in the mobile environment that would serve as a useful aid in designing an mCDN.
{"title":"Mobile caching policies for device-to-device (D2D) content delivery networking","authors":"H. Kang, Kown Y. Park, K. Cho, C. Kang","doi":"10.1109/INFCOMW.2014.6849248","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849248","url":null,"abstract":"We consider a mobile content delivery network (mCDN) in which a special form of mobile devices designated as caching servers (caching-server device: CSD) can provide the near-by devices with some popular contents on demand via device-to-device (D2D) communication links. On the assumption that mobile CSDs are randomly distributed by a Poisson point process (PPP), an optimization problem is formulated to determine the probability of storing the individual content in each server in a manner that minimizes the average caching failure rate. Further, we present a low-complexity search algorithm, optimum dual-solution searching algorithm (ODSA), for solving this optimization problem. We identify the important characteristics of the optimal caching policies in the mobile environment that would serve as a useful aid in designing an mCDN.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"45 1","pages":"299-304"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77111289","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-07-08DOI: 10.1109/INFCOMW.2014.6849223
Boya Di, S. Bayat, Lingyang Song, Yonghui Li
Wireless radio links are generally half-duplex, i.e., they can either transmit or receive in a single channel but not both simultaneously. To achieve single band simultaneous bidirectional communication, full-duplex radio links are recently utilized in wireless networks. Adoption of OFDMA scheme in the full-duplex radio links has also stimulated new research interest to improve the wireless networks' transmission rate even further [1]. Typically, a full-duplex OFDMA network consists of a common base station (BS), and multiple users as transmitters (TXs) and receivers (RXs). To achieve a satisfying sum-rate in the network, the TXs and RXs need to be properly paired into separate transceiver units, and a suitable subcarrier should be assigned to each transceiver unit. The BS also allocates proper power level to each transceiver unit such that the rate performance of the whole network is maximized. Due to the combinatorial nature of pairing multiple TXs, RXs, and subcarriers, and also the complexity of optimal power allocation to each subcarrier-transceiver pair, resource allocation in such a full-duplex OFDMA network can be very challenging.
{"title":"Radio resource allocation for full-duplex OFDMA networks using matching theory","authors":"Boya Di, S. Bayat, Lingyang Song, Yonghui Li","doi":"10.1109/INFCOMW.2014.6849223","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849223","url":null,"abstract":"Wireless radio links are generally half-duplex, i.e., they can either transmit or receive in a single channel but not both simultaneously. To achieve single band simultaneous bidirectional communication, full-duplex radio links are recently utilized in wireless networks. Adoption of OFDMA scheme in the full-duplex radio links has also stimulated new research interest to improve the wireless networks' transmission rate even further [1]. Typically, a full-duplex OFDMA network consists of a common base station (BS), and multiple users as transmitters (TXs) and receivers (RXs). To achieve a satisfying sum-rate in the network, the TXs and RXs need to be properly paired into separate transceiver units, and a suitable subcarrier should be assigned to each transceiver unit. The BS also allocates proper power level to each transceiver unit such that the rate performance of the whole network is maximized. Due to the combinatorial nature of pairing multiple TXs, RXs, and subcarriers, and also the complexity of optimal power allocation to each subcarrier-transceiver pair, resource allocation in such a full-duplex OFDMA network can be very challenging.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"1 1","pages":"197-198"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79544953","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-07-08DOI: 10.1109/INFOCOM.2014.6848103
Jaewook Kwak, Chul-Ho Lee, Do Young Eun
{"title":"A high-order Markov chain based scheduling algorithm for low delay in CSMA networks","authors":"Jaewook Kwak, Chul-Ho Lee, Do Young Eun","doi":"10.1109/INFOCOM.2014.6848103","DOIUrl":"https://doi.org/10.1109/INFOCOM.2014.6848103","url":null,"abstract":"","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"23 1","pages":"1662-1670"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84834708","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-07-08DOI: 10.1109/INFCOMW.2014.6849200
M. Broadbent, Panagiotis Georgopoulos, Vasileios Kotronis, B. Plattner, N. Race
Efficient content delivery is a constantly evolving challenge on the modern Internet. Reducing the impact of duplicate deliveries of identical content is a key factor in reducing congestion and transit costs for smaller networks. This work leverages SDN concepts and mechanisms in order to transparently store and deliver content from a local cache to the client, thus lightening the load on the WAN and relieving the necessity for urgent network capacity upgrades. An open interface to the cache presents owners with new possibilities for cache control and maintenance. This demonstration showcases a prototype implementation in action on a large-scale OpenFlow testbed deployed across Europe.
{"title":"OpenCache: Leveraging SDN to demonstrate a customisable and configurable cache","authors":"M. Broadbent, Panagiotis Georgopoulos, Vasileios Kotronis, B. Plattner, N. Race","doi":"10.1109/INFCOMW.2014.6849200","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849200","url":null,"abstract":"Efficient content delivery is a constantly evolving challenge on the modern Internet. Reducing the impact of duplicate deliveries of identical content is a key factor in reducing congestion and transit costs for smaller networks. This work leverages SDN concepts and mechanisms in order to transparently store and deliver content from a local cache to the client, thus lightening the load on the WAN and relieving the necessity for urgent network capacity upgrades. An open interface to the cache presents owners with new possibilities for cache control and maintenance. This demonstration showcases a prototype implementation in action on a large-scale OpenFlow testbed deployed across Europe.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"7 1","pages":"151-152"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88485068","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Software defined networking (SDN) [1] works as a centralized control model. However, the Internet is managed by owners of different domains, which makes the centralized control does not work for inter-domain Controlling the flow of data packets in a global network requires each NOS (Network Operating System) to have a relative global network view to determine the next NOS hop. Hence, NOSes are required to exchange reachability and topology information between the inter-domain networks. How such information is efficiently exchanged has not been well addressed so far. Thus, this demo proposes a West-East Bridge (WE-Bridge) mechanism for different SDN administrative domains to peer and cooperate with each other: (1) we design a peer-to-peer based high performance network information exchange mechanism. We define what network information should be exchanged and how such information is efficiently exchanged among inter-domain SDN peers. (2) To achieve a resilient peer-to-peer control plane of heterogeneous NOSes, we propose a `maximum connection degree' based connection algorithm [4]. (3) Considering the privacy, we propose to virtualize the SDN network view, and only exchange the virtualized network view to construct the relative global network view. Applications above WE-Bridge carry out the route translation, calculation, and installation.
{"title":"WE-bridge: West-east bridge for SDN inter-domain network peering","authors":"Pingping Lin, J. Bi, Zejia Chen, Yangyang Wang, Hongyu Hu, Anmin Xu","doi":"10.1109/INFCOMW.2014.6849180","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849180","url":null,"abstract":"Software defined networking (SDN) [1] works as a centralized control model. However, the Internet is managed by owners of different domains, which makes the centralized control does not work for inter-domain Controlling the flow of data packets in a global network requires each NOS (Network Operating System) to have a relative global network view to determine the next NOS hop. Hence, NOSes are required to exchange reachability and topology information between the inter-domain networks. How such information is efficiently exchanged has not been well addressed so far. Thus, this demo proposes a West-East Bridge (WE-Bridge) mechanism for different SDN administrative domains to peer and cooperate with each other: (1) we design a peer-to-peer based high performance network information exchange mechanism. We define what network information should be exchanged and how such information is efficiently exchanged among inter-domain SDN peers. (2) To achieve a resilient peer-to-peer control plane of heterogeneous NOSes, we propose a `maximum connection degree' based connection algorithm [4]. (3) Considering the privacy, we propose to virtualize the SDN network view, and only exchange the virtualized network view to construct the relative global network view. Applications above WE-Bridge carry out the route translation, calculation, and installation.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"119 1","pages":"111-112"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77604954","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-07-08DOI: 10.1109/INFCOMW.2014.6849173
Naeem Khademi, David Ros, M. Welzl
Active Queue Management (AQM) design has again come into the spotlight of network operators, vendors and OS developers. This reflects the growing concern and sensitivity about the end-to-end latency perceived by today's Internet users. CoDel and PIE are two AQM mechanisms that have recently been presented and discussed in the IRTF and the IETF as solutions for keeping latency low. To the best of our knowledge, they have so far only been evaluated or compared against each other using default parameter settings, which naturally presents a rather limited view of their operational range. We set thus to perform a broader experimental evaluation using real-world implementations in a wired testbed. We have in addition compared them with a decade-old variant of RED called Adaptive RED, which shares with CoDel and PIE the goal of “knob-free” operation. Surprisingly, in several instances results were favorable towards Adaptive RED.
{"title":"The new AQM kids on the block: An experimental evaluation of CoDel and PIE","authors":"Naeem Khademi, David Ros, M. Welzl","doi":"10.1109/INFCOMW.2014.6849173","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849173","url":null,"abstract":"Active Queue Management (AQM) design has again come into the spotlight of network operators, vendors and OS developers. This reflects the growing concern and sensitivity about the end-to-end latency perceived by today's Internet users. CoDel and PIE are two AQM mechanisms that have recently been presented and discussed in the IRTF and the IETF as solutions for keeping latency low. To the best of our knowledge, they have so far only been evaluated or compared against each other using default parameter settings, which naturally presents a rather limited view of their operational range. We set thus to perform a broader experimental evaluation using real-world implementations in a wired testbed. We have in addition compared them with a decade-old variant of RED called Adaptive RED, which shares with CoDel and PIE the goal of “knob-free” operation. Surprisingly, in several instances results were favorable towards Adaptive RED.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"37 2","pages":"85-90"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91486555","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-07-08DOI: 10.1109/INFCOMW.2014.6849178
N. Farsad, Weisi Guo, A. Eckford
This demonstration will present the world's first macroscale molecular communication link to reliably transmit a continuous data stream. The system modulates alcohol molecules, which are then diffused via ambient and induced air currents to carry information to a receiver. The communication distance is several meters and the propagation channel we will demonstrate consists of both free space and tunnel environments. The goal is to show that molecules can be used as an alternative to electromagnetic (EM) waves in challenging environments where EM waves do not perform well.
{"title":"Molecular communication link","authors":"N. Farsad, Weisi Guo, A. Eckford","doi":"10.1109/INFCOMW.2014.6849178","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849178","url":null,"abstract":"This demonstration will present the world's first macroscale molecular communication link to reliably transmit a continuous data stream. The system modulates alcohol molecules, which are then diffused via ambient and induced air currents to carry information to a receiver. The communication distance is several meters and the propagation channel we will demonstrate consists of both free space and tunnel environments. The goal is to show that molecules can be used as an alternative to electromagnetic (EM) waves in challenging environments where EM waves do not perform well.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"2 1","pages":"107-108"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90140514","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-07-08DOI: 10.1109/INFCOMW.2014.6849290
Imdad Ullah, R. Boreli, M. Kâafar, S. Kanhere
Targeted advertising is a growing area of interest in both business and research community. In mobile communications, related research works focus on the collection of user's personal information by the mobile apps, protection against such data collection, and the implications of additional traffic generated by the ads on the mobile device resource utilization. In this work, we present a novel analysis of targeted advertising in the Google AdMob advertising network and show insights about the relevance of Google user profiles, and the categories of apps used, on the in-app ads served on smartphones. We define the classes of ads based on the match between received ads and the app (contextual ads), and Google AdMob user's profile (targeted ads). Our analysis reveals that, for all comparable experiments, the proportion of targeted ads is in all cases higher than the proportion of contextual ads. Moreover, blocking the targeting (disabling targeting in an AdMob user profile settings) results in a significant drop in the number of received ads with some experimental instances receiving no ads at all. Overall, the number of targeted ads is comparatively lower than the number of generic ads. Although this could be partially due to the limited size of ad pools at the time of our experiments, there is also an indication that, although user's information is collected, the subsequent use of such information for ads is still low. We present additional insights on the comparison between Google AdMob and other mobile advertising networks and illustrate the dominance of the former in both the number of ads served and the time during which the ads are displayed to the mobile users.
{"title":"Characterising user targeting for in-App Mobile Ads","authors":"Imdad Ullah, R. Boreli, M. Kâafar, S. Kanhere","doi":"10.1109/INFCOMW.2014.6849290","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849290","url":null,"abstract":"Targeted advertising is a growing area of interest in both business and research community. In mobile communications, related research works focus on the collection of user's personal information by the mobile apps, protection against such data collection, and the implications of additional traffic generated by the ads on the mobile device resource utilization. In this work, we present a novel analysis of targeted advertising in the Google AdMob advertising network and show insights about the relevance of Google user profiles, and the categories of apps used, on the in-app ads served on smartphones. We define the classes of ads based on the match between received ads and the app (contextual ads), and Google AdMob user's profile (targeted ads). Our analysis reveals that, for all comparable experiments, the proportion of targeted ads is in all cases higher than the proportion of contextual ads. Moreover, blocking the targeting (disabling targeting in an AdMob user profile settings) results in a significant drop in the number of received ads with some experimental instances receiving no ads at all. Overall, the number of targeted ads is comparatively lower than the number of generic ads. Although this could be partially due to the limited size of ad pools at the time of our experiments, there is also an indication that, although user's information is collected, the subsequent use of such information for ads is still low. We present additional insights on the comparison between Google AdMob and other mobile advertising networks and illustrate the dominance of the former in both the number of ads served and the time during which the ads are displayed to the mobile users.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"50 1","pages":"547-552"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90389624","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-07-08DOI: 10.1109/INFOCOM.2014.6848188
R. Cohen, G. Grebla
{"title":"Multi-dimensional OFDMA scheduling in a wireless network with relay nodes","authors":"R. Cohen, G. Grebla","doi":"10.1109/INFOCOM.2014.6848188","DOIUrl":"https://doi.org/10.1109/INFOCOM.2014.6848188","url":null,"abstract":"","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"1 1","pages":"2427-2435"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90861298","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-07-08DOI: 10.1109/INFCOMW.2014.6849216
E. M. R. Oliveira, A. C. Viana
The careful deployment of hotspots in metropolitan areas allow to maximize WiFi offloading, a viable solution to the recent boost up of mobile data consumption. Our proposed strategy considers routine characteristics present on people's daily trajectories, the space-time interaction between them urban locations, and their transportation modes. Using a reallife metropolitan trace, we show our routine-based strategy guarantees higher offload ratio than the current approach in the literature while using a realistic traffic model.
{"title":"Routine-based network deployment","authors":"E. M. R. Oliveira, A. C. Viana","doi":"10.1109/INFCOMW.2014.6849216","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849216","url":null,"abstract":"The careful deployment of hotspots in metropolitan areas allow to maximize WiFi offloading, a viable solution to the recent boost up of mobile data consumption. Our proposed strategy considers routine characteristics present on people's daily trajectories, the space-time interaction between them urban locations, and their transportation modes. Using a reallife metropolitan trace, we show our routine-based strategy guarantees higher offload ratio than the current approach in the literature while using a realistic traffic model.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"154 1","pages":"183-184"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86650393","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：