{"title":"A performance evaluation of fully adaptive wormhole routing including selection function choice","authors":"L. Schwiebert","doi":"10.1109/PCCC.2000.830309","DOIUrl":"https://doi.org/10.1109/PCCC.2000.830309","url":null,"abstract":"Many adaptive routing algorithms have been proposed for wormhole-routed interconnection networks. Comparatively little work, however has been done on determining how the selection function affects the performance of an adaptive routing algorithm. In this paper we present a detailed simulation study of various selection functions for four differentially adaptive wormhole routing algorithms for 2D meshes. The simulation results show that the choice of selection function has a significant effect on the average message latency and saturation behavior In fact, it appears that changing the selection function can have a greater effect than changing the routing algorithm. In addition, the best selection function for one adaptive routing algorithm may not be the best choice for another adaptive routing algorithm. An explanation and interpretation of the results is provided.","PeriodicalId":387201,"journal":{"name":"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130150422","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}
{"title":"QoS for interactive network applications under priority assignment control scheme","authors":"T. Tan, Cheng Tee Hiang, S. Bose","doi":"10.1109/PCCC.2000.830349","DOIUrl":"https://doi.org/10.1109/PCCC.2000.830349","url":null,"abstract":"The Internet is being increasingly used to support a wide range of applications that are subject to QoS constraints for proper operation. Widespread resource sharing, highly dynamic workload, great diversity in network bandwidth, the absence of resource reservation and lack of QoS guarantees characterize many existing networks. These properties are not favorable for many interactive or real-time multimedia applications. In this paper, we focus on finding a possible priority queuing solution to improve the QoS for interactive applications. We propose two priority assignment control schemes to improve the packet queuing delay, which is the dominant delay component in the information transfer process.","PeriodicalId":387201,"journal":{"name":"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116801239","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}
{"title":"VoIP support on differentiated services using expedited forwarding","authors":"A. Tyagi, J. Muppala, H. D. Meer","doi":"10.1109/PCCC.2000.830365","DOIUrl":"https://doi.org/10.1109/PCCC.2000.830365","url":null,"abstract":"Differentiated services (Diffserv) is a new service model proposed by the Internet Engineering Task Force (IETF) to provide an end-to-end quality of service (QoS) support for multimedia applications. One key element of Diffserv is the definition of different per hop behaviors (PHB) like Expedited Forwarding (EF) and Assured Forwarding (AF). EF can be used to build a low loss and low delay service to support Internet telephony and video conferencing. In this paper we study the performance of Voice over Internet Protocol (VoIP) over Diffserv using EF. We compare the delay and jitter performance of the traffic generated by different standard voice codec algorithms used for compressing a voice signal.","PeriodicalId":387201,"journal":{"name":"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123935801","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}
{"title":"MARS load analysis of streaming service on IP multicast over ATM","authors":"K. Sugisono, M. Yamamoto, H. Ikeda","doi":"10.1109/PCCC.2000.830314","DOIUrl":"https://doi.org/10.1109/PCCC.2000.830314","url":null,"abstract":"The Internet is now a widely used network and is expected to accommodate many kinds of services in an integrated manner. One of these promising services is a streaming service such as video or radio streaming. In the Internet, this streaming service should be supported by multicast communications, i.e. IP multicast, in order to reduce total bandwidth necessary for distributing streaming programs. In future network infrastructure, ATM technology should be implemented in a backbone network. So, in order to integrate opposite-side two network architecture. IP and ATM, IP Multicast over ATM technology is proposed in IETF. In this technology, Multicast Address Resolution Server (MARS) is used for address resolution generally. On changing group membership, MARS receives control message informing membership change from ATM end points, edge routers. Multicast group may grow up to thousands of recipient in the case of streaming service. Overload of MARS due to message concentration is one of the most serious problems for streaming service in the Internet. In this paper we analyze load for MARS brought by control message according to multicast group management for streaming service. With numerical results, we discuss about suitable network configuration for scalable streaming service.","PeriodicalId":387201,"journal":{"name":"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)","volume":"799 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127226305","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}
{"title":"Performance analysis of the I-structure software cache on multi-threading systems","authors":"Wen-Yen Lin, J. Gaudiot, J. Amaral, G. Gao","doi":"10.1109/PCCC.2000.830305","DOIUrl":"https://doi.org/10.1109/PCCC.2000.830305","url":null,"abstract":"Non-blocking multithreaded execution models have been proposed as an effective means to overlap computation and communication in distributed memory systems without any hardware support. Even with the capability of latency tolerance in these execution models, each remote memory request still incurs the cost of communication interface overhead. We therefore designed and implemented our I-structure software cache system to further reduce communication overhead for non-blocking multithreaded execution. In this paper, we present analytical models for the performances of a multithreading system with and without I-structure software cache support. We compare our model's prediction with our experimental results on an existing multithreaded architecture platform. The analytical models allow us to predict at what ratio of communication latency/processing speed the implementation of I-structure software cache becomes profitable for applications with different characteristics.","PeriodicalId":387201,"journal":{"name":"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127740430","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}
{"title":"A proposal of an access persistence protocol over data wireless networks","authors":"W. Ajib, P. Godlewski","doi":"10.1109/PCCC.2000.830294","DOIUrl":"https://doi.org/10.1109/PCCC.2000.830294","url":null,"abstract":"This paper considers the MAC layer in General Packet Radio Service (GPRS) system. We present the MAC procedures used to enable multiple mobile stations to share a common transmission medium that may contain many radio physical channels. This layer makes use of slotted ALOHA protocol combined with a specific retransmission mechanism in order to establish the physical connection. The access persistence control procedure, which is the principal subject of this paper, is described and analyzed. The number of retransmission attempts requested to successfully transmit the access request and the delay of transmission are calculated. In this paper, a complementary access persistence control mechanism is proposed in order to improve the performance of MAC layer. The new proposal additional mechanism permits to avoid the mixture of retransmitted access request and the new ones. Consequently, it decreases the number of transmission attempts needed to successfully transmit an access request. Thus, it reduces the transmission delay of one access request and the access requests blocking percent.","PeriodicalId":387201,"journal":{"name":"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115248621","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}
Chinmay Padhye, Kenneth J. Christensen, Wilfrido Moreno
{"title":"A new adaptive FEC loss control algorithm for voice over IP applications","authors":"Chinmay Padhye, Kenneth J. Christensen, Wilfrido Moreno","doi":"10.1109/PCCC.2000.830332","DOIUrl":"https://doi.org/10.1109/PCCC.2000.830332","url":null,"abstract":"Packet loss causes degradation in the quality of voice over IP (VOIP) applications. Forward error correction (FEC) methods which add redundant information to voice packets can be used to minimize the effects of packet loss. While these methods can reduce the effects of packet loss, they increase the amount of bandwidth used by a voice stream. This paper builds on existing work in adaptive FEC control algorithms to better control the amount of redundancy. The new adaptive FEC \"USF algorithm\" considers the history of packet losses in the network before changing the amount of redundancy and also does not react to burst losses. The performance of the USF algorithm is studied using a simulation model. The USF algorithm is able to maintain a loss rate one-half to one-third the loss rate maintained by the current algorithm for Internet traces and for network loss rates between 7% and 20% for synthetic traces.","PeriodicalId":387201,"journal":{"name":"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115638589","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}
{"title":"Communication performance over a gigabit Ethernet network","authors":"P. Farrell, H. Ong","doi":"10.1109/PCCC.2000.830317","DOIUrl":"https://doi.org/10.1109/PCCC.2000.830317","url":null,"abstract":"Cluster computing imposes heavy demands on the communication network. Gigabit Ethernet technology can provide the required bandwidth to meet these demands. However, it has also shifted the communication bottleneck from network media to protocol processing. In this paper, we present an overview of Gigabit Ethernet technology and study the end-to-end Gigabit Ethernet communication bandwidth and latency. Performance graphs are collected using Net Pipe which clearly show the performance characteristics of TCP/IP over Gigabit Ethernet. These indicate the impact of a number of factors such as processor speeds, network adaptors, versions of the Linux Kernel and device drivers, and TCP/IP tuning on the performance of Gigabit Ethernet between two Pentium 11/350 PCs. Among the important conclusions are the marked superiority of the 2.1.121 and later development kernels and 2.2x production kernels of Linux and that the ability to increase the MTU beyond the Ethernet standard of 1500 could significantly enhance the throughput attainable.","PeriodicalId":387201,"journal":{"name":"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126497546","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}
{"title":"A MAC protocol supporting TCP in DS-CDMA PCNs","authors":"Ming T. Liu, M.T. Liu, M. E. Muller, Junfeng He","doi":"10.1109/PCCC.2000.830295","DOIUrl":"https://doi.org/10.1109/PCCC.2000.830295","url":null,"abstract":"A MAC protocol for CDMA PCNs is proposed and studied which is shown to provide a better upper layer performance in the wireless applications. The protocol is based on Preamble Signaling Access which uses a Slotted-ALOHA-like scheme. Markovian chain models are used to analyze the performance of this protocol. Using the modeling, we have provided performance insight comparing the service received by individual user and the whole system under different system configurations. Several performance measures, such as the packet loss, data throughput and data transmission delay are investigated. From the analytical models and simulation results presented in this paper, one can gain interesting insight and useful guidance for incorporating TCP/IP protocol suite into Personal Communication Networks.","PeriodicalId":387201,"journal":{"name":"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116883991","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}
Junwei Cao, D. Kerbyson, E. Papaefstathiou, G. Nudd
{"title":"Performance modeling of parallel and distributed computing using PACE","authors":"Junwei Cao, D. Kerbyson, E. Papaefstathiou, G. Nudd","doi":"10.1109/PCCC.2000.830354","DOIUrl":"https://doi.org/10.1109/PCCC.2000.830354","url":null,"abstract":"There is a wide range of performance models being developed for the performance evaluation of parallel and distributed systems. A performance modelling approach described in this paper is based on a layered framework of the PACE methodology. With an initial implementation system, the model described by a performance specification language, CHIP/sup 3/S, can provide a capability for rapid calculation of relevant performance information without sacrificing accuracy of predictions. An example of the performance evaluation of an ASCI kernel application, Sweep3D, is used to illustrate the approach. The validation results on different parallel and distributed architectures with different problem sizes show a reasonable accuracy (approximately 12% error at most) can be obtained, allows cross-platform comparisons to be easily undertaken, and has a rapid evaluation time (typically less than 2s).","PeriodicalId":387201,"journal":{"name":"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117272510","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}