2013 IEEE Global Communications Conference (GLOBECOM)最新文献_第10页

Congestion versus accuracy tradeoffs in IP traffic classification IP 流量分类中拥堵与准确性的权衡

2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831274

Martin Valdez-Vivas, N. Bambos

引用次数: 1

Optimal, distributed, timer-based best two relay discovery scheme for cooperative systems 基于最优、分布式、定时器的协作系统最佳双中继发现方案

2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831370

Joyson Sebastian, N. Mehta

{"title":"Optimal, distributed, timer-based best two relay discovery scheme for cooperative systems","authors":"Joyson Sebastian, N. Mehta","doi":"10.1109/GLOCOM.2013.6831370","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831370","url":null,"abstract":"Multiple relay selection enables a cooperative system to obtain better performance than single relay selection and yet avoid challenging problems such as synchronization that are associated with having all the relays transmit. While its benefits have been well characterized, the problem of developing distributed, scalable schemes that discover the best subset of relays remains to be fully investigated. The problem is challenging because the relays are spatially separated from each other and have only local channel knowledge. We investigate the popular, low feedback, and distributed timer scheme and derive a novel, optimal timer mapping that maximizes the probability of selecting the best two relays. This has applications in several cooperative schemes proposed in the literature. We derive several novel structural properties about the optimal mapping, which reduce the complexity of finding it from the large space of all functions to a one-dimensional search that can be solved using a computationally efficient, iterative algorithm. Our extensive benchmarking shows that the optimal mapping outperforms several relay discovery schemes proposed in the literature. The approach can be generalized to selecting the best l relays, as well.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129608325","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}

引用次数: 1

Revenue-driven virtual network embedding based on global resource information 基于全局资源信息的收益驱动虚拟网络嵌入

2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831416

Long Gong, Yonggang Wen, Zuqing Zhu, T. Lee

引用次数: 19

Approximation caching and routing algorithms for massive mobile data delivery 大规模移动数据传输的近似缓存和路由算法

2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831621

Konstantinos Poularakis, G. Iosifidis, L. Tassiulas

{"title":"Approximation caching and routing algorithms for massive mobile data delivery","authors":"Konstantinos Poularakis, G. Iosifidis, L. Tassiulas","doi":"10.1109/GLOCOM.2013.6831621","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831621","url":null,"abstract":"Small cells constitute a promising solution for managing the mobile data growth that has overwhelmed network operators. Local caching of popular content items at the small cell base stations has been proposed in order to decrease the capacity-and hence the cost- of the backhaul links that connect these base stations with the core network. However, deriving the optimal caching policy remains a challenging open problem especially if one considers realistic parameters such as the bandwidth limitation of the base stations. The latter constraint is particularly important for cases when users requests are massive. We consider such a scenario and formulate the joint caching and routing problem aiming to maximize the fraction of content requests served by the deployed small cell base stations. This is an NP-hard problem and hence we cannot obtain an exact optimal solution. Thus, we present a novel approximation framework based on a reduction to a well known variant of the facility location problem. This allows us to exploit the rich literature in facility location problems, in order to establish bounded approximation algorithms for our problem.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127515389","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}

引用次数: 39

Analysis of a probing-based cyclic sleep mechanism for passive optical networks 无源光网络中基于探测的循环睡眠机制分析

2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831457

N. Anthapadmanabhan, Nga T. Dinh, A. Elwalid, A. Wijngaarden

引用次数: 11

Generalized multipath load sharing using vectorized routing model 基于矢量化路由模型的广义多路径负载共享

2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831287

Kunpeng Liu, B. Jabbari, Stefano Secci

{"title":"Generalized multipath load sharing using vectorized routing model","authors":"Kunpeng Liu, B. Jabbari, Stefano Secci","doi":"10.1109/GLOCOM.2013.6831287","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831287","url":null,"abstract":"In this paper, we present a generalized multipath load sharing framework for Internet. Under the hypothesis that edge networks are fully independent in establishing Internet routing policies, we use game theory and a vectorized utility function to solve the Internet multipath routing problem. We first briefly review the existing techniques that apply game theory to improve the Internet routing resiliency. We propose a vectorized routing cost model to consider multiple routing metrics in the network setting, along with a universal refinement method to quantify the profile performance and predict the behavior of the vectorized routing game. Based on the universal refinement method as well as a linear traffic distribution algorithm, we define a generalized multipath load sharing framework to improve the routing resiliency in traffic exchange between two distant edge networks. Running simulations with real measured Internet metrics, we find that the proposed generalized edge-to-edge multipath load sharing framework is able to offer far more resilient solutions than legacy and alternative protocols such as standard BGP and BGP with LISP-based traffic engineering.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131047643","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}

引用次数: 2

A decentralized algorithm for Network Flow Optimization in mesh networks 网格网络中网络流优化的分散算法

2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831291

K. Nakayama, T. Koide

引用次数: 4

Practical and privacy-assured data indexes for outsourced cloud data 用于外包云数据的实用且有隐私保障的数据索引

2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831149

Hongli Zhang, Zhigang Zhou, Xiaojiang Du, Panpan Li, Xiangzhan Yu

{"title":"Practical and privacy-assured data indexes for outsourced cloud data","authors":"Hongli Zhang, Zhigang Zhou, Xiaojiang Du, Panpan Li, Xiangzhan Yu","doi":"10.1109/GLOCOM.2013.6831149","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831149","url":null,"abstract":"Cloud computing allows individuals and organizations outsource their data to cloud server due to the flexibility and cost savings. However, data privacy is a major concern that hampers the wide adoption of cloud services. Data encryption ensures data content confidentiality and fine-grained data access control prevents unauthorized user from accessing data. An unauthorized user may still be able to infer privacy information from encrypted data by using indexing techniques. In this paper, we investigate the problem of sensitive information leakage caused by orthogonal use of these two kinds of techniques. Based on that, we propose “core attribute”-aware techniques that can ensure privacy of outsourced data. The techniques focus on confidential attribute set of outsourced data. We adopt k-anonymity technique for the attribute indexes to prevent user from inferring privacy from unauthorized data. We formally prove the privacy-preserving guarantee of the proposed mechanism. Our extensive experiments demonstrate the practicality of the proposed mechanism, which has low computation and communication overhead.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130595769","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}

引用次数: 4

A novel anomaly detection system based on seven-dimensional flow analysis 一种新的基于七维流分析的异常检测系统

2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831160

Marcos V. O. de Assis, J. Rodrigues, M. L. Proença

引用次数: 15

Performance analysis of SDMA in multicell wireless networks 多蜂窝无线网络中SDMA的性能分析

2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831676

Chang Li, Jun Zhang, K. Letaief

{"title":"Performance analysis of SDMA in multicell wireless networks","authors":"Chang Li, Jun Zhang, K. Letaief","doi":"10.1109/GLOCOM.2013.6831676","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831676","url":null,"abstract":"Multi-antenna transmission, or MIMO, is a major enabling technique for broadband cellular networks. The current implementation, however, is mainly for the point-to-point link, and its potential for Space-Division Multiple Access (SDMA) has not been fully exploited. In this paper, we will analytically evaluate the performance of SDMA in multicell networks based on a spatial random network model, where both the base stations (BSs) and users are modeled as two independent Poisson point processes. The main difficulty is the evaluation of the interference distribution, for which we propose a novel BS grouping approach that leads to a closed-form expression for the network area spectral efficiency. We find that the number of active users (U) served with SDMA is critical, as it affects the spatial multiplexing gain, the aggregated interference, and the diversity gain for each user. The optimal value of U can be selected based on our analytical result, with which SDMA is shown to outperform both the single-user beamforming and full-SDMA for which U is the same as the number of BS antennas. In particular, it is shown that the performance gain of SDMA is higher when the BS density is relatively small compared to the user density, but the optimal value of U is almost the same for different scenarios, which is close to half of the BS antenna number.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132151851","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}

引用次数: 16