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

Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing最新文献

筛选
英文 中文
Performance analysis of New Zealand websites using HTTP header values 使用HTTP头值的新西兰网站的性能分析
Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2011-10-03 DOI: 10.1109/PACRIM.2011.6032862
Rajalaxmi Chandran, S. Manoharan
{"title":"Performance analysis of New Zealand websites using HTTP header values","authors":"Rajalaxmi Chandran, S. Manoharan","doi":"10.1109/PACRIM.2011.6032862","DOIUrl":"https://doi.org/10.1109/PACRIM.2011.6032862","url":null,"abstract":"The simplest way to maximize the use of the available broadband capacity is to compress data transfers and cache data whenever possible. The HTTP protocol allows both compression and caching, benefiting both servers (in terms of bandwidth requirements and lighter load) and clients (in terms of faster downloads). In this paper, we investigate some of the top-ranking websites within New Zealand to see how well they are setup for network performance. We find a surprisingly large number of sites that are not well-setup to cater for compression and caching. We see that simple tuning of these servers to take advantage of compression and caching will enable better use of the network bandwidth. Though this study is limited to New Zealand, similar analysis could be made of other servers irrespective of their location.","PeriodicalId":236844,"journal":{"name":"Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127255350","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
Link-sharing method of buffer in direct-connection network 直连网络中缓冲区的链路共享方法
Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2011-10-03 DOI: 10.1109/PACRIM.2011.6032894
Naohisa Fukase, Y. Miura, S. Watanabe
{"title":"Link-sharing method of buffer in direct-connection network","authors":"Naohisa Fukase, Y. Miura, S. Watanabe","doi":"10.1109/PACRIM.2011.6032894","DOIUrl":"https://doi.org/10.1109/PACRIM.2011.6032894","url":null,"abstract":"In this paper, we propose the sharing method that shares a memory between some physical link by using the multi port memory in wormhole router for NoC(Network on Chip) as efficient usage of the flit buffers. If the proposed method is implemented by conventional method, hardware cost increase greatly. Therefore, we implement proposed method by using two methods that a memory is shared by block size and a memory is controlled by list structure. In this paper, we show the effectivity of proposed method by simple estimation of hardware cost and evaluation of communication performance by software simulation.","PeriodicalId":236844,"journal":{"name":"Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115078825","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
Multicast group aggregation methods to decrease IGMP load for IPTV services and their performance evaluation 减少IPTV业务IGMP负载的组播组聚合方法及其性能评价
Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2011-10-03 DOI: 10.1109/PACRIM.2011.6032962
Shingo Matsuura, M. Shimamura, K. Iida
{"title":"Multicast group aggregation methods to decrease IGMP load for IPTV services and their performance evaluation","authors":"Shingo Matsuura, M. Shimamura, K. Iida","doi":"10.1109/PACRIM.2011.6032962","DOIUrl":"https://doi.org/10.1109/PACRIM.2011.6032962","url":null,"abstract":"Shortening the channel change time is a critical issue in Internet protocol television (IPTV), and many methods have been proposed to address this issue. However, since these methods do not take into account the Internet group management protocol (IGMP) load on multicast routers, the number of IGMP packets will increase significantly, which will cause network instability. To investigate the effect of IGMP load, we performed a preliminary experiment that revealed that a multicast router does not work properly when it receives bursts of IGMP packets. To decrease the IGMP load as well as shortening the channel change time, we propose a multicast group aggregation method. Through simulation experiments, we show the effectiveness of the method.","PeriodicalId":236844,"journal":{"name":"Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122524681","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
Interference minimization approach for distributed beamforming in cognitive two-way relay networks 认知双向中继网络中分布式波束形成干扰最小化方法
Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2011-10-03 DOI: 10.1109/PACRIM.2011.6032950
S. H. Safavi, Ramezan Ali Sadegh Zadeh, V. Jamali, S. Salari
{"title":"Interference minimization approach for distributed beamforming in cognitive two-way relay networks","authors":"S. H. Safavi, Ramezan Ali Sadegh Zadeh, V. Jamali, S. Salari","doi":"10.1109/PACRIM.2011.6032950","DOIUrl":"https://doi.org/10.1109/PACRIM.2011.6032950","url":null,"abstract":"This paper investigates the problem of interference minimization which restricts the secondary users (SUs) quality of service (QoS) while coexisting the primary users (PUs), using distributed beamforming for a bidirectional cognitive relay network. We consider a network which consists of two secondary transceivers and K cognitive relay nodes and a primary network with a transmitter and receiver, all equipped with single-antenna. For effective use of spectrum we propose a two-step two-way relaying for cognitive relay networks. Our aim is to design the beamforming coefficients for a bidirectional cognitive relay network through interference minimization approach subject to two constraints on each transceiver QoS which is solved using convex optimization. Our simulation results demonstrate that our distributed relay beamforming scheme improve network performance significantly so that the interference power is decreased by increasing the number of relay nodes while QoS of the secondary network is guaranteed.","PeriodicalId":236844,"journal":{"name":"Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122788890","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}
引用次数: 23
Performance analysis of relay-assisted mobile-to-mobile communication in double or cascaded Rayleigh fading 双瑞利衰落或级联瑞利衰落下中继辅助移动对移动通信的性能分析
Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2011-10-03 DOI: 10.1109/PACRIM.2011.6032967
I. Dey, R. Nagraj, G. Messier, S. Magierowski
{"title":"Performance analysis of relay-assisted mobile-to-mobile communication in double or cascaded Rayleigh fading","authors":"I. Dey, R. Nagraj, G. Messier, S. Magierowski","doi":"10.1109/PACRIM.2011.6032967","DOIUrl":"https://doi.org/10.1109/PACRIM.2011.6032967","url":null,"abstract":"We consider a mobile-to-mobile (M2M) communication scenario in a crowded city or suburban area, where each mobile terminal is surrounded by a group of scatterers. The non-line of sight (NLOS) communication channel is modelled as non-frequency selective double or cascaded Rayleigh distributed. Cooperative relaying with amplify and forward (AF) protocol is used to improve the overall system performance. System performance is investigated in two sets. In the first case, the source (S) to destination (D) direct link is double Rayleigh distributed. The relay (R) or access point is assumed to be located above rooftop level and the cooperative links are flat Rayleigh faded. In the second case, both the direct and cooperative links are considered double Rayleigh faded. Modelling and simulations are used to evaluate overall performance in conditions, when the cooperative link is uncorrelated, partially correlated and completely correlated with the direct link.","PeriodicalId":236844,"journal":{"name":"Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122955876","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
A simple approach for designing online testable reversible circuits 一种设计在线可测试可逆电路的简单方法
Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2011-10-03 DOI: 10.1109/PACRIM.2011.6032872
N. M. Nayeem, J. Rice
{"title":"A simple approach for designing online testable reversible circuits","authors":"N. M. Nayeem, J. Rice","doi":"10.1109/PACRIM.2011.6032872","DOIUrl":"https://doi.org/10.1109/PACRIM.2011.6032872","url":null,"abstract":"This paper presents a simple technique to convert an ESOP-based reversible circuit into an online testable circuit. The technique does not require redesigning the whole circuit for integrating the testability feature, and no new garbage outputs are produced other than the garbage outputs needed for the ESOP-circuit. With a little extra hardware cost, the resultant circuit can detect online any single-bit errors. Experimental results show that the proposed technique can achieve an improvement of up to 58% in quantum cost and 99% in garbage outputs in average, compared to the previous work.","PeriodicalId":236844,"journal":{"name":"Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116879157","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}
引用次数: 20
Performance comparison of hierarchical interconnection networks 分层互连网络的性能比较
Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2011-10-03 DOI: 10.1109/PACRIM.2011.6032891
M. Abd-El-Barr, T. Al-Somani
{"title":"Performance comparison of hierarchical interconnection networks","authors":"M. Abd-El-Barr, T. Al-Somani","doi":"10.1109/PACRIM.2011.6032891","DOIUrl":"https://doi.org/10.1109/PACRIM.2011.6032891","url":null,"abstract":"Hierarchical interconnection networks (HINs) employ multiple levels in which Lower-level networks provide local communication while higher-level networks facilitate remote communication. HINs are cost effectiveness and fault-tolerant. They can be classified into two classes. The first class includes HINs that are constructed using nodes and/or links replication. The second class uses standby interface nodes. This paper provides performance comparison of HINs in terms of network degree, diameter, cost and packing density. The outcome of this study shows that the Root-Folded Heawood (RFH) and the Flooded Heawood (FloH) provide the best network cost, defined as the product of network diameter and degree. The study also shows that HFCube(n, n) provide the best packing density, i.e. the smallest chip area required for VLSI implementation.","PeriodicalId":236844,"journal":{"name":"Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117101383","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
Adaptive quantization for transform-domain Wyner-Ziv residual coding 变换域Wyner-Ziv残差编码的自适应量化
Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2011-10-03 DOI: 10.1109/PACRIM.2011.6033017
Hyon-Myong Cho, H. Shim, B. Jeon
{"title":"Adaptive quantization for transform-domain Wyner-Ziv residual coding","authors":"Hyon-Myong Cho, H. Shim, B. Jeon","doi":"10.1109/PACRIM.2011.6033017","DOIUrl":"https://doi.org/10.1109/PACRIM.2011.6033017","url":null,"abstract":"As prediction processes are not in Wyner-Ziv encoder but in decoder, the Wyner-Ziv coding cannot perform better than conventional video encoder. In order to improve its compression efficiency, Wyner-Ziv residual coding has been proposed which implements a prediction process with low complexity in the encoder. Although it has a good performance in pixel domain, it does not have any improvements in transform domain, since pre-defined quantization matrices are not compatible with the Wyner-Ziv residual coding. In this paper, we propose a new quantization method for transform domain Wyner-Ziv residual coding. Experimental result shows up to 36% gain in BDBR and 3.09dB gain in BDPSNR.","PeriodicalId":236844,"journal":{"name":"Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128437035","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
Methods for XML phrase query processing over a collection of XML documents 对XML文档集合进行XML短语查询处理的方法
Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2011-10-03 DOI: 10.1109/PACRIM.2011.6032922
T. Paul, Md. Humayun Kabir, M. M. A. Prodhan, M. Chowdhury
{"title":"Methods for XML phrase query processing over a collection of XML documents","authors":"T. Paul, Md. Humayun Kabir, M. M. A. Prodhan, M. Chowdhury","doi":"10.1109/PACRIM.2011.6032922","DOIUrl":"https://doi.org/10.1109/PACRIM.2011.6032922","url":null,"abstract":"Techniques to evaluate XML queries with multiple keywords having fixed relations, such as conjunction, disjunction, ancestor-descendant, and preceding-following, have already been developed. However, an English phrase with a large number of keywords cannot be mapped only with the above keyword relations. A new method to evaluate such natural phrase as the query over a collection of XML documents is necessary. As per our knowledge, such method to evaluate natural phrases in multiple XML documents does not exist. In this paper, we propose a new method to evaluate phrase queries. The inverted file structure and the query processing algorithms have been modified for this purpose. Our prototype implementation of XML query processing has demonstrated that our method can effectively evaluate phrase queries.","PeriodicalId":236844,"journal":{"name":"Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123237725","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
Effects of routing granularity on communication performance in OpenFlow networks 路由粒度对OpenFlow网络通信性能的影响
Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2011-10-03 DOI: 10.1109/PACRIM.2011.6032960
Hiroyuki Kudou, M. Shimamura, T. Ikenaga, M. Tsuru
{"title":"Effects of routing granularity on communication performance in OpenFlow networks","authors":"Hiroyuki Kudou, M. Shimamura, T. Ikenaga, M. Tsuru","doi":"10.1109/PACRIM.2011.6032960","DOIUrl":"https://doi.org/10.1109/PACRIM.2011.6032960","url":null,"abstract":"The explosive growth of its usage means that the Internet has to become more flexible in order to handle a huge traffic volume efficiently and a variety of users requirement adaptively. OpenFlow architecture is a promising technology for flexible switching and routing to achieve this. In OpenFlow networks, OpenFlow switches can change their action on the basis of header information of an incoming packet. This allows to control traffic flows on the basis of various routing granularities such as destination IP address, TCP connection, etc. While a fine-grained control can increase routing optimality, its control overhead may decrease the communication performance. In this paper, therefore, the impact of routing granularity on communication performance is investigated through simulation evaluations. The results suggest dynamic changes in the routing granularity be considered for efficient traffic control.","PeriodicalId":236844,"journal":{"name":"Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121189271","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
下一页 尾页
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学术官方微信