2013 IEEE International Conference on Communications (ICC)最新文献_第7页

K-user parallel concatenated code for Gaussian multiple-access channel 高斯多址信道的k用户并行连接代码

2013 IEEE International Conference on Communications (ICC) Pub Date : 2013-06-09 DOI: 10.1109/ICC.2013.6655052

Guanghui Song, Jun Cheng, Y. Watanabe

引用次数: 4

IDRD: Enabling inter-domain route diversity IDRD:使能域间路由分集

2013 IEEE International Conference on Communications (ICC) Pub Date : 2013-06-09 DOI: 10.1109/ICC.2013.6655099

X. Misseri, I. Gojmerac, J. Rougier

{"title":"IDRD: Enabling inter-domain route diversity","authors":"X. Misseri, I. Gojmerac, J. Rougier","doi":"10.1109/ICC.2013.6655099","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655099","url":null,"abstract":"In the present Internet, inter-domain routing is based on BGP-4 which does not allow for the use of multiple paths, but rather selects a single path per destination prefix. However, as the global Internet connectivity graph displays vast inherent path diversity, we believe that there is a lack of mechanisms which put this latent potential into use. To this end, we propose Inter-Domain Route Diversity (IDRD) as a mechanism which allows for diverse inter-domain paths to be propagated among carriers and used for packet forwarding. Our proposal is aimed to be efficient, backwards compatible, and incrementally deployable. In order to make use of the existing path diversity, we also propose a relaxation of the multipath route selection policy that is provably stable, while being more flexible. Our extensive evaluation of path disjointness in the Internet connectivity graph illustrates the potential benefits of IDRD. While the evaluation shows that the traditional “prefer customer” rule heavily impedes the use and propagation of the underlying diversity, it also demonstrates that our proposed relaxation of the multipath route selection policy enables near-optimal utilization of the underlying path diversity in the real Internet inter-domain topology.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"64 1","pages":"3536-3541"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72802009","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

An EM-based phase-noise estimator for MIMO systems 一种基于em的MIMO系统相位噪声估计器

2013 IEEE International Conference on Communications (ICC) Pub Date : 2013-06-09 DOI: 10.1109/ICC.2013.6655039

A. Tarable, G. Montorsi, S. Benedetto, Stefano Chinnici

引用次数: 18

Joint anycast and unicast routing for elastic optical networks: Modeling and optimization 弹性光网络的任播与单播联合路由:建模与优化

2013 IEEE International Conference on Communications (ICC) Pub Date : 2013-06-09 DOI: 10.1109/ICC.2013.6655168

K. Walkowiak, M. Klinkowski

引用次数: 53

Capacity analysis of G.fast systems via time-domain simulations 基于时域仿真的G.fast系统容量分析

2013 IEEE International Conference on Communications (ICC) Pub Date : 2013-06-09 DOI: 10.1109/ICC.2013.6655186

Igor Almeida, A. Klautau, Chenguang Lu

引用次数: 10

Performance analysis of triple correlated selection combining for cooperative diversity systems 合作分集系统的三相关选择组合性能分析

2013 IEEE International Conference on Communications (ICC) Pub Date : 2013-06-09 DOI: 10.1109/ICC.2013.6655463

R. Swaminathan, R. Roy, M. D. Selvaraj

引用次数: 9

Efficient sidelobe suppression for OFDM systems using advanced cancellation carriers 采用先进对消载波的OFDM系统的有效副瓣抑制

2013 IEEE International Conference on Communications (ICC) Pub Date : 2013-06-09 DOI: 10.1109/ICC.2013.6655312

Ahmed A. S. Seleim, I. Macaluso, L. Doyle

引用次数: 27

Evaluation and extension of a multi-dimensional graph-based receiver concept for MIMO-OFDM MIMO-OFDM中基于多维图的接收机概念的评估与扩展

2013 IEEE International Conference on Communications (ICC) Pub Date : 2013-06-09 DOI: 10.1109/ICC.2013.6655342

C. Knievel, D. Hao, P. Hoeher, P. Weitkemper, H. Taoka

引用次数: 2

Optimal algorithms for hierarchical web caches 分层web缓存的最优算法

2013 IEEE International Conference on Communications (ICC) Pub Date : 2013-06-09 DOI: 10.1109/ICC.2013.6655198

Konstantinos Poularakis, L. Tassiulas

{"title":"Optimal algorithms for hierarchical web caches","authors":"Konstantinos Poularakis, L. Tassiulas","doi":"10.1109/ICC.2013.6655198","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655198","url":null,"abstract":"Hierarchical topologies have been applied in many existing systems that provide public IPTV or massive content delivery services. The efficient operation of these services requires massive bandwidth resources. Data caching has emerged as an effective way in reducing bandwidth consumption and accelerating content access. In hierarchical caching systems requests for content are routed upwards until they reach a cache that stores a copy of the requested file. When the requested file is found, it is sent on the reverse path to the client. In this work, we focus on the problem of caching redundant copies of content in intermediate caches on the reverse path in order to minimize the bandwidth consumption within a given time horizon. The above problem is known to be NP-hard. However, we show that replacing the cache capacity constraints by a cost term paid each time we store a file in a cache, results to the tractable problem of minimizing the overall bandwidth and caching expenses. We use its optimal solution to establish a novel algorithm for the efficient solution of the original problem. We furthermore study the case that segments of encoded versions of the files instead of only complete files are allowed to be stored at the caches. We show that this problem is of polynomial complexity. Numerical experiments for typical popularity distributions reveal the performance distance between the proposed algorithms and heuristic algorithms that are commonly applied nowadays.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"90 1","pages":"4073-4077"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77221029","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 ray tracing algorithm using the discrete prolate spheroidal subspace 一种使用离散长球面子空间的射线跟踪算法

2013 IEEE International Conference on Communications (ICC) Pub Date : 2013-06-09 DOI: 10.1109/ICC.2013.6655505

Mingming Gan, F. Mani, F. Kaltenberger, Claude Oestges, T. Zemen

{"title":"A ray tracing algorithm using the discrete prolate spheroidal subspace","authors":"Mingming Gan, F. Mani, F. Kaltenberger, Claude Oestges, T. Zemen","doi":"10.1109/ICC.2013.6655505","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655505","url":null,"abstract":"Ray tracing (RT) is an accurate propagation prediction tool that has been widely used to simulate channel characteristics in indoor environments. To date, the developed RT tool includes not only specular reflection, penetration through dielectric blocks and diffraction, but also diffuse scattering mechanisms. The accuracy, provided by a detailed modeling of the environment, comes at the cost of a high computational complexity, which directly scales with the number of propagation paths considered. We are interested in simulating the radio propagation conditions for a mobile terminal, communicating in a frame based communication system indoors with several fixed nodes. This communication shall be used to obtain the position of the mobile terminal in indoor scenario. Therefore, the correlated temporal and spatial evolution of the channel impulse response is of utmost concern. In this paper, we propose a method to significantly reduce the computational complexity of RT by using a projection of all propagation paths on a subspace spanned by two-dimensional discrete prolate spheroidal (DPS) sequences. With this method the computational complexity can be reduced by more than one order of magnitude for indoor scenarios. The accuracy of our low-complexity DPS subspace based RT algorithm is verified by numeric simulations.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"8 1","pages":"5710-5714"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82567670","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}

引用次数: 9