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

ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220)最新文献

筛选
英文 中文
Angle diversity for nondirected wireless infrared communication 非定向无线红外通信的角度分集
ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220) Pub Date : 1998-06-07 DOI: 10.1109/ICC.1998.683113
J. Carruthers, J. Kahn
{"title":"Angle diversity for nondirected wireless infrared communication","authors":"J. Carruthers, J. Kahn","doi":"10.1109/ICC.1998.683113","DOIUrl":"https://doi.org/10.1109/ICC.1998.683113","url":null,"abstract":"We outline the benefits and challenges of using angle diversity in nondirected wireless infrared communications systems. Multiple transmitter beams and multiple narrow-field-of-view receivers reduce the path loss, multipath distortion and background noise of the channel, which leads to improved range. The design and performance of a prototype angle-diversity infrared communication system are discussed. The prototype can maintain 70 Mb/s at a BER of 10/sup -9/ over a 4 m range.","PeriodicalId":218354,"journal":{"name":"ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114946230","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}
引用次数: 297
QoS control by simple modified FIFO in ATM networks 基于简单改进FIFO的ATM网络QoS控制
ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220) Pub Date : 1998-06-07 DOI: 10.1109/ICC.1998.683122
Wen-Tsuen Chen, Wen Lin, Jung-Jyh Lin
{"title":"QoS control by simple modified FIFO in ATM networks","authors":"Wen-Tsuen Chen, Wen Lin, Jung-Jyh Lin","doi":"10.1109/ICC.1998.683122","DOIUrl":"https://doi.org/10.1109/ICC.1998.683122","url":null,"abstract":"Although earliest-deadline-first (EDF) is recognized as the optimal scheduling discipline to support the bounded-delay service in ATM networks, it lacks of the support of a prioritizing scheme for cell loss control. We modify the simple FIFO to implement a near-EDF scheduling discipline with loss control. The proposed scheme can guarantee the stringent delay bound and minimize the cell loss rate. The adaptive queue lengths in the proposed buffer structure can be determined dynamically according to the traffic load and cell delay constraints to minimize the cell loss rates. With the different deterministic adaptive queue lengths, the proposed scheme is equivalent to the other previous schemes. Performance evaluation shows that the proposed scheme's accessible offered load is better than the other schemes.","PeriodicalId":218354,"journal":{"name":"ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116031609","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
Discordant virtual paths and flat network architectures 不协调的虚拟路径和平面网络架构
ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220) Pub Date : 1998-06-07 DOI: 10.1109/ICC.1998.683130
F. Safaei, B. Tonkin
{"title":"Discordant virtual paths and flat network architectures","authors":"F. Safaei, B. Tonkin","doi":"10.1109/ICC.1998.683130","DOIUrl":"https://doi.org/10.1109/ICC.1998.683130","url":null,"abstract":"This paper introduces a new cost based network planning approach where the main concern of the planner is decreasing the product unit cost rather than increasing the resource utilisation. The paper identifies inherent trade-offs in the network architecture that take advantage of the disparity between the cost of carriage components. Considering previous trends in the cost of hardware, software, and labour, the paper proposes a flat network architecture in accordance with the prevailing trend. It identifies the limitations of the current concept of ATM virtual paths in decoupling between the switching and transport utilisation. Consequently, it proposes a new approach to the operation of virtual paths called discordant virtual paths that enables maximum switching layer utilisation while maintaining an under-utilised transport platform. The discordant virtual path approach allows the network operator to adapt to variations in the cost of components.","PeriodicalId":218354,"journal":{"name":"ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122373810","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
Core-manager based scalable multicast routing 基于核心管理器的可扩展多播路由
ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220) Pub Date : 1998-06-07 DOI: 10.1109/ICC.1998.685199
Changdong Liu, Myung J. Lee, T. Saadawi
{"title":"Core-manager based scalable multicast routing","authors":"Changdong Liu, Myung J. Lee, T. Saadawi","doi":"10.1109/ICC.1998.685199","DOIUrl":"https://doi.org/10.1109/ICC.1998.685199","url":null,"abstract":"With the growing interests in distributed applications, efficient and scalable multicast routing is of great concern. Source-based tree multicast routing protocols, however, become very inefficient when used with large number of sources over large scale internetworks. Shared-tree based multicast routing protocols like PIM and CBT being developed by the IDMR working group of the IETF, trade efficiency of multicast delivery trees with scalability, but there are some issues open to further study. The work presented in this paper, the core-manager based multicast routing (CMMR) architecture, adopts shared-tree based techniques to achieve good scalability. It worked out an innovative approach to issues like core selection and multicast delivery tree management. The basic idea behind CMMR is that the core-manager (CM) keeps tracking cores of each multicast delivery tree in order to maintain a brief image of the tree. Consequently, new members will almost always be directed to a nearby core so that tree cost is well confined. However, not every new member has to actually consult the CM thanks to a self-growing scheme, maintaining control overhead low. Simulations show that the CMMR outperforms other existing shared-tree based multicast routing protocols like PIM, and can do as well as expensive near-optimal Steiner tree heuristics when average costs of multicast delivery trees are compared. Further improving on scalability is sought by using a hierarchical architecture, which requires the multicast addresses be administratively scoped in accordance with the hierarchy. Management of candidate cores are restricted within individual hierarchical regions. In addition, the CMMR scheme is recursive, meaning that all routers run the same algorithm regardless of their hierarchical levels.","PeriodicalId":218354,"journal":{"name":"ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220)","volume":"21 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114133861","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
PDMRP: a programmable distributed multicast routing protocol PDMRP:一种可编程的分布式组播路由协议
ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220) Pub Date : 1998-06-07 DOI: 10.1109/ICC.1998.685200
N. Huang, Chien-Yu Yeh, Chung-Ching Chiou
{"title":"PDMRP: a programmable distributed multicast routing protocol","authors":"N. Huang, Chien-Yu Yeh, Chung-Ching Chiou","doi":"10.1109/ICC.1998.685200","DOIUrl":"https://doi.org/10.1109/ICC.1998.685200","url":null,"abstract":"One of the most critical task for group communications lies in the establishment of multicast trees on the network. Two famous multicast trees are the shortest path-based trees and the Steiner-based trees. The former is suitable for those applications (such as video conferences) which wish to have a low propagation delay between the source (chairman site) to each of the receivers (member sites). The latter is well-suited for those (such as VoD services) which tend to consume as small as possible network resources (bandwidth). So far the routers have to implement separate routing protocols in order to support the construction of different kinds of multicast trees. This paper proposes a programmable distributed multicast routing protocol (PDMRP) for the routers so that different multicast trees can be established easily by only tuning a cost parameter.","PeriodicalId":218354,"journal":{"name":"ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116813604","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
Diversity combining in antenna array base station receiver for DS/CDMA system DS/CDMA系统天线阵列基站接收机中的分集组合
ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220) Pub Date : 1998-06-07 DOI: 10.1109/ICC.1998.683048
C. Gowda, Viswanath Annampedu, R. Viswanathan
{"title":"Diversity combining in antenna array base station receiver for DS/CDMA system","authors":"C. Gowda, Viswanath Annampedu, R. Viswanathan","doi":"10.1109/ICC.1998.683048","DOIUrl":"https://doi.org/10.1109/ICC.1998.683048","url":null,"abstract":"This paper analyses a few schemes for combining base station antenna array signals in wireless DS/CDMA. The performances of equal gain combining (EGC), likelihood rank test (LRT) and a modified rank test (MRT) are evaluated using simulation studies. The results indicate that, under certain assumptions on the multiple access interference statistics, the probability of error of the MRT is lower than that of EGC, if a few high power interfering users are present along with a low power user of interest. If there are a moderately large number of users and if the received power of all the users are nearly the same, then EGC outperforms the MRT. In fact, under this condition, the performance of EGC is close to that of the optimal likelihood ratio test.","PeriodicalId":218354,"journal":{"name":"ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129939728","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
Multiple-access with time hopping and block waveform PPM modulation 具有跳时和块波形PPM调制的多路访问
ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220) Pub Date : 1998-06-07 DOI: 10.1109/ICC.1998.685115
F. Ramírez-Mireles, R. Scholtz
{"title":"Multiple-access with time hopping and block waveform PPM modulation","authors":"F. Ramírez-Mireles, R. Scholtz","doi":"10.1109/ICC.1998.685115","DOIUrl":"https://doi.org/10.1109/ICC.1998.685115","url":null,"abstract":"The use of time-hopped block waveform encoding PPM signals sets for multiple access communications is studied. The multiple access performance is analyzed in terms of the number of users supported by the system for a given bit error rate and bit transmission rate. The analysis shows that this technique is potentially able to provide multiple-access communications with a combined transmission capacity of over 500 Megabits per second at bit error rates in the range 10/sup -4/ to 10/sup -8/ using receivers of moderate complexity.","PeriodicalId":218354,"journal":{"name":"ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129272197","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}
引用次数: 64
Adaptive C-OFDM system at 30 GHz for the last mile wireless broadband access to interactive services 自适应C-OFDM系统在30ghz下为最后一英里无线宽带接入交互式服务
ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220) Pub Date : 1998-06-07 DOI: 10.1109/ICC.1998.683038
V. Tralli, A. Vaccari, R. Verdone, O. Andrisano
{"title":"Adaptive C-OFDM system at 30 GHz for the last mile wireless broadband access to interactive services","authors":"V. Tralli, A. Vaccari, R. Verdone, O. Andrisano","doi":"10.1109/ICC.1998.683038","DOIUrl":"https://doi.org/10.1109/ICC.1998.683038","url":null,"abstract":"In this paper a wireless local multipoint distribution system (LMDS) at 30 GHz for the last mile broadband distribution to users of interactive services is investigated. The system we propose users a coded OFDM transmission scheme with FDM and/or TDM multiplexing techniques and adaptive carrier allocation to counteract the effects of the wireless communication channel. An urban microcell in an actual propagation environment is analyzed by means of a ray-tracing tool. Coverage probability is defined and investigated and the choices of the optimum multiplexing technique and carrier allocation algorithm are discussed. It is found that a pure FDM technique with adaptive carrier allocation and priority to users having the largest path loss leads to the best performance.","PeriodicalId":218354,"journal":{"name":"ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130344710","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}
引用次数: 10
A new method of channel shortening with applications to discrete multi-tone (DMT) systems 一种新的信道缩短方法及其在离散多音(DMT)系统中的应用
ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220) Pub Date : 1998-06-07 DOI: 10.1109/ICC.1998.685113
D. Pal, G.N. Iyengar, J. Cioffi
{"title":"A new method of channel shortening with applications to discrete multi-tone (DMT) systems","authors":"D. Pal, G.N. Iyengar, J. Cioffi","doi":"10.1109/ICC.1998.685113","DOIUrl":"https://doi.org/10.1109/ICC.1998.685113","url":null,"abstract":"A new procedure is proposed for solving the problem of channel shortening (a.k.a. the TEQ problem) for discrete multi tone (DMT) systems. Channel shortening is accomplished by using an multi-input-single-output (MISO) adaptive filter bank at the receiver. Each input represents a \"logical path\" from the transmitter to the receiver The \"paths\" are derived either via oversampling, or by using multiple analog to digital converters (A/Ds) with different sampling delays, or from A/Ds connected to different receive antennas (as may be the case in a wireless system). It is shown that for a finite order linear time invariant channel, it is always possible (provided certain conditions are met) to find a FIR filter bank combiner such that the effective length of the channel is no more than the cyclic prefix.","PeriodicalId":218354,"journal":{"name":"ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123838590","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}
引用次数: 37
On state-independent and state-dependent path restoration in self-healing networks 自愈网络中状态独立与状态依赖的路径恢复
ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220) Pub Date : 1998-06-07 DOI: 10.1109/ICC.1998.685183
Y. Xiong, L. Mason
{"title":"On state-independent and state-dependent path restoration in self-healing networks","authors":"Y. Xiong, L. Mason","doi":"10.1109/ICC.1998.685183","DOIUrl":"https://doi.org/10.1109/ICC.1998.685183","url":null,"abstract":"We first present a heuristic algorithm which is based on the minimum cost route concept for capacity allocation and flow assignment in self-healing networks, and show via numerical examples that it can yield near-optimal solutions for both spare and joint optimization. Based on the near-optimal solutions, we then compare two important path restoration schemes applicable in ATM VP networks, named state-independent (SI) and state-dependent (SD) schemes, in terms of spare capacity requirement (SCR), restoration speed, VPI redundancy and node storage capacity. The comparison is based on the common single link failure scenario and 100% restoration. It is found that SI scheme has advantages over the SD scheme if their difference in SCR is small. However, if the difference cannot be ignored and there is no shortage in VPI resources the SD scheme may be a good candidate. Further, fast restoration can be achieved by using bidirectional or group VP restoration.","PeriodicalId":218354,"journal":{"name":"ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220)","volume":"27 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120915718","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}
引用次数: 12
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信