2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)最新文献

筛选
英文 中文
On single-port multinode broadcasting 在单端口多节点广播
V. Dimakopoulos
{"title":"On single-port multinode broadcasting","authors":"V. Dimakopoulos","doi":"10.1109/PACRIM.2001.953526","DOIUrl":"https://doi.org/10.1109/PACRIM.2001.953526","url":null,"abstract":"The advent of distributed-memory multiprocessors has spawned an increasing amount of research in information dissemination problems. Given a network of processors (or nodes) where some of them own pieces of information, the problem is to spread the information to a group of recipients using the links of the network. The term 'collective communications' has been coined to signify the fact that such problems involve more than two nodes. Multinode broadcasting, an important collective communication problem, involves simultaneous broadcastings from all the nodes in a network. We present algorithms for the minimum-time solution of the problem in packet-switched networks that follow the single-port model. In particular, we construct a general algorithm for the solution of the problem in arbitrary multidimensional networks and provide conditions that ensure its optimality.","PeriodicalId":261724,"journal":{"name":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123450886","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
Internet measurements and data study over the regional 互联网测量和区域数据研究
M. Cano, J. Malgosa-Sanahuja, F. Cerdán, J. García-Haro
{"title":"Internet measurements and data study over the regional","authors":"M. Cano, J. Malgosa-Sanahuja, F. Cerdán, J. García-Haro","doi":"10.1109/PACRIM.2001.953652","DOIUrl":"https://doi.org/10.1109/PACRIM.2001.953652","url":null,"abstract":"We present the most significant results studying the Internet network traffic measurements obtained in Ciez@net. Ciez@net is a citizen subnet located in the village of Cieza that belongs to the regional network of the autonomous community of Murcia in Spain. This subnet is one of the firsts pilot experiences of a digital city in Europe and the first in the region of Murcia. The goal is the seamless introduction of the information society in a medium-size population. Access to advanced electronic information services is stimulated or subsidized for effective penetration. These measurements will allow a qualitative and quantitative knowledge of the network traffic in order to achieve a most effective network resource provisioning and Internet traffic forecasting in a real scenario. A suitable dimensioning of the network as well as an adequate provisioning of quality of service to users may depend partially on these results. Measurements were taken from a frame relay link connecting Ciez@net's users to Internet through the main node located in Murcia city. We used a promiscuous network analyzer that avoids interfering with the network traffic. We report the results of the traffic load, network performance, percentage composition of traffic by protocol and type of application, and IP packet size distribution in both, up and down communications streams.","PeriodicalId":261724,"journal":{"name":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","volume":"205 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121885325","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}
引用次数: 17
TCP over satellite link with SACK enhancement 带SACK增强的卫星链路TCP
G. Leerujikul, K. M. Ahmed
{"title":"TCP over satellite link with SACK enhancement","authors":"G. Leerujikul, K. M. Ahmed","doi":"10.1109/PACRIM.2001.953641","DOIUrl":"https://doi.org/10.1109/PACRIM.2001.953641","url":null,"abstract":"This paper uses simulations to study how different kinds of TCP congestion avoidance algorithms behave on the satellite link. A GEO satellite is assumed. For better understanding, TCP over a terrestrial network is first discussed. Then, in the case of TCP over a satellite link, TCP with varying advertised window (awnd) size is employed to observe the behavior of each TCP congestion avoidance algorithm. Our results reveal that SACK outperforms the other congestion avoidance schemes significantly. For the case of TCP SACK over satellite, the size of the advertised window greatly affects its performance, especially when the window size exceeds the TCP standard window size.","PeriodicalId":261724,"journal":{"name":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129942800","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
Cost minimization study in the client-server transmission of semi-elastic flows using Internet 基于Internet的半弹性流客户端-服务器传输成本最小化研究
M. Postigo-Boix, Joan Garcia-Haro, Mónica Aguilar-Igartua
{"title":"Cost minimization study in the client-server transmission of semi-elastic flows using Internet","authors":"M. Postigo-Boix, Joan Garcia-Haro, Mónica Aguilar-Igartua","doi":"10.1109/PACRIM.2001.953554","DOIUrl":"https://doi.org/10.1109/PACRIM.2001.953554","url":null,"abstract":"Because the dramatic growth of the Internet and the requirement of quality of service (QoS) guaranties for the new and future applications, is essential that the Internet that ensures end-to-end QoS. To provide this level of QoS, many protocols have evolved in the last years, and some end-to-end QoS architectures have been proposed to appropriately mix all of these protocols. Also, it is necessary to classify applications by its QoS requirements to understand how they may reserve resources from the network. We review the existing end-to-end QoS protocols and an end-to-end QoS architecture that combines all of them. In addition, we classify Internet data flows by their QoS requirements. We focus our interest on the study of semi-elastic flows and the minimization of their transmission cost. We use a client-server system implementation in the Network Simulator 2 to transmit these flows while reducing the cost to demonstrate that our analytical study can be used in a real scenario in an efficient manner to minimize the cost.","PeriodicalId":261724,"journal":{"name":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","volume":"8 8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130098446","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
CDMA system capacity analysis CDMA系统容量分析
W.C.-Y. Lee, D. Lee
{"title":"CDMA system capacity analysis","authors":"W.C.-Y. Lee, D. Lee","doi":"10.1109/PACRIM.2001.953513","DOIUrl":"https://doi.org/10.1109/PACRIM.2001.953513","url":null,"abstract":"The objective of the study is to provide a comprehensive capacity analysis for the CDMA system. In order to conduct the analysis, a simulator was developed. Key parameters to calculate the CDMA forward and reverse link capacity are discussed. Impacts of these parameters on the system capacity, based on simulation results, are discussed in depth. The CDMA capacity simulator is capable of calculating the capacity of a CDMA system under different system and environmental parameters. In this paper, baseline parameter values and capacity are first defined, then the impact on capacity by varying the values of the parameters is then derived.","PeriodicalId":261724,"journal":{"name":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124801735","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
The condition of improving throughput both of high and low priority at the same time 同时提高高优先级和低优先级吞吐量的条件
K. Yamaoka, K. Katoh, Loong Chee-yuh, Y. Sakai
{"title":"The condition of improving throughput both of high and low priority at the same time","authors":"K. Yamaoka, K. Katoh, Loong Chee-yuh, Y. Sakai","doi":"10.1109/PACRIM.2001.953707","DOIUrl":"https://doi.org/10.1109/PACRIM.2001.953707","url":null,"abstract":"There is a conservation law that states that the sum of the average queuing delays within a set of multiplexed flow is independent of priority control. However with reference to ARQ specifically, we can adopt the idea of \"goodput\" (normalized throughput) to evaluate the efficiency of the transmission. With this, we discover that there are cases when the goodput of high-prioritized and low-prioritized flows can both improve at the same time. To achieve this, we will need routers that are able to handle priority control adaptively. This is confirmed theoretically in this paper, which uses a simple go-back-N model as a basis for calculation.","PeriodicalId":261724,"journal":{"name":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130953186","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
A register-transfer level BIST partitioning approach for ASIC designs 一种用于ASIC设计的寄存器传输级BIST分区方法
L. Yang, J. Muzio
{"title":"A register-transfer level BIST partitioning approach for ASIC designs","authors":"L. Yang, J. Muzio","doi":"10.1109/PACRIM.2001.953576","DOIUrl":"https://doi.org/10.1109/PACRIM.2001.953576","url":null,"abstract":"Various approaches have been proposed to enhance the testability of VLSI by incorporating extra testability features. Recent advances in VLSI technology are motivating changes in the traditional methods of design and test, leading to the integration of design and test activities. Testability, defined as the facility to generate and apply test, is added as a new constraint to the synthesis process and design modifications are proposed to improve testability. One popular design for testability methodology is built-in self-test (BIST) techniques, where pseudo-random pattern generators (RTPG) generate and supply test patterns and multi-input signature registers (MISR) compress test responses. These techniques involve modification of the hardware on the chip so that the chip has the capability to test itself. The goal of this paper is to develop a new improvement method with BIST technique at register transfer level (RTL).","PeriodicalId":261724,"journal":{"name":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128883861","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
Sensitivity of a network traffic prediction algorithm 网络流量预测算法的灵敏度
M. López-Guerrero, J. Gallardo, D. Makrakis, L. Orozco-Barbosa
{"title":"Sensitivity of a network traffic prediction algorithm","authors":"M. López-Guerrero, J. Gallardo, D. Makrakis, L. Orozco-Barbosa","doi":"10.1109/PACRIM.2001.953708","DOIUrl":"https://doi.org/10.1109/PACRIM.2001.953708","url":null,"abstract":"A traffic prediction algorithm is evaluated. It assumes that network traffic is realistically modeled using alpha-stable long-range dependent stochastic processes. This work analyzes the sensitivity of the prediction algorithm with respect to inaccuracies introduced when extracting the model parameters.","PeriodicalId":261724,"journal":{"name":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123756025","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
Reduced-complexity sequence estimation for trellis coded modulation with outer Reed-Solomon codes over ISI channels ISI信道上带有外部Reed-Solomon码的栅格编码调制的低复杂度序列估计
A. Al-Sanie, S. Alshebeili
{"title":"Reduced-complexity sequence estimation for trellis coded modulation with outer Reed-Solomon codes over ISI channels","authors":"A. Al-Sanie, S. Alshebeili","doi":"10.1109/PACRIM.2001.953563","DOIUrl":"https://doi.org/10.1109/PACRIM.2001.953563","url":null,"abstract":"The combined linear-Viterbi equalizer (CLVE) is a class of receivers employing a linear filter before the Viterbi algorithm (VA) in order to shape the original channel impulse response (CIR) to some shorter desired impulse response (DIR) which allows a lower complexity VA. The CLVE technique is originally proposed to reduce the complexity of VA that performs maximum likelihood sequence estimation (MLSE) to uncoded transmission over intersymbol interference (ISI) channels. In this paper, we adopt the CLVE technique to reduce the complexity of VA that performs MLSE to trellis coded transmission over ISI channels. Furthermore, reduced state sequence estimation for high rate concatenated systems with bandwidth efficient trellis inner codes and Reed-Solomon (RS) outer codes over ISI channels is investigated.","PeriodicalId":261724,"journal":{"name":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116024222","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
Efficient and fast predictive block motion estimation for low bit rate video coding 低码率视频编码中高效、快速的预测块运动估计
D. Kwon, P. Driessen
{"title":"Efficient and fast predictive block motion estimation for low bit rate video coding","authors":"D. Kwon, P. Driessen","doi":"10.1109/PACRIM.2001.953673","DOIUrl":"https://doi.org/10.1109/PACRIM.2001.953673","url":null,"abstract":"An efficient block based motion estimation algorithm is proposed and evaluated for performance improvement. Spatio-temporal correlation characteristics and histograms of motion vector magnitude and direction are investigated through computer simulation with test video sequences. Its initial search pixel location is predicted spatially from the neighboring macro block in the current picture frame. In order to utilize center oriented motion vector characteristics from the histogram analysis, fast estimation algorithms such as three step search, diamond search, 2D logarithmic search and 1-D gradient search are evaluated and compared in terms of its search performance with respect to Euclidean search distance. A new predictive 1-D gradient search algorithm is proposed which shows the best results for motion video having moderate motion inside and is applicable for low bit rate video coding such as video telephony. Computer simulation using test video sequences in the H.263 framework shows that the proposed algorithm reduces computation cost measured in the number of SAD calculations. Its compression quality represented in terms of PSNR is improved further than conventional methods by controlling the search termination condition. It is proved that the proposed algorithm improves the search speed as well as PSNR performance of 1-D gradient motion estimation and outperformed other fast algorithms with respect to search speed. Furthermore, its search performance can be traded off with computation cost according to application requirements.","PeriodicalId":261724,"journal":{"name":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122834312","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
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学术官方微信