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

Reconfiguration heuristics for logical topologies in wide-area WDM networks 广域WDM网络中逻辑拓扑的重构启发式算法

Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE Pub Date : 2006-07-01 DOI: 10.1109/GLOCOM.2002.1189120

H. Takagi, Yongbing Zhang, H. Takagi

引用次数: 23

Dependent data broadcasting for unordered queries in a multiple channel mobile environment 在多通道移动环境中用于无序查询的依赖数据广播

Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE Pub Date : 2004-09-01 DOI: 10.1109/GLOCOM.2002.1188222

Jiun-Long Huang, Nfing-Syan Chen

引用次数: 27

Performance analysis of TCM with generalized selection combining on Rayleigh fading channels 瑞利衰落信道下广义选择组合TCM的性能分析

Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE Pub Date : 2003-07-22 DOI: 10.1109/GLOCOM.2002.1188429

A. Ramesh, A. Chockalingam, L. Milstein

{"title":"Performance analysis of TCM with generalized selection combining on Rayleigh fading channels","authors":"A. Ramesh, A. Chockalingam, L. Milstein","doi":"10.1109/GLOCOM.2002.1188429","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1188429","url":null,"abstract":"In this paper, we analyze the performance of trellis coded modulation (TCM) schemes with generalized selection combining (GSC) on fading channels. We first derive the computational cutoff rate, R/sub 0/, for coherent TCM schemes on i.i.d. Rayleigh fading channels with (K, L) GSC diversity which combines the K paths with the largest instantaneous SNR among the L available diversity paths. The cutoff rate is shown to be a simple function of the moment generating function (MGF) of the SNR at the output of the (K, L) GSC receiver. The cutoff rate results show that, at a cutoff rate of 1 bit/sec/Hz, 8-PSK modulation with (1, 3) GSC requires about the same E/sub b//N/sub 0/ as QPSK modulation with (2,3) GSC. Also, at 1.5 bits/sec/Hz, 8-PSK with (1, 3) GSC and QPSK with (3,3) GSC require about the same E/sub b//N/sub 0/. This illustrates that in TCM schemes with GSC diversity, the modulation complexity (i.e., alphabet size, M) and the GSC receiver complexity (i.e., the number of combined diversity paths, K) can be traded off to achieve a desired performance. Next, we derive the union bound on the bit error probability of TCM schemes with (K, L) GSC reception in the form of a simple, finite integral. The effectiveness of this bound is verified through simulations.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133998212","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

Asymptotic performance of transmit diversity via OFDM for multipath channels 多径信道下OFDM传输分集的渐近性能

Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE Pub Date : 2002-12-01 DOI: 10.1109/GLOCOM.2002.1188167

N. Ahmed, Richard Baraniuk

引用次数: 3

Hybrid flooding and tree-based broadcasting for reliable and efficient link-state dissemination 混合泛洪和基于树的广播，用于可靠和高效的链路状态传播

Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE Pub Date : 2002-12-01 DOI: 10.1109/GLOCOM.2002.1189061

T. Korkmaz, M. Krunz

{"title":"Hybrid flooding and tree-based broadcasting for reliable and efficient link-state dissemination","authors":"T. Korkmaz, M. Krunz","doi":"10.1109/GLOCOM.2002.1189061","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1189061","url":null,"abstract":"Current link-state routing protocols (e.g., OSPF) use flooding to disseminate link-state information throughout the network. Despite its simplicity and reliability, flooding incurs unnecessary communications overhead since nodes may receive multiple copies of the same advertisement. This extra overhead becomes an Issue in the context of quality-of-service (QoS) routing, where link state is dynamic and needs to be advertised frequently. The advertisement overhead can be significantly reduced by using tree-based broadcasting approaches. Although several of these approaches have been proposed in the literature, they are not used in practice because of their complexity and/or unreliability. We propose a new link-state dissemination approach that combines the best features of flooding and tree-based broadcasting. Our hybrid approach is particularly suited for \"dynamic\" link metrics (e.g., available bandwidth). It uses periodic flooding to advertise topology changes and first-time LSAs (link-state advertisements), and uses tree-based broadcasting to disseminate subsequent refresh LSAs. The broadcast trees in our approach are constructed dynamically during the flooding of the first LSA, without the need for the complex algorithms of previous tree-based approaches. Two versions of our dissemination approach are presented, with one being more suitable for networks with frequent topological changes. We prove the correctness of our approach and contrast its communications overhead with flooding and pure tree-based broadcasting. The results indicate that our hybrid approach has a significantly lower overhead than flooding; yet It enjoys the simplicity, reliability, and fast convergence of flooding. Finally, we outline how OSPF can be extended to support the proposed dissemination approach.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115997202","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

Multi-layer traffic engineering in photonic-GMPLS-router networks 光子- gmpls -路由器网络中的多层流量工程

Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE Pub Date : 2002-12-01 DOI: 10.1109/GLOCOM.2002.1189126

N. Yamanaka, M. Katayama, K. Shiomoto, E. Oki, N. Matsuura

引用次数: 5

SNAP based resource control for active networks 基于SNAP的活动网络资源控制

Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE Pub Date : 2002-12-01 DOI: 10.1109/GLOCOM.2002.1189002

Walter Eaves, Lawrence Cheng, A. Galis, T. Becker, Toshiaki Suzuki, S. Denazis, Chiho Kitahara

引用次数: 9

An adaptive QoS guarantee framework for SMIL multimedia presentations with ATM ABR service 基于ATM ABR服务的SMIL多媒体演示自适应QoS保证框架

Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE Pub Date : 2002-12-01 DOI: 10.1109/GLOCOM.2002.1188505

Ing-Chau Chang, Sheng-Wen Hsieh

{"title":"An adaptive QoS guarantee framework for SMIL multimedia presentations with ATM ABR service","authors":"Ing-Chau Chang, Sheng-Wen Hsieh","doi":"10.1109/GLOCOM.2002.1188505","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1188505","url":null,"abstract":"An adaptive framework to guarantee the application quality of service (APQoS) of a World Wide Web Consortium (W3C) Synchronized Multimedia Integration Language (SMIL) presentation is proposed. This framework cooperates with underlying network protocol stacks and SMIL client/server applications to guarantee continuous playback without interruption for streaming video and audio objects in the SMIL presentation. The framework at the SMIL client periodically monitors the underlying network bandwidth to calculate if synchronization requirements of the SMIL presentation can be satisfied. If not, the framework first tries dynamically to adjust bandwidth allocations among concurrent SMIL objects, according to their media importance (MI) values, at the SMIL media servers. If this scheme fails, other strategies, such as discarding less important objects or sending lower bit-rate objects instead, are provided. We use the ATM available bit rate (ABR) service to provide adaptive QoS support of network transmission because of its inexpensive cost. In simulations, this framework guarantees that all media data in the SMIL presentation can be shown synchronously.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122101862","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

Bandwidth allocation and traffic scheduling for DOCSIS systems with QoS support 支持QoS的DOCSIS系统的带宽分配和流量调度

Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE Pub Date : 2002-12-01 DOI: 10.1109/GLOCOM.2002.1188548

W. Kuo, Sunil Kumar, C.-C. Jay Kuo

引用次数: 5

Multiple-subcarrier optical communication systems with subcarrier signal point sequence 具有副载波信号点序列的多副载波光通信系统

Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE Pub Date : 2002-12-01 DOI: 10.1109/GLOCOM.2002.1188518

S. Teramoto, T. Ohtsuki

引用次数: 5