发布求助
文献互助 智能选刊 最新文献

Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE最新文献

筛选
英文 中文
EM-based iterative receiver for space-time coded modulation with noise variance estimation 噪声方差估计下基于电磁的空时编码调制迭代接收机
Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE Pub Date : 2002-11-17 DOI: 10.1109/GLOCOM.2002.1188100
Zbigniew Baranski, A. Haimovich, J. Garcia-Frías
{"title":"EM-based iterative receiver for space-time coded modulation with noise variance estimation","authors":"Zbigniew Baranski, A. Haimovich, J. Garcia-Frías","doi":"10.1109/GLOCOM.2002.1188100","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1188100","url":null,"abstract":"We consider the design of a space-time coded modulation transmit-receive system employing symbol interleaving. An iterative receiver is derived based on the expectation-maximization algorithm with soft output symbol decoding and estimation of noise variance. The proposed system demonstrates very good performance over fast fading unknown channels in the presence of unknown additive white Gaussian noise.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126039956","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}
引用次数: 25
Study on appropriate voice data length of IP packets for VoIP network adjustment 研究适合VoIP网络的IP数据包语音数据长度调整
Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE Pub Date : 2002-11-17 DOI: 10.1109/GLOCOM.2002.1188471
Hiroyuki Oouch, Tsuyoshi Takenaga, Hajime Sugawara, M. Masugi
{"title":"Study on appropriate voice data length of IP packets for VoIP network adjustment","authors":"Hiroyuki Oouch, Tsuyoshi Takenaga, Hajime Sugawara, M. Masugi","doi":"10.1109/GLOCOM.2002.1188471","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1188471","url":null,"abstract":"This paper evaluates suitable voice-data length in IP packets for the adjustment of VoIP network systems. Based on measurements In a real environment, we examined the voice-quality level while varying the voice-data length of IP packets under various network conditions. We found that a VoIP system with long-voice data has high-transmission efficiency but there is a high deterioration in the voice-quality level in an inferior network. We also discovered that a VoIP system with short-voice data is tolerant to packet losses and preserves voice quality. Based on these results, we propose a VoIP system that sets the voice-data length of IP packets according to dynamically changing network QoS conditions to achieve both high-transmission efficiency and stable voice quality.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123271020","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}
引用次数: 32
Stabilized virtual buffer (SVB) - an active queue management scheme for Internet quality-of-service 稳定虚拟缓冲区(SVB)——一种用于Internet服务质量的主动队列管理方案
Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE Pub Date : 2002-11-17 DOI: 10.1109/GLOCOM.2002.1188473
Xidong Deng, Sungwon Yi, G. Kesidis, C. Das
{"title":"Stabilized virtual buffer (SVB) - an active queue management scheme for Internet quality-of-service","authors":"Xidong Deng, Sungwon Yi, G. Kesidis, C. Das","doi":"10.1109/GLOCOM.2002.1188473","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1188473","url":null,"abstract":"We present a virtual queue-based active queue management (AQM) scheme, called stabilized virtual buffer (SVB). The SVB scheme uses the packet arrival rate and queue length information to drop/mark packets probabilistically in a congested Internet router. System goodput, packet loss rate, average queue length, and stability of the queue are used to compare the proposed SVB scheme with prior AQM schemes (RED - random early detection; REM - random exponential marking; AVQ - adaptive virtual queue). Simulation results indicate that the SVB algorithm can provide better goodput and lower loss rate than the other three AQMs. The most striking feature of the proposed scheme is its robustness to workload fluctuations in maintaining a stable queue for different workload mixes (short and long flows) and parameter settings.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125313520","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}
引用次数: 33
Modeling the multicast address allocation problem 多播地址分配问题的建模
Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE Pub Date : 2002-11-17 DOI: 10.1109/GLOCOM.2002.1189005
D. Zappala, Chris GauthierDickey, V. Lo
{"title":"Modeling the multicast address allocation problem","authors":"D. Zappala, Chris GauthierDickey, V. Lo","doi":"10.1109/GLOCOM.2002.1189005","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1189005","url":null,"abstract":"To support IP multicast, domains must assign a unique multicast address to each application from a limited, globally-shared address space. We examine the performance of several classes of address allocation algorithms within the context of the MASC architecture. This study is the first of its kind to model the generalized multicast address allocation problem and consider non-contiguous allocation algorithms. We find that prefix-based allocation outperforms our non-contiguous algorithm, despite the apparent advantages of non-contiguous allocation. We also verify the benefit of using worst-fit for new allocations.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"516 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115191667","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
Methods for estimation of the uncoded symbol error rate at the receiver 估计接收机上未编码符号错误率的方法
Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE Pub Date : 2002-11-17 DOI: 10.1109/GLOCOM.2002.1188415
Walid K. M. Ahmed, K. Balachandran
{"title":"Methods for estimation of the uncoded symbol error rate at the receiver","authors":"Walid K. M. Ahmed, K. Balachandran","doi":"10.1109/GLOCOM.2002.1188415","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1188415","url":null,"abstract":"In some communications systems, uncoded symbol error rate (SER) estimation is required to be performed \"on-the-fly\" at the receiver, in order to provide a measure of the quality of service or to aid in the power control process required for CDMA systems. An example is the 3GPP WCDMA UMTS standard, where transport channel and physical channel bit error rates have been required as metrics to be estimated by the receiver. In this paper, we analyze the performance of a number of uncoded SER estimation techniques, including a novel technique in which we use the soft information of the received symbols to obtain a fast and accurate estimate of the uncoded SER. The technique we introduce outperforms the commonly used decode/re-encode/compare technique, in terms of accuracy and required estimation interval. Our technique also outperforms the brute-force technique, which is to send a known test-pattern, demodulate it at the receiver, and count the observed discrepancies.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116075679","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
Enhancing UMTS high-speed downlink packet access with dual-antenna terminals 增强双天线终端的UMTS高速下行分组接入
Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE Pub Date : 2002-11-17 DOI: 10.1109/GLOCOM.2002.1188175
A. Lozano
{"title":"Enhancing UMTS high-speed downlink packet access with dual-antenna terminals","authors":"A. Lozano","doi":"10.1109/GLOCOM.2002.1188175","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1188175","url":null,"abstract":"The improvement in downlink throughput attained by using dual-antenna terminals is quantified within then context of UMTS high-speed packet access. It is shown that, with simple linear combining, the increase in average throughput resulting from the addition of a second terminal antenna ranges within 16-70%. Moreover, since only receiver processing is involved, no standardization is required.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122664821","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}
引用次数: 5
Capturing the complete multifractal characteristics of network traffic 捕获网络流量的完整多重分形特征
Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE Pub Date : 2002-11-17 DOI: 10.1109/GLOCOM.2002.1189052
Trang Le Dinh Dang, S. Molnár, I. Maricza
{"title":"Capturing the complete multifractal characteristics of network traffic","authors":"Trang Le Dinh Dang, S. Molnár, I. Maricza","doi":"10.1109/GLOCOM.2002.1189052","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1189052","url":null,"abstract":"We propose a new multifractal traffic model for network traffic. The model is a combination of a multiplicative cascade with an independent lognormal process. We show that the model has all the important properties observed in data traffic including long-range dependence (LRD), multifractality and lognormality. We also demonstrate that the model is flexible enough to capture the complete multifractal characteristics of data traffic including both the scaling function and the moment factor. On the other hand, we argue that the model is simple from practical point of view having only three parameters. Practical applications for measured data traffic and validation of the model with queueing performance evaluation are also presented.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122800291","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}
引用次数: 15
Mobile agents based routing protocol for mobile ad hoc networks 基于移动代理的移动自组织网络路由协议
Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE Pub Date : 2002-11-17 DOI: 10.1109/GLOCOM.2002.1188062
S. Marwaha, C. Tham, D. Srinivasan
{"title":"Mobile agents based routing protocol for mobile ad hoc networks","authors":"S. Marwaha, C. Tham, D. Srinivasan","doi":"10.1109/GLOCOM.2002.1188062","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1188062","url":null,"abstract":"A novel routing scheme for mobile ad hoc networks (MANETs), which combines the on-demand routing capability of Ad Hoc On-Demand Distance Vector (AODV) routing protocol with a distributed topology discovery mechanism using ant-like mobile agents is proposed in this paper. The proposed hybrid protocol reduces route discovery latency and the end-to-end delay by providing high connectivity without requiring much of the scarce network capacity. On the one side the proactive routing protocols in MANETs like Destination Sequenced Distance Vector (DSDV) require to know, the topology of the entire network. Hence they are not suitable for highly dynamic networks such as MANETs, since the topology update information needs to be propagated frequently throughout the network. These frequent broadcasts limit the available network capacity for actual data communication. On the other hand, on-demand, reactive routing schemes like AODV and Dynamic Source Routing (DSR), require the actual transmission of the data to be delayed until the route is discovered. Due to this long delay a pure reactive routing protocol may not be applicable for real-time data and multimedia communication. Through extensive simulations in this paper it is proved that the proposed Ant-AODV hybrid routing technique, is able to achieve reduced end-to-end delay compared to conventional ant-based and AODV routing protocols.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122959603","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}
引用次数: 203
Forward and reverse link capacity for 1xEV-DO: third generation wireless high-speed data systems 1xEV-DO的正向和反向链路容量:第三代无线高速数据系统
Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE Pub Date : 2002-11-17 DOI: 10.1109/GLOCOM.2002.1188202
Ching-Yao Huang, Q. Bi, Asif D. Gandhi, Ronald R. Brown, Dongzhe Cui
{"title":"Forward and reverse link capacity for 1xEV-DO: third generation wireless high-speed data systems","authors":"Ching-Yao Huang, Q. Bi, Asif D. Gandhi, Ronald R. Brown, Dongzhe Cui","doi":"10.1109/GLOCOM.2002.1188202","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1188202","url":null,"abstract":"This paper presents the performance results of a 1xEV-DO system. With different fading channels, data rate control lengths and overhead channel power levels, the system performance will vary. While optimizing the forward-link throughput becomes critical for asymmetric traffic demand, it is important to ensure that the reverse-link throughput is sufficient to support the data traffic ratio of 4:1 to 6:1 (forward/reverse). In this paper, the forward-link throughput is simulated. The final throughput is based on field measured channels for different morphologies. On the reverse link capacity, the throughput is analyzed based on an analytical formula that considers pilot, DRC and data channels.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121859033","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}
引用次数: 13
Second chance replacement policy for mobile database overflow 移动数据库溢出的第二次替换策略
Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE Pub Date : 2002-11-17 DOI: 10.1109/GLOCOM.2002.1188484
Chi-Chun Lo, Kuen-Liang Sue
{"title":"Second chance replacement policy for mobile database overflow","authors":"Chi-Chun Lo, Kuen-Liang Sue","doi":"10.1109/GLOCOM.2002.1188484","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1188484","url":null,"abstract":"The visitor location register (VLR) is used to store temporary records for roaming users. Due to the limited capacity, the VLR may be full. This phenomenon is called VLR overflow. By replacing an existing record, the incoming user can still receive services. The most-idle replacement (MR) policy was proposed to improve the random replacement (RR) policy. The MR policy is almost the optimum method and outperforms RR policy significantly. However, the MR policy requires global information to find the most-idle user. It needs considerable extra cost and is unfeasible due to the separated VLR databases in the real mobile network. Therefore, we propose the second chance replacement (SCR) policy to overcome these drawbacks. The SCR policy needs only an additional bit in the record. Partial information is sufficient for our method, so it is feasible in the real mobile network. Moreover, the simulation results show that the SCR policy outperforms the MR policy in most scenarios investigated in our study.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"232 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122098524","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}
引用次数: 3
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信