GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)最新文献_第2页

An SSCOP-based link layer protocol for wireless LANs 一种基于sscope的无线局域网链路层协议

GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489) Pub Date : 2003-12-01 DOI: 10.1109/GLOCOM.2003.1258279

Haoli Wang, Aravind Velayutham

引用次数: 5

Performance evaluation of interrupt-driven kernels in gigabit networks 千兆网络中中断驱动内核的性能评估

GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489) Pub Date : 2003-12-01 DOI: 10.1109/GLOCOM.2003.1258971

K. Salah, K. El-Badawi

引用次数: 20

High-performance MIMO-OFDM via carrier interferometry 高性能MIMO-OFDM载波干涉测量

GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489) Pub Date : 2003-12-01 DOI: 10.1109/GLOCOM.2003.1258360

Patricia R. Barbosa, Zhiqiang Wu, C. Nassar

引用次数: 15

Pre-loaded key based multicast and broadcast authentication in mobile ad-hoc networks 移动自组织网络中基于预加载密钥的组播和广播认证

GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489) Pub Date : 2003-12-01 DOI: 10.1109/GLOCOM.2003.1258469

M. Ramkumar, Nasir Menon

引用次数: 41

A semi-blind detection algorithm for V-BLAST system V-BLAST系统的半盲检测算法

GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489) Pub Date : 2003-12-01 DOI: 10.1109/GLOCOM.2003.1258859

Jianming Wang, Chunming Zhao

引用次数: 3

On the efficacy of GMPLS auto-reprovisioning as a mesh-network restoration mechanism GMPLS自动重置作为网状网络恢复机制的有效性研究

GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489) Pub Date : 2003-12-01 DOI: 10.1109/GLOCOM.2003.1258942

Govindkrishna Kaigala, W. Grover

{"title":"On the efficacy of GMPLS auto-reprovisioning as a mesh-network restoration mechanism","authors":"Govindkrishna Kaigala, W. Grover","doi":"10.1109/GLOCOM.2003.1258942","DOIUrl":"https://doi.org/10.1109/GLOCOM.2003.1258942","url":null,"abstract":"GMPLS provides standardized protocols through which nodes can request and establish (or release) lightpaths on demand between themselves and peer nodes. The primary intent is to support automated provisioning for dynamic demand environments. However, an apparently tempting assumption is that GMPLS also provides a mechanism for physical layer network restoration, wherein all effected node pairs \"simply redial their connections\" - simultaneously. We argue from basic considerations, and illustrate with experimental results, that this is an oversimplified view. It assumes that the problem of replacing a failed path is the same when the path fails in isolation and when numerous paths fail together from a cable cut. Without some form of preplanning, or overall coordination of the multiple simultaneous reprovisioning attempts in the latter case, no guarantees are possible about the overall extent or pattern of recovery level. Capacity over-provisioning can mitigate the risk, but may involve almost as much overprovisioning as would suffice for simple 1+1 signal duplication in the first place, which defeats one of the main aims (efficiency) of a mesh-oriented scheme.","PeriodicalId":301154,"journal":{"name":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125024748","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

Output queued switch emulation by a one-cell-internally buffered crossbar switch 输出队列开关仿真由一个单元内部缓冲的交叉开关

GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489) Pub Date : 2003-12-01 DOI: 10.1109/GLOCOM.2003.1258922

L. Mhamdi, M. Hamdi

{"title":"Output queued switch emulation by a one-cell-internally buffered crossbar switch","authors":"L. Mhamdi, M. Hamdi","doi":"10.1109/GLOCOM.2003.1258922","DOIUrl":"https://doi.org/10.1109/GLOCOM.2003.1258922","url":null,"abstract":"The output queued (OQ) switching architecture shows optimal performance amongst all queuing approaches. However, OQ switches lack scalability due to high memory-bandwidth constraints. An OQ switch can be exactly emulated by a more scalable crossbar switch (i.e., input-queued - IQ - switch) and a small speedup (Chuang, S. et al., 1998). Unfortunately, this result was not of practical use due to the high complexity of the proposed scheduling scheme. A similar result was shown by B. Magill et al. (see Conf. on Commun. Control and Computing, 2002) and was based on the internally buffered crossbar (IBC) switching architecture. While the latter result seems to overcome the complexity issue, the scheduling scheme presented is costly. We extend our previous work (Mhamdi and Hamdi, IEEE ICC'03, vol.3, p.1659-63, 2003) and prove the same result as Magill et al., but with lower hardware requirements.. In particular, we propose a simple scheduling scheme, named modified current arrival first-lowest TTL (time-to-live) first (MCAF-LTF), that does not require a costly time stamping mechanism. Based on the MCAF-LTF, we prove that, with a speedup of just 2, a one-cell-internally buffered crossbar switch can exactly emulate an OQ switch. The reduced complexity of our proposed scheme makes it of high practical value and allows it to be readily implemented in ultra-high capacity networks.","PeriodicalId":301154,"journal":{"name":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125867698","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}

引用次数: 28

Adaptive coding and modulation for the forward link of broadband satellite networks 宽带卫星网络前向链路的自适应编码与调制

GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489) Pub Date : 2003-12-01 DOI: 10.1109/GLOCOM.2003.1258848

S. Cioni, R. D. Gaudenzi, R. Rinaldo

引用次数: 48

A novel multiple access scheme for Ethernet passive optical networks 一种新的以太网无源光网络多址方案

GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489) Pub Date : 2003-12-01 DOI: 10.1109/GLOCOM.2003.1258716

Yongqing Zhu, M. Ma, T. Cheng

引用次数: 15

Improving restorability in radio access network 提高无线接入网络的可恢复性

GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489) Pub Date : 2003-12-01 DOI: 10.1109/GLOCOM.2003.1258884

Wee-Seng Soh, Z. Antoniou, Hyong S. Kim

{"title":"Improving restorability in radio access network","authors":"Wee-Seng Soh, Z. Antoniou, Hyong S. Kim","doi":"10.1109/GLOCOM.2003.1258884","DOIUrl":"https://doi.org/10.1109/GLOCOM.2003.1258884","url":null,"abstract":"In the past, wireless network reliability issues have received limited attention. Previously proposed solutions have focused on protection against base station failures, which may require significantly more base stations than necessary. Actual data from wireless carriers suggest that problems in the backhaul are the uttermost reliability problems faced, and is therefore the main focus of this work. Current radio access networks are based on tree and star-like topologies, which have no inherent restorability properties. We propose a heuristic topology enhancement method that adds redundant spans and upgrades existing infrastructure cost-effectively, in order to create partially meshed architectures that could provide the desired level of restorability against single span failure scenarios. Both span and path restoration techniques are explored. The algorithm was tested using several different variants of restoration mechanisms. Results show that the proposed heuristic algorithm is able to achieve reasonably good solutions in a time scale that is several orders of magnitude faster than an optimization approach based on binary integer programming formulation.","PeriodicalId":301154,"journal":{"name":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125415362","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