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

筛选
英文 中文
Average level crossing rate and average outage duration of switched diversity systems 交换分集系统的平均电平交叉率和平均停机时间
Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE Pub Date : 2002-11-17 DOI: 10.1109/GLOCOM.2002.1188432
L. Yang, Mohamed-Slim Alouini
{"title":"Average level crossing rate and average outage duration of switched diversity systems","authors":"L. Yang, Mohamed-Slim Alouini","doi":"10.1109/GLOCOM.2002.1188432","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1188432","url":null,"abstract":"This paper presents closed-form expressions for the average level crossing rate (LCR) and average outage duration (ACID) of switch and stay combining (SSC). The results are quite general and applicable to dual-branch systems operating with equal/unequal thresholds over independent generalized fading paths which are not necessarily identically distributed. It is shown that our general results reduce to the specific case previously published. These new expressions are compared to those previously reported in the literature dealing with the LCR and ACID of selection combining (SC). Corresponding numerical examples and plots are also provided and discussed. These plots show that for a suitable choice of the switching threshold, SSC provides a lower AOD than SC but at the expense of a higher LCR or equivalently frequency of outages.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"394 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":"122095401","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
A scalable on-line multilevel distributed network fault detection/monitoring system based on the SNMP protocol 基于SNMP协议的可扩展在线多级分布式网络故障检测/监测系统
Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE Pub Date : 2002-11-17 DOI: 10.1109/GLOCOM.2002.1188542
Ming-Shan Su, K. Thulasiraman, Anindya Das
{"title":"A scalable on-line multilevel distributed network fault detection/monitoring system based on the SNMP protocol","authors":"Ming-Shan Su, K. Thulasiraman, Anindya Das","doi":"10.1109/GLOCOM.2002.1188542","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1188542","url":null,"abstract":"Traditional centralized network management solutions do not scale to present-day large-scale computer/communication networks. Decentralization/distributed solutions can solve some of these problems (Goldszmidt, G. and Yemini, Y., 1995), and thus there is considerable interest in distributed/decentralized network management applications. We present the design and evaluation of an SNMP-based distributed network fault detection/monitoring system. We integrate into the SNMP framework our ML-ADSD algorithm (Su, M.-S. et al., Proc. 39th Annual Allerton Conf. on Commun., Control, and Computers, 2001; Su, \"Multilevel distributed diagnosis and the design of a distributed network fault detection system based on the SNMP protocol\", Ph.D. Thesis, School of Computer Science, University of Oklahoma, 2002) for fault diagnosis in a distributed processor system. The algorithm uses the multilevel paradigm and requires only minor modifications to be scalable to networks of varying sizes. The system is fault tolerant, allowing processor failure and/or recovery during the diagnosis process. We have implemented the system on an Ethernet network of 32 machines. Our results show that the diagnosis latency (or time to termination) is much better than that of earlier solutions. Also, the system's bandwidth utilization is insignificant, demonstrating the practicality of its deployment in a real network. We have successfully integrated three modern disciplines: network management, distributed computing and system level diagnosis.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"382 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":"123955952","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}
引用次数: 22
A scheduling algorithm minimizing voids generated by arriving bursts in optical burst switched WDM network 一种最小化光突发交换WDM网络中到达突发所产生空隙的调度算法
Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE Pub Date : 2002-11-17 DOI: 10.1109/GLOCOM.2002.1189127
M. Iizuka, M. Sakuta, Y. Nishino, I. Sasase
{"title":"A scheduling algorithm minimizing voids generated by arriving bursts in optical burst switched WDM network","authors":"M. Iizuka, M. Sakuta, Y. Nishino, I. Sasase","doi":"10.1109/GLOCOM.2002.1189127","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1189127","url":null,"abstract":"We propose a scheduling algorithm minimizing voids generated by arriving bursts in an optical burst switched WDM network. In the proposed scheduling algorithm, when the burst which has arrived at an optical core router at a certain time can be transmitted in some data channels by using unused data channel capacity (called a void), our proposed scheduling algorithm selects the data channel in which a void newly generated after the burst transmission becomes minimum. We compare, by computer simulations, the performance of our proposed scheduling algorithm with that of the conventional one with respect to burst loss ratio. It is shown that our proposed algorithm can improve burst loss ratio.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"53 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":"124649764","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}
引用次数: 38
Degree-constrained multihop scatternet formation for Bluetooth networks 蓝牙网络的度约束多跳散射网形成
Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE Pub Date : 2002-11-17 DOI: 10.1109/GLOCOM.2002.1188073
C. Petrioli, S. Basagni
{"title":"Degree-constrained multihop scatternet formation for Bluetooth networks","authors":"C. Petrioli, S. Basagni","doi":"10.1109/GLOCOM.2002.1188073","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1188073","url":null,"abstract":"We describe BlueMesh, a new protocol for the establishment of scatternets, i.e., multihop ad hoc networks of Bluetooth devices. BlueMesh defines rules for device discovery, piconet formation and piconet interconnection in order to achieve the following desirable properties: a) BlueMesh generates connected scatternets without requiring the Bluetooth devices all to be in each other's transmission range; b) the BlueMesh scatternet topology is a mesh with multiple paths between any pair of nodes; c) BlueMesh piconets are made up of no more than 7 slaves. Simulation results in networks with 200 nodes show that BlueMesh is effective in quickly generating a connected scatternet in which each node, on average, does not assume more than 2.3 roles. Moreover, the length of routes between any two nodes in the network, is comparable to that of the shortest paths between the nodes.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"87 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":"124747979","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
On the performance of WAR systems with limited number of ISM-band ad hoc relay channels 关于具有数量有限的 ISM 波段特设中继信道的 WAR 系统的性能
Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE Pub Date : 2002-11-17 DOI: 10.1109/GLOCOM.2002.1188516
O. Tonguz, E. Yanmaz
{"title":"On the performance of WAR systems with limited number of ISM-band ad hoc relay channels","authors":"O. Tonguz, E. Yanmaz","doi":"10.1109/GLOCOM.2002.1188516","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1188516","url":null,"abstract":"Coping with congestion or hot spots is one of the common problems faced by the wireless service providers. To handle this hot spot or congestion problem in a cellular network, several dynamic load balancing schemes based on channel borrowing have previously been proposed. A recent approach to dynamic load balancing is the Integrated Cellular and Ad hoc Relay (iCAR) system. iCAR employs ad hoc relay stations (ARS's) in the cellular network to balance traffic loads efficiently and to share channels between cells via primary and secondary relaying. In this paper, it is shown that the realistic performance of ICAR systems in terms of dynamic load balancing and load sharing is heavily dependent upon the number of available ISM-band ARS channels. Results also indicate that the number of ARS channels required for dynamic load balancing is much more than the number of ARS channels required for load sharing (i.e., for bringing the call blocking probability of a hot spot to 2%).","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"21 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":"128183364","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}
引用次数: 6
Analysis of an enhanced signaling network for scalable mobility management in next generation wireless networks 下一代无线网络中可扩展移动管理的增强型信令网络分析
Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE Pub Date : 2002-11-17 DOI: 10.1109/GLOCOM.2002.1188208
Jeremy Abramson, Xiao-yan Fang, D. Ghosal
{"title":"Analysis of an enhanced signaling network for scalable mobility management in next generation wireless networks","authors":"Jeremy Abramson, Xiao-yan Fang, D. Ghosal","doi":"10.1109/GLOCOM.2002.1188208","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1188208","url":null,"abstract":"In order to support new personal communication services (PCS) in 2.5G and 3G networks, the underlying signaling network must support scalable and fault-tolerant mobility management. A mobility management architecture based on multiple home location registers (HLRs) and multiple gateway GPRS support nodes (GGSN) can meet both of these requirements. We consider an enhanced network architecture in which the mobility management databases, in particular, the HLRs, are interconnected by a TCP/IP network. The primary function of this additional network interface will be to support synchronization of the replicated and/or distributed HLRs. We outline the architecture of the converged signaling network and discuss the integration with the GPRS network. We then present analytical models to quantify the benefit of distributed HLR and replicated GGSN architectures. Our results show that a distributed HLR architecture can reduce the update and query delay. Finally, by appropriately load balancing the multiple GGSNs, the mean packet delay can be significantly reduced.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"17 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":"127225837","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}
引用次数: 0
Delay performance of high-speed packet switches with low speedup 低速加速下高速分组交换机的延迟性能
Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE Pub Date : 2002-11-17 DOI: 10.1109/GLOCOM.2002.1189106
P. Giaccone, Emilio Leonardi, B. Prabhakar, D. Shah
{"title":"Delay performance of high-speed packet switches with low speedup","authors":"P. Giaccone, Emilio Leonardi, B. Prabhakar, D. Shah","doi":"10.1109/GLOCOM.2002.1189106","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1189106","url":null,"abstract":"The speedup of a switch is the factor by which the switch, and hence the memory used in the switch, runs faster compared to the line rate. In high-speed switches, line rates are already touching the limits at which memory can operate. It is very important for a switch to run at as low a speedup as possible. For an input queued (IQ) switch at speedup 1, 100% throughput can be achieved for any admissible traffic (McKeown, N. et al., 1999; Dai, J. and Prabhakar, B., 2000). This gives finite average delays but does not guarantee control on packet delays. S.T. Chuang et al. (see IEEE J. Selected Areas of Commun., vol.17, no.6, p.1030-9, 1999) show that a combined input output queued (CIOQ) switch can emulate perfectly an output queued (OQ) switch at a speedup of 2 and, thus, control the packet delays. This motivates a study of the possibility of obtaining delay control at speedup less than 2. To guarantee optimal control of delays for a general class of traffic, as shown by Chuang et al., speedup 2 is necessary. Hence, to obtain control of delays at lower speedup, we need to restrict the class of arrival traffic. We study the speedup requirement for a class of admissible traffic, which we denote as (1, nF)-regulated traffic, with parameters n and F. We obtain the necessary speedup for this class of traffic. Further, we present a general class of algorithms working at the necessary speedups and thus providing bounded delays.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"19 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":"130108773","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
Hierarchical fair queuing: single-step approximation of hierarchical-GPS 分层公平排队:分层gps的单步逼近
Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE Pub Date : 2002-11-17 DOI: 10.1109/GLOCOM.2002.1189062
A. Jun, Ji-Young Choe, A. Leon-Garcia
{"title":"Hierarchical fair queuing: single-step approximation of hierarchical-GPS","authors":"A. Jun, Ji-Young Choe, A. Leon-Garcia","doi":"10.1109/GLOCOM.2002.1189062","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1189062","url":null,"abstract":"We propose a hierarchical packet scheduling technique to closely approximate a hierarchical extension of the generalized processor sharing model, hierarchical generalized processor sharing (H-GPS). Our approach is to undertake the tasks of service guarantee and hierarchical link sharing in an independent manner so that each task best serves its own objective. For tight and harmonized integration of the two independent service functions into a single packet scheduling algorithm, we introduce two novel concepts of distributed virtual time and service credit, and develop a packet version of H-GPS called hierarchical fair queuing (HFQ). We demonstrate the layer-independent performance of the HFQ algorithm through simulation results.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"14 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":"130180876","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
SPeCRA: a stochastic performance comparison routing algorithm for LSP setup in MPLS networks SPeCRA:一种用于MPLS网络LSP建立的随机性能比较路由算法
Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE Pub Date : 2002-11-17 DOI: 10.1109/GLOCOM.2002.1189020
J. D. Oliveira, F. Martinelli, C. Scoglio
{"title":"SPeCRA: a stochastic performance comparison routing algorithm for LSP setup in MPLS networks","authors":"J. D. Oliveira, F. Martinelli, C. Scoglio","doi":"10.1109/GLOCOM.2002.1189020","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1189020","url":null,"abstract":"A new algorithm for dynamic routing of LSPs is proposed. While off-line algorithms are not suitable due to the necessary a priori knowledge of future LSP setup requests, our proposed algorithm, SPeCRA (stochastic performance comparison routing algorithm), does not assume any specific stochastic traffic model and does not require any knowledge of future demands. Both features are a must for the new Internet traffic. In order to analyze SPeCRA's performance, we compare the ISP rejection ratios of SPeCRA and MIRA (Kar, K. et al., IEEE J. on Selected Areas in Commun., vol.18, no.12, p.2566-79, 2000). SPeCRA is easy to implement. It can be implemented using only simple shortest-hop or shortest-cost algorithms, which are interesting solutions for vendors, and not as computationally heavy as other routing algorithms.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"19 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":"122349382","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}
引用次数: 14
Antenna weight verification for closed-loop downlink eigenbeamforming 闭环下行本征波束形成的天线权重验证
Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE Pub Date : 2002-11-17 DOI: 10.1109/GLOCOM.2002.1188224
A. Seeger, M. Sikora, W. Utschick
{"title":"Antenna weight verification for closed-loop downlink eigenbeamforming","authors":"A. Seeger, M. Sikora, W. Utschick","doi":"10.1109/GLOCOM.2002.1188224","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1188224","url":null,"abstract":"Adaptive antennas at the base stations have a big potential to increase downlink capacity and coverage in WCDMA systems. One of the most promising techniques of adaptive antenna control is closed-loop transmit diversity. This method achieves beamforming gain as well as diversity gain by feedback of downlink fast fading characteristics from mobile station to base station. Due to the limited feedback rate, typically the best antenna weight vector chosen from a restricted set is reported. If this feedback is subject to transmission errors, two performance degrading effects occur: a suboptimal weight vector is used and channel estimation errors take place at the mobile station. The latter effect arises because the mobile station derives the channel estimate for the dedicated channel from the reported weight vector and the channel estimate per antenna based on the common pilot channel. In effect, feedback errors severely distort this estimate and lead to an error floor effect. However, channel estimation can also be based on the pilot symbols in the dedicated channel itself. This estimate has high variance, but is not distorted by feedback errors. If both estimates are combined in a process called antenna weight verification, performance can be dramatically increased. Within this paper an antenna weight verification scheme for eigenbeamformer is presented, which maximizes the estimation accuracy and eliminates the error floor. This is demonstrated by theoretical analysis and link-level simulations. It is shown that this antenna weight verification reduces the performance degradation to 0.2 dB at 1% frame error rate.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"17 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":"130893404","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}
引用次数: 6
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学术官方微信