Pub Date : 1998-07-19DOI: 10.1109/MASCOT.1998.693685
Jehan-Francois Pâris, Steven W. Carter, D. Long
Broadcasting protocols can improve the efficiency of video on demand services by reducing the bandwidth required to transmit videos that are simultaneously watched by many viewers. We present two broadcasting protocols that achieve nearly the same low bandwidth as the best extant broadcasting protocol while guaranteeing a lower maximum access time. Our first protocol, cautious harmonic broadcasting, requires somewhat more bandwidth than our second protocol, quasi-harmonic broadcasting, but is also much simpler to implement.
{"title":"Efficient broadcasting protocols for video on demand","authors":"Jehan-Francois Pâris, Steven W. Carter, D. Long","doi":"10.1109/MASCOT.1998.693685","DOIUrl":"https://doi.org/10.1109/MASCOT.1998.693685","url":null,"abstract":"Broadcasting protocols can improve the efficiency of video on demand services by reducing the bandwidth required to transmit videos that are simultaneously watched by many viewers. We present two broadcasting protocols that achieve nearly the same low bandwidth as the best extant broadcasting protocol while guaranteeing a lower maximum access time. Our first protocol, cautious harmonic broadcasting, requires somewhat more bandwidth than our second protocol, quasi-harmonic broadcasting, but is also much simpler to implement.","PeriodicalId":272859,"journal":{"name":"Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132790074","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}
Pub Date : 1998-07-19DOI: 10.1109/MASCOT.1998.693682
L. Alcuri, G. D'Acquisto
At the input of an ATM network are present some different types of sources with different characteristics, particularly as the bandwidth concern. This paper presents a very efficient method for the real time allocation of resources in ATM networks with a prescribed grade of quality of service. It is known that the exact solution of this problem is quite cumbersome so it is impossible use it in a real time environment. We present an approximate but very fast method that is useful in such situation.
{"title":"Real time resource allocation in an ATM network","authors":"L. Alcuri, G. D'Acquisto","doi":"10.1109/MASCOT.1998.693682","DOIUrl":"https://doi.org/10.1109/MASCOT.1998.693682","url":null,"abstract":"At the input of an ATM network are present some different types of sources with different characteristics, particularly as the bandwidth concern. This paper presents a very efficient method for the real time allocation of resources in ATM networks with a prescribed grade of quality of service. It is known that the exact solution of this problem is quite cumbersome so it is impossible use it in a real time environment. We present an approximate but very fast method that is useful in such situation.","PeriodicalId":272859,"journal":{"name":"Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132318622","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}
Pub Date : 1998-07-19DOI: 10.1109/MASCOT.1998.693686
M. Frank, P. Martini
The inclusion of integrated quality of service (QoS) support in existing and future networking technologies and protocols has become a highly relevant area of research. But the variety and heterogeneity of different approaches for QoS support on different protocol layers result in the need of a solution with an end-to-end overview and regulation of data flows in a controllable subnetwork. The ROBIN (Regulation Of Bandwidth in Intra-Networks) concept introduced in this paper is such a mechanism which controls the bandwidth used by data flows in heterogeneous networks in case of network congestion. This paper presents an overview of the concept and reports on the state of simulative performance analysis work on ROBIN.
在现有和未来的网络技术和协议中包含集成服务质量(QoS)支持已成为一个高度相关的研究领域。但是，在不同协议层上支持QoS的不同方法的多样性和异质性导致需要一种具有端到端概览和可控制子网中数据流规则的解决方案。本文提出的ROBIN (Regulation Of Bandwidth in intra networks)概念就是在网络拥塞的情况下，控制异构网络中数据流所使用的带宽的一种机制。本文概述了ROBIN仿真性能分析的概念，并报告了ROBIN仿真性能分析工作的现状。
{"title":"Performance analysis of an end-to-end bandwidth regulation scheme","authors":"M. Frank, P. Martini","doi":"10.1109/MASCOT.1998.693686","DOIUrl":"https://doi.org/10.1109/MASCOT.1998.693686","url":null,"abstract":"The inclusion of integrated quality of service (QoS) support in existing and future networking technologies and protocols has become a highly relevant area of research. But the variety and heterogeneity of different approaches for QoS support on different protocol layers result in the need of a solution with an end-to-end overview and regulation of data flows in a controllable subnetwork. The ROBIN (Regulation Of Bandwidth in Intra-Networks) concept introduced in this paper is such a mechanism which controls the bandwidth used by data flows in heterogeneous networks in case of network congestion. This paper presents an overview of the concept and reports on the state of simulative performance analysis work on ROBIN.","PeriodicalId":272859,"journal":{"name":"Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247)","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133048337","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}
Pub Date : 1998-07-19DOI: 10.1109/MASCOT.1998.693695
L. Vekiarides, D. Finkel
Network capacity planning is the practice of anticipating the future needs of networked users and designing the network accordingly. This paper presents a tool called NetCap, which takes a unique approach to the problem of capacity planning for Ethernet LANs. The tool, which runs on standard Intel-based PCs running Windows NT, takes advantage of live network utilization data from Simple Network Management Protocol agents on the LAN to perform an analysis of the present LAN condition. In addition, using the same utilization data, it allows a network administrator to describe additions to the LAN and then predicts the future performance of the LAN based on the prescribed changes. To make the analysis, the tool uses proven analysis techniques. The results from using the tool for a month in a real world network environment are also discussed.
{"title":"NetCap: a tool for the capacity planning of Ethernet LANs","authors":"L. Vekiarides, D. Finkel","doi":"10.1109/MASCOT.1998.693695","DOIUrl":"https://doi.org/10.1109/MASCOT.1998.693695","url":null,"abstract":"Network capacity planning is the practice of anticipating the future needs of networked users and designing the network accordingly. This paper presents a tool called NetCap, which takes a unique approach to the problem of capacity planning for Ethernet LANs. The tool, which runs on standard Intel-based PCs running Windows NT, takes advantage of live network utilization data from Simple Network Management Protocol agents on the LAN to perform an analysis of the present LAN condition. In addition, using the same utilization data, it allows a network administrator to describe additions to the LAN and then predicts the future performance of the LAN based on the prescribed changes. To make the analysis, the tool uses proven analysis techniques. The results from using the tool for a month in a real world network environment are also discussed.","PeriodicalId":272859,"journal":{"name":"Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115850827","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}
Pub Date : 1998-07-19DOI: 10.1109/MASCOT.1998.693690
A. Waheed, Jerry C. Yan
This paper presents a model to evaluate the performance and overhead of parallelizing sequential code using compiler directives for multiprocessing on distributed shared memory (DSM) systems. We parallelized the sequential implementation of NAS benchmarks using native Fortran77 compiler directives on an Origin2000, which is a DSM system. We report measurement based performance of these parallelized benchmarks from four perspectives: efficacy of parallelization process; scalability; parallelization overhead; and comparison with hand-parallelized and -optimized version of the same benchmarks. Our results indicate that sequential programs can conveniently be parallelized for DSM systems using compiler directives but realizing performance gains as predicted by the performance model depends primarily on minimizing architecture-specific data locality overhead.
{"title":"Performance modeling and measurement of parallelized code for distributed shared memory multiprocessors","authors":"A. Waheed, Jerry C. Yan","doi":"10.1109/MASCOT.1998.693690","DOIUrl":"https://doi.org/10.1109/MASCOT.1998.693690","url":null,"abstract":"This paper presents a model to evaluate the performance and overhead of parallelizing sequential code using compiler directives for multiprocessing on distributed shared memory (DSM) systems. We parallelized the sequential implementation of NAS benchmarks using native Fortran77 compiler directives on an Origin2000, which is a DSM system. We report measurement based performance of these parallelized benchmarks from four perspectives: efficacy of parallelization process; scalability; parallelization overhead; and comparison with hand-parallelized and -optimized version of the same benchmarks. Our results indicate that sequential programs can conveniently be parallelized for DSM systems using compiler directives but realizing performance gains as predicted by the performance model depends primarily on minimizing architecture-specific data locality overhead.","PeriodicalId":272859,"journal":{"name":"Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247)","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128668255","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}
Pub Date : 1998-07-19DOI: 10.1109/MASCOT.1998.693700
D. Nicol, Michael M. Johnson, A. Yoshimura, M. Goldsby
The paper describes the design and performance of IDES, a Java based distributed simulation engine being developed at Sandia National Laboratories. The feasibility of using Java is demonstrated by achieving order of magnitude speedup gains, on a model with three quarters of a million simulated entities, on an "off-the-shelf" system of 56 PentiumPro processors.
{"title":"IDES: a Java-based distributed simulation engine","authors":"D. Nicol, Michael M. Johnson, A. Yoshimura, M. Goldsby","doi":"10.1109/MASCOT.1998.693700","DOIUrl":"https://doi.org/10.1109/MASCOT.1998.693700","url":null,"abstract":"The paper describes the design and performance of IDES, a Java based distributed simulation engine being developed at Sandia National Laboratories. The feasibility of using Java is demonstrated by achieving order of magnitude speedup gains, on a model with three quarters of a million simulated entities, on an \"off-the-shelf\" system of 56 PentiumPro processors.","PeriodicalId":272859,"journal":{"name":"Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126035466","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}
Pub Date : 1998-07-19DOI: 10.1109/MASCOT.1998.693694
C. Katsinis
This paper examines the performance of distributed-shared-memory systems based on the Simultaneous Optical Multiprocessor Exchange Bus (SOME-Bus) using queueing network models and develops theoretical results which predict processor utilization, message latency and other useful measures. It also presents simulation results which compare the performance of the SOME-Bus, the mesh and the torus. The SOME-Bus is a low-latency, high-bandwidth, fiber-optic interconnection network which directly links arbitrary pairs of processor nodes without contention. It contains a dedicated channel for the data output of each node, eliminating the need for global arbitration and providing bandwidth that scales directly with the number of nodes in the system. Each of N nodes has an array of receivers, with one receiver dedicated to each node output channel. The entire N-receiver array can be integrated on a single chip at a comparatively minor cost resulting in o(N) complexity. The SOME-Bus supports multiple simultaneous broadcasts of messages allowing cache consistency protocols to complete much faster. Compared to the networks considered here, the SOME-bus is the interconnection network whose performance is least affected by large message communication times.
{"title":"Distributed-shared-memory support on the Simultaneous Optical Multiprocessor Exchange Bus","authors":"C. Katsinis","doi":"10.1109/MASCOT.1998.693694","DOIUrl":"https://doi.org/10.1109/MASCOT.1998.693694","url":null,"abstract":"This paper examines the performance of distributed-shared-memory systems based on the Simultaneous Optical Multiprocessor Exchange Bus (SOME-Bus) using queueing network models and develops theoretical results which predict processor utilization, message latency and other useful measures. It also presents simulation results which compare the performance of the SOME-Bus, the mesh and the torus. The SOME-Bus is a low-latency, high-bandwidth, fiber-optic interconnection network which directly links arbitrary pairs of processor nodes without contention. It contains a dedicated channel for the data output of each node, eliminating the need for global arbitration and providing bandwidth that scales directly with the number of nodes in the system. Each of N nodes has an array of receivers, with one receiver dedicated to each node output channel. The entire N-receiver array can be integrated on a single chip at a comparatively minor cost resulting in o(N) complexity. The SOME-Bus supports multiple simultaneous broadcasts of messages allowing cache consistency protocols to complete much faster. Compared to the networks considered here, the SOME-bus is the interconnection network whose performance is least affected by large message communication times.","PeriodicalId":272859,"journal":{"name":"Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127007702","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}
Pub Date : 1998-07-19DOI: 10.1109/MASCOT.1998.693692
Sonia Takkar, S. Dandamudi
Real-time transactions, in addition to preserving consistency of the database as in traditional transactions, have to meet the deadlines. Scheduling real-time transactions in parallel database systems has not received much attention. This paper focuses on real-time transaction scheduling in shared-nothing parallel database systems. We evaluate the performance of a new priority-based scheduling policy, in which all scheduling decisions are made locally by each node. In contrast, several other algorithms, proposed for the distributed systems, require communication among the nodes to globally synchronize their local block and abort decisions. Such synchronization can deteriorate performance as real-time transactions will have to meet deadlines. We use miss ratio as the performance metric and show that, in general, the new policy provides a superior performance for the workload and system parameters considered in this study.
{"title":"Performance of hard real-time transaction scheduling policies in parallel database systems","authors":"Sonia Takkar, S. Dandamudi","doi":"10.1109/MASCOT.1998.693692","DOIUrl":"https://doi.org/10.1109/MASCOT.1998.693692","url":null,"abstract":"Real-time transactions, in addition to preserving consistency of the database as in traditional transactions, have to meet the deadlines. Scheduling real-time transactions in parallel database systems has not received much attention. This paper focuses on real-time transaction scheduling in shared-nothing parallel database systems. We evaluate the performance of a new priority-based scheduling policy, in which all scheduling decisions are made locally by each node. In contrast, several other algorithms, proposed for the distributed systems, require communication among the nodes to globally synchronize their local block and abort decisions. Such synchronization can deteriorate performance as real-time transactions will have to meet deadlines. We use miss ratio as the performance metric and show that, in general, the new policy provides a superior performance for the workload and system parameters considered in this study.","PeriodicalId":272859,"journal":{"name":"Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131092388","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}
Pub Date : 1998-07-19DOI: 10.1109/MASCOT.1998.693683
J. Aweya, D. Y. Montuno, Q. Zhang, L. Orozco-Barbosa
This paper presents a binary feedback flow control scheme which uses the gradient of the system performance function to generate feedback from the network to the data sources. The setting of the single bit congestion indication communicated back to the users is based upon the sign of the gradient of the system performance function. The proposed scheme uses a simple gradient optimization method and a neural model of the system dynamics to determine the gradient of the performance function. Simulation results are presented to compare the performance of the proposed scheme to the conventional queue thresholding approach.
{"title":"A binary feedback flow control scheme using system sensitivity derivatives for congestion detection","authors":"J. Aweya, D. Y. Montuno, Q. Zhang, L. Orozco-Barbosa","doi":"10.1109/MASCOT.1998.693683","DOIUrl":"https://doi.org/10.1109/MASCOT.1998.693683","url":null,"abstract":"This paper presents a binary feedback flow control scheme which uses the gradient of the system performance function to generate feedback from the network to the data sources. The setting of the single bit congestion indication communicated back to the users is based upon the sign of the gradient of the system performance function. The proposed scheme uses a simple gradient optimization method and a neural model of the system dynamics to determine the gradient of the performance function. Simulation results are presented to compare the performance of the proposed scheme to the conventional queue thresholding approach.","PeriodicalId":272859,"journal":{"name":"Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132165516","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}
Pub Date : 1998-07-19DOI: 10.1109/MASCOT.1998.693708
M. Vuletic, Goran Davidovic, V. Milutinovic
Utility telemetry service allows utility providers to minimize their expenses and maximize service quality and competitiveness, using public switched telephone networks. The newly emerging IEEE standard 1390 defines alert signals for network to telemetry interface, which activate the telemetry interface unit. Since this standard is on a relatively specific subject, VLSI detectors for the IEEE 1390 signals are not widespread on the market. Instead of using optimal detection methods, a detector of these signals is suggested here, based on suboptimal detection methods. The analysis has been performed in several steps: (a) mathematical modeling, (b) simulation analysis, and (c) implementation analysis. The performed analysis indicates that suboptimal methods offer satisfactory performance, even with a relatively large quantization noise, which implies lower VLSI complexity and production cost.
{"title":"Suboptimal detection of telemetry signals: functional simulation and VLSI implementation","authors":"M. Vuletic, Goran Davidovic, V. Milutinovic","doi":"10.1109/MASCOT.1998.693708","DOIUrl":"https://doi.org/10.1109/MASCOT.1998.693708","url":null,"abstract":"Utility telemetry service allows utility providers to minimize their expenses and maximize service quality and competitiveness, using public switched telephone networks. The newly emerging IEEE standard 1390 defines alert signals for network to telemetry interface, which activate the telemetry interface unit. Since this standard is on a relatively specific subject, VLSI detectors for the IEEE 1390 signals are not widespread on the market. Instead of using optimal detection methods, a detector of these signals is suggested here, based on suboptimal detection methods. The analysis has been performed in several steps: (a) mathematical modeling, (b) simulation analysis, and (c) implementation analysis. The performed analysis indicates that suboptimal methods offer satisfactory performance, even with a relatively large quantization noise, which implies lower VLSI complexity and production cost.","PeriodicalId":272859,"journal":{"name":"Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114307875","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：