GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.最新文献

Route discovery and capacity of ad hoc networks ad hoc网络的路由发现和容量

GLOBECOM '05. IEEE Global Telecommunications Conference, 2005. Pub Date : 2022-02-18 DOI: 10.1109/GLOCOM.2005.1578257

E. Perevalov, Rick S. Blum, A. Nigara, Xun Chen

引用次数: 2

An algorithm for exploiting channel time selectivity in pilot-aided MIMO systems 一种利用导频辅助MIMO系统中信道时间选择性的算法

GLOBECOM '05. IEEE Global Telecommunications Conference, 2005. Pub Date : 2007-12-01 DOI: 10.1049/iet-com:20060570

W. Chin, D. Ward, A. Constantinides

引用次数: 8

Consistent proportional delay differentiation: a fuzzy control approach 一致比例延迟微分:一种模糊控制方法

GLOBECOM '05. IEEE Global Telecommunications Conference, 2005. Pub Date : 2007-06-01 DOI: 10.1109/GLOCOM.2005.1577669

Jianbin Wei, Chengzhong Xu

{"title":"Consistent proportional delay differentiation: a fuzzy control approach","authors":"Jianbin Wei, Chengzhong Xu","doi":"10.1109/GLOCOM.2005.1577669","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1577669","url":null,"abstract":"Proportional delay differentiation (PDD) aims to maintain pre-specified packet queueing-delay ratios between different classes of traffic at each hop. Existing bandwidth-allocation approaches for PDD services rely on the assumption that average queueing delay of a class is inversely proportional to its allocated bandwidth, which is valid only in a heavy-utilized link. Consequently, in a non-heavy utilized link, they are unable to provide consistent PDD services effectively. As a remedy, in this paper, we propose a novel bandwidth-allocation approach that applies fuzzy control theory to reflect the nonlinearity between the queueing delay and the allocated bandwidth. In the approach, the bandwidth of a class is adjusted according to a set of fuzzy control rules defined over its error, the change of error, and the change of bandwidth allocation. Simulation results demonstrate that, in comparison with other bandwidth-allocation approaches, the fuzzy control approach is able to provide consistent PDD services under light, moderate, and heavy utilization conditions. They also show its robustness under various operation environments.","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"281 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121822903","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

Quantization bounds on Grassmann manifolds of arbitrary dimensions and MIMO communications with feedback 任意维格拉斯曼流形的量化界与带反馈的MIMO通信

GLOBECOM '05. IEEE Global Telecommunications Conference, 2005. Pub Date : 2007-05-15 DOI: 10.1109/GLOCOM.2005.1577892

Wei Dai, Y. Liu, B. Rider

{"title":"Quantization bounds on Grassmann manifolds of arbitrary dimensions and MIMO communications with feedback","authors":"Wei Dai, Y. Liu, B. Rider","doi":"10.1109/GLOCOM.2005.1577892","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1577892","url":null,"abstract":"This paper considers the quantization problem on the Grassmann manifold with dimension n and p. The unique contribution is the derivation of a closed-form formula for the volume of a metric ball in the Grassmann manifold when the radius is sufficiently small. This volume formula holds for Grassmann manifolds with arbitrary dimension n and p, while previous results are only valid for either p = 1 or a fixed p with asymptotically large n. Based on the volume formula, the Gilbert-Varshamov and Hamming bounds for sphere packings are obtained. Assuming a uniformly distributed source and a distortion metric based on the squared chordal distance, tight lower and upper bounds are established for the distortion rate tradeoff. Simulation results match the derived results. As an application of the derived quantization bounds, the information rate of a multiple-input multiple-output (MIMO) system with finite-rate channel-state feedback is accurately quantified for arbitrary finite number of antennas, while previous results are only valid for either multiple-input single-output (MISO) systems or those with asymptotically large number of transmit antennas but fixed number of receive antennas.","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125347739","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}

引用次数: 29

Hash-AV: fast virus signature scanning by cache-resident filters Hash-AV:通过驻留缓存的过滤器快速扫描病毒特征

GLOBECOM '05. IEEE Global Telecommunications Conference, 2005. Pub Date : 2007-03-01 DOI: 10.1504/IJSN.2007.012824

Ozgün Erdogan, P. Cao

{"title":"Hash-AV: fast virus signature scanning by cache-resident filters","authors":"Ozgün Erdogan, P. Cao","doi":"10.1504/IJSN.2007.012824","DOIUrl":"https://doi.org/10.1504/IJSN.2007.012824","url":null,"abstract":"Fast virus scanning is becoming increasingly important in today's Internet. While Moore's law continues to double CPU cycle speed, virus scanning applications fail to ride on the performance wave due to their frequent random memory accesses. This paper proposes Hash-AV, a virus scanning \"booster\" technique that aims to take advantage of improvements in CPU performance. Using a set of hash functions and a bloom filter array that fits in CPU second-level (L2) caches, Hash-AV determines the majority of \"no-match\" cases without accesses to main memory. Experiments show that Hash-AV improves the performance of the open-source virus scanner Clam-AV by a factor of 2.5 to 10. The key to Hash-AV's success lies in a set of \"bad but cheap\" hash functions that are used as initial hashes. The speed of Hash-AV makes it well suited for \"on-access\" virus scanning, providing greater protections to the user. Through intercepting system calls and wrapping glibc libraries, we have implemented an \"on-access\" version for Hash-AV+Clam-AV. The on-access scanner can examine input data at a throughput of over 200 Mb/s, making it suitable for network-based virus scanning.","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"474 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127555181","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}

引用次数: 93

Complex lattice reduction algorithms for low-complexity MIMO detection 用于低复杂度MIMO检测的复晶格约简算法

GLOBECOM '05. IEEE Global Telecommunications Conference, 2005. Pub Date : 2006-07-17 DOI: 10.1109/GLOCOM.2005.1578299

Y. Gan, W. Mow

引用次数: 5

Dynamic channel allocation for mobile cellular systems using a control theoretical approach 使用控制理论方法的移动蜂窝系统动态信道分配

GLOBECOM '05. IEEE Global Telecommunications Conference, 2005. Pub Date : 2006-02-01 DOI: 10.1093/ietcom/e89-b.2.621

Yaya Wei, Chuang Lin, Xin Jin, R. Raad, Fengyuan Ren

引用次数: 1

Theoretical analysis of TCP throughput in adhoc wireless networks 自组织无线网络中TCP吞吐量的理论分析

GLOBECOM '05. IEEE Global Telecommunications Conference, 2005. Pub Date : 2005-12-02 DOI: 10.1109/GLOCOM.2005.1578253

Hannan Xiao, K. Chua, J. Malcolm, Ying Zhang

引用次数: 13

RAMP: reconfigurable architecture and mobility platform RAMP:可重构架构和移动平台

GLOBECOM '05. IEEE Global Telecommunications Conference, 2005. Pub Date : 2005-12-01 DOI: 10.1109/GLOCOM.2005.1578436

Jyh-cheng Chen, J. Yeh, Yi-Wen Lan, Li-Wei Lin, Fu-Cheng Chen, S. Hung

{"title":"RAMP: reconfigurable architecture and mobility platform","authors":"Jyh-cheng Chen, J. Yeh, Yi-Wen Lan, Li-Wei Lin, Fu-Cheng Chen, S. Hung","doi":"10.1109/GLOCOM.2005.1578436","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1578436","url":null,"abstract":"There are many incompatible wireless systems. How to integrate them has become an important issue. The integration should be done in both radio access networks (RANs) and core networks. The current trend is to integrate various RANs with an IP-based core network so users with a multi-mode handset or reconfigurable radio, such as software defined radio (SDR), could seamlessly roam among different RANs. With this all-IP paradigm, there should be one common core network, or various core networks should be compatible. Unfortunately, although both 3GPP and 3GPP2 have adopted IP in their packet-switched core networks, the architectures and protocols are not necessary compatible. In addition, they are also different from today's Internet. A user with reconfigurable radio still could not roam seamlessly among 3GPP, 3GPP2, and other IP core networks. As that in RANs, in this paper we propose a reconfigurable architecture in which users could use different protocols in core networks dynamically. There are many potential research topics for the reconfigurable core network. This paper focuses on reconfigurable mobility management. An architecture called reconfigurable architecture and mobility platform (RAMP) is proposed. Both analytical model and simulation are developed to analyze the architecture. In addition, a testbed is constructed. Empirical experiments are conducted to demonstrate the feasibility of the proposed idea","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124843158","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

Distributed optimization of converged IP-optical networks 融合ip光网络的分布式优化

GLOBECOM '05. IEEE Global Telecommunications Conference, 2005. Pub Date : 2005-12-01 DOI: 10.1109/GLOCOM.2005.1577752

A. Elwalid, D. Mitra, Qiong Wang

引用次数: 2