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

PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.最新文献

筛选
英文 中文
QoS routing in multi-domain networks 多域网络中的QoS路由
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI: 10.1109/PACRIM.2005.1517244
L. Benmohamed, B. Doshi
{"title":"QoS routing in multi-domain networks","authors":"L. Benmohamed, B. Doshi","doi":"10.1109/PACRIM.2005.1517244","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517244","url":null,"abstract":"With increasing number of mission critical applications and associated traffic volume on commercial and DoD IP networks, it is becoming increasingly critical for the network infrastructure to be more aware of the quality of service (in a broad sense of the word) requirements and use this awareness in routing, differential treatment of packets, in management-level resource provisioning and allocation. In this paper, we focus on the implication of these requirements on the routing architecture and protocols. In particular, we argue that the inter domain routing protocols like the border gateway protocol (BGP) and its integration with the interior gateway protocol (IGP) need to account for the diversity in the QoS requirements of the applications, users, and mission. The solution we suggest involves allowing multiple inter-AS routes for the same source destination pair, propagation of multiple routes, and of multiple QoS-affecting metrics in the BGP UPDATE messages. These enhancements allow routes to be matched with application requirements and hence allow satisfaction of applications QoS requirements at minimal cost. In order to keep the solution scalable, we limit the propagation of information to non-dominated routes, and design a small set of QoS metrics. Details of the protocols and quantitative analysis will be presented in future papers. Our approach, along with IntServe and DiffServe based QoS capabilities, and traffic engineering extensions of intra domain routing protocols, provide a framework for end-to-end QoS-aware networking.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132317983","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}
引用次数: 4
A study of a path reconfiguration for QoS multicast protocol for live streaming 面向直播的QoS组播协议路径重构研究
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI: 10.1109/PACRIM.2005.1517365
T. Hashimoto, K. Yamaoka, Y. Sakai
{"title":"A study of a path reconfiguration for QoS multicast protocol for live streaming","authors":"T. Hashimoto, K. Yamaoka, Y. Sakai","doi":"10.1109/PACRIM.2005.1517365","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517365","url":null,"abstract":"Live streaming media are delay-sensitive, and their end-to-end allowable delay is an important factor. The proposed QMLS protocol has focused on an allowable delay, and QMLS routers placed on the multicast tree detect and recover lost packets. These functions reduce retransmission delays, and therefore, the number of packet losses caused by delays exceeding the allowable delay is reduced. However, when the traffic conditions of a certain link on the multicast tree get worse and a bottleneck develops, even the QMLS protocol cannot recover the QoS. Therefore, we propose an efficient path reconfiguration method for a QMLS multicast tree to avoid this inappropriate link. We consider not only the delay on the path but also the number of QMLS routers for path selection. Our method provides a multicast tree, which has tolerance to variations in traffic after path reconfiguration.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130102100","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
A novel framework for network intrusion detection using learning techniques 基于学习技术的网络入侵检测新框架
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI: 10.1109/PACRIM.2005.1517325
Wei Lu
{"title":"A novel framework for network intrusion detection using learning techniques","authors":"Wei Lu","doi":"10.1109/PACRIM.2005.1517325","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517325","url":null,"abstract":"We propose in this paper a novel network intrusion detection framework based on learning techniques. The main goal of our framework is to detect known as well as unknown or novel attacks on networks. Our detection approach combines three learning techniques, namely inductive logic programming (ILP), genetic programming (GP) and Bayesian probability theorem. Each technique detects the intrusion independently and then makes a decision about whether the network behavior is intrusive or normal. A voting mechanism is proposed to give the final intrusion decision. In theory, our framework has lower false alarm rate than other approaches since we use the voting mechanism and combine several detection techniques.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134231684","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
Functional units power gating in SMT processors SMT处理器中的功能单元功率门控
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI: 10.1109/PACRIM.2005.1517241
H. Homayoun, K. Li, S. Rafatirad
{"title":"Functional units power gating in SMT processors","authors":"H. Homayoun, K. Li, S. Rafatirad","doi":"10.1109/PACRIM.2005.1517241","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517241","url":null,"abstract":"Power consumption has emerged as a primary concern in processor design constraints. Power-aware techniques are being applied at all levels of circuit and system design. These techniques aim at reducing power or energy dissipation in all types of computer equipments while meeting a desired throughput. At the architectural level, power-aware design has been an active area of research in the last decade for superscalar processors. Simultaneous multithreading processor (SMT), introduced as a complementary architecture to superscalar to increase throughput, has received less attention in the context of low-power design techniques. In SMT processors functional units are one of the major power consumers. In this paper we first study the opportunity for reducing the power consumption of functional units. Our results show that functional units are idle for a significant portion of the total execution cycle. Then we reuse and evaluate a microarchitectural technique to reduce functional unit power through power gating which has been recently proposed for superscalar processors. We show that in SMT processors, this technique can reduce floating point unit power considerably while maintaining performance.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134521070","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
Decision regions for weak PSK signals with a novel M-ary detection criterion 基于m -玛利检测准则的弱PSK信号判定区域
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI: 10.1109/PACRIM.2005.1517220
S. Choi, Seokho Yoon, I. Song, Jinsoo Bae, Sung Yong Kim
{"title":"Decision regions for weak PSK signals with a novel M-ary detection criterion","authors":"S. Choi, Seokho Yoon, I. Song, Jinsoo Bae, Sung Yong Kim","doi":"10.1109/PACRIM.2005.1517220","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517220","url":null,"abstract":"In this paper, we derive and obtain specific examples of the decision regions of a novel detection criterion for weak M-ary signals. In the sense of minimizing the error probability, the detection criterion is optimum when the signal strength approaches zero. Assuming phase shift keying for convenience, specific decision regions are obtained for the detection of weak signals. It is shown that the proposed detection criterion has almost the same decision regions as the maximum likelihood detection criterion when the strength of signals are small.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132884747","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
Proposal of multipath routing method focusing on reducing delay jitter 提出了一种以减少时延抖动为重点的多径路由方法
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI: 10.1109/PACRIM.2005.1517284
T. Okuyama, K. Yasukawa, K. Yamaoka
{"title":"Proposal of multipath routing method focusing on reducing delay jitter","authors":"T. Okuyama, K. Yasukawa, K. Yamaoka","doi":"10.1109/PACRIM.2005.1517284","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517284","url":null,"abstract":"A new approach to reducing delay jitter that uses multipath routing and redundant packets is described. Delay jitter causes data loss at the application layer and prevents the smooth provision of real-time multimedia communication services. In this paper, a policy of multipath routing for reducing delay jitter is discussed and an algorithm is proposed that solve the problem of selecting two paths for reducing delay jitter. The algorithm outputs a set of paths that satisfy a specified delay constraint; they share a few nodes and have a small delay difference. Simulation results showed that the set of paths is more suitable for reducing delay jitter than those selected using the routing method of a path diversity scheme.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132187922","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}
引用次数: 4
A new improved detector for the V-BLAST system V-BLAST系统的新型改进型探测器
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI: 10.1109/PACRIM.2005.1517222
S. F. Fard, C. Tellambura
{"title":"A new improved detector for the V-BLAST system","authors":"S. F. Fard, C. Tellambura","doi":"10.1109/PACRIM.2005.1517222","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517222","url":null,"abstract":"This paper proposes a new method for symbol detection in the Vertical Bell Labs layered space-time (V-BLAST) system. The performance of V-BLAST is limited by the worst subchannel, i.e. the first iteration, the diversity order of which is N/sub r/ - N/sub t/ + 1 where N/sub t/ and N/sub r/ are the number of transmit and receive antennas. A diversity order of N/sub r/ - N/sub t/ + 1 + T is achievable by delaying decisions by T stages. Considering the statistical properties of the error patterns, we present a new algorithm to delay the decisions to achieve higher diversity orders with reduced computational complexity. The performance-complexity measure of the proposed algorithm is compared with that of the V-BLAST detector and sphere decoder.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132739003","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
Recursive multiuser detection for DS-UWB systems DS-UWB系统的递归多用户检测
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI: 10.1109/PACRIM.2005.1517344
Yihai H. Zhang, Wu-Sheng Lu, T. Gulliver
{"title":"Recursive multiuser detection for DS-UWB systems","authors":"Yihai H. Zhang, Wu-Sheng Lu, T. Gulliver","doi":"10.1109/PACRIM.2005.1517344","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517344","url":null,"abstract":"Multiple access UWB communications has recently attracted a great deal of attention. In a multiple access UWB system, multiuser detection is desirable to effectively reduce multiple access interference (MAI). A suboptimal ML detector based on a recursive convex relaxation strategy is proposed for DS-UWB systems in this paper. This algorithm employs a recursive approach to deduce a sequence of reduced-size quadratic problems, in each of which only the most probable information bits are detected. Performance results are presented which show that the proposed detector provides near-optimal performance relative to the ML detector with considerably reduced computational complexity.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133206738","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
Bandlimited FIR differentiators with high stopband attenuation and low stopband energy 带限FIR微分器具有高阻带衰减和低阻带能量
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI: 10.1109/PACRIM.2005.1517347
T. W. Fox
{"title":"Bandlimited FIR differentiators with high stopband attenuation and low stopband energy","authors":"T. W. Fox","doi":"10.1109/PACRIM.2005.1517347","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517347","url":null,"abstract":"This paper presents a method for the design of bandlimited finite duration impulse response (FIR) differentiators with high stopband attenuation and low stopband energy. These bandlimited differentiators have significantly higher stopband attenuation than bandlimited least squares differentiators while achieving significantly lower stopband energy than bandlimited equiripple differentiators. Bandlimited differentiators with either equiripple or least squares frequency response characteristics can still be obtained using the method presented in this paper.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128864988","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
QoS control method to reduce resource reservation failure in datagrid applications 在数据网格应用中减少资源预留失败的QoS控制方法
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI: 10.1109/PACRIM.2005.1517330
M. Noro, K. Baba, S. Shimojo
{"title":"QoS control method to reduce resource reservation failure in datagrid applications","authors":"M. Noro, K. Baba, S. Shimojo","doi":"10.1109/PACRIM.2005.1517330","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517330","url":null,"abstract":"Large scale grid computing uses a broadband link for high performance computing. However, since this approach is extremely costly, it would be more ideal to use a network that is inexpensive and that at the same time guarantees good computation quality. While the scheduler of grid can reserve many computing resources to achieve this goal, the prevention of resource reservation failure remains to be an issue at hand. We examined the dynamic bandwidth adjustment method used in DataGrid application. Guaranteeing the quality of each data transmission, this method operates by reserving bandwidth for each data flow using the Diffserv AF service and adjusting reserved bandwidth periodically. Three methods, the EF based method, the AF based method and the proposed method, were simulated for performance comparison and evaluation. The results show that the proposed method had the same, if not better, performance.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"20 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127809740","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}
引用次数: 8
首页 上一页 下一页 尾页
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学术官方微信