Pub Date : 1998-07-19DOI: 10.1109/MASCOT.1998.693701
Polly Huang, D. Estrin, J. Heidemann
Due to the complexity and scale of the current Internet, large scale simulation is an increasingly important tool to evaluate network protocol design. Parallel and distributed simulation is one appropriate approach to the simulation scalability problem, but it can require expensive hardware and have high overhead. We investigate a complementary solution-simulation abstraction. Just as a custom simulator includes only details necessary for the task at hand, a general simulator can support configurable levels of detail for different simulations. We demonstrate two abstraction techniques in multicast simulations and show that they each help to gain one order of magnitude in performance. Although abstraction simulations are not identical to more detailed simulations, in many cases these differences are small and result in minimal changes in the conclusions drawn from simulations.
{"title":"Enabling large-scale simulations: selective abstraction approach to the study of multicast protocols","authors":"Polly Huang, D. Estrin, J. Heidemann","doi":"10.1109/MASCOT.1998.693701","DOIUrl":"https://doi.org/10.1109/MASCOT.1998.693701","url":null,"abstract":"Due to the complexity and scale of the current Internet, large scale simulation is an increasingly important tool to evaluate network protocol design. Parallel and distributed simulation is one appropriate approach to the simulation scalability problem, but it can require expensive hardware and have high overhead. We investigate a complementary solution-simulation abstraction. Just as a custom simulator includes only details necessary for the task at hand, a general simulator can support configurable levels of detail for different simulations. We demonstrate two abstraction techniques in multicast simulations and show that they each help to gain one order of magnitude in performance. Although abstraction simulations are not identical to more detailed simulations, in many cases these differences are small and result in minimal changes in the conclusions drawn from simulations.","PeriodicalId":272859,"journal":{"name":"Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247)","volume":"54 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":"115206771","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.693699
W. Giloi, C. Lindemann, S. Pletner
This paper presents a modeling approach based on deterministic and stochastic Petri nets (DSPN) for analyzing the performance of node architectures for MIMD multiprocessor systems with distributed memory. DSPN are a numerically solvable modeling formalism with a graphical representation. The modeling approach supports design decisions for node architectures by providing quantitative results concerning processor and memory utilization for several design alternatives. To illustrate the proposed approach, DSPN of two node architectures are presented and employed for a comparative performance study.
{"title":"Modeling node architectures","authors":"W. Giloi, C. Lindemann, S. Pletner","doi":"10.1109/MASCOT.1998.693699","DOIUrl":"https://doi.org/10.1109/MASCOT.1998.693699","url":null,"abstract":"This paper presents a modeling approach based on deterministic and stochastic Petri nets (DSPN) for analyzing the performance of node architectures for MIMD multiprocessor systems with distributed memory. DSPN are a numerically solvable modeling formalism with a graphical representation. The modeling approach supports design decisions for node architectures by providing quantitative results concerning processor and memory utilization for several design alternatives. To illustrate the proposed approach, DSPN of two node architectures are presented and employed for a comparative performance study.","PeriodicalId":272859,"journal":{"name":"Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247)","volume":"63 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":"128149990","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.693709
A. Bhargava, Li Li, D. Agrawal, P. Agrawal
One critical issue in wireless systems is the efficient encoding of data in the presence of noise and Rayleigh fading. We analyze automatic repeat request (ARQ)-selective repeat and forward error correction control (FEC) algorithms using Markov chain model for mobile systems that can optimize the amount of battery energy consumed by transmitters. In this paper, we introduce an enhanced distributed algorithm which dynamically balances the combination of FEC and ARQ. The algorithm is shown to be suitable for both real time and non-real time multimedia environments. Extensive simulation indicates that our proposed algorithm outperforms existing schemes solely based on either FEC or ARQ and demonstrates the usefulness of our novel scheme.
{"title":"D/sup 2/PAMN: distributed dynamic power and error control algorithm for mobile networks","authors":"A. Bhargava, Li Li, D. Agrawal, P. Agrawal","doi":"10.1109/MASCOT.1998.693709","DOIUrl":"https://doi.org/10.1109/MASCOT.1998.693709","url":null,"abstract":"One critical issue in wireless systems is the efficient encoding of data in the presence of noise and Rayleigh fading. We analyze automatic repeat request (ARQ)-selective repeat and forward error correction control (FEC) algorithms using Markov chain model for mobile systems that can optimize the amount of battery energy consumed by transmitters. In this paper, we introduce an enhanced distributed algorithm which dynamically balances the combination of FEC and ARQ. The algorithm is shown to be suitable for both real time and non-real time multimedia environments. Extensive simulation indicates that our proposed algorithm outperforms existing schemes solely based on either FEC or ARQ and demonstrates the usefulness of our novel scheme.","PeriodicalId":272859,"journal":{"name":"Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247)","volume":"26 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":"122721871","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.693675
J. M. Ng, Peoy Khee Ng
A critical requirement for multi-party multimedia applications is to generate a multicast tree that has minimal overall network cost and acceptable end-to-end network delay in every path. These two features of the multicast tree are often conflicting in nature and the problem of minimizing the overall network cost in multicast routing is a Steiner tree problem which is known to be NP-complete. Most of the multicasting algorithms use heuristics that will optimize either the cost or the delay; however, the requirements of real-time multimedia applications cannot be satisfied. In this paper, a path selection function taking both the cost and the delay into consideration is proposed. A performance study is carried out by applying the path selection function to existing multicasting algorithms. Our results show that by simply changing the path selection function, the overall cost of the multicast tree can be reduced significantly while satisfying the real-time constraint of the multimedia applications.
{"title":"Cost-delay path selection function for real-time multicast routing","authors":"J. M. Ng, Peoy Khee Ng","doi":"10.1109/MASCOT.1998.693675","DOIUrl":"https://doi.org/10.1109/MASCOT.1998.693675","url":null,"abstract":"A critical requirement for multi-party multimedia applications is to generate a multicast tree that has minimal overall network cost and acceptable end-to-end network delay in every path. These two features of the multicast tree are often conflicting in nature and the problem of minimizing the overall network cost in multicast routing is a Steiner tree problem which is known to be NP-complete. Most of the multicasting algorithms use heuristics that will optimize either the cost or the delay; however, the requirements of real-time multimedia applications cannot be satisfied. In this paper, a path selection function taking both the cost and the delay into consideration is proposed. A performance study is carried out by applying the path selection function to existing multicasting algorithms. Our results show that by simply changing the path selection function, the overall cost of the multicast tree can be reduced significantly while satisfying the real-time constraint of the multimedia applications.","PeriodicalId":272859,"journal":{"name":"Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247)","volume":"9 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":"133774052","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.693687
O. Abuamsha, N. Pekergin
We compare fair queuing (FQ) algorithms with a novel approach based on the majorization theory of real valued vectors. We study the temporal evolution of the received normalized service of all backlogged sessions in order to give a better insight into the performance of a FQ policy than what worst-case measures can provide. As an application of this approach, we study the effect of the eligibility criterion on the service discrepancy. We show that a FQ policy with a large eligibility set scatters the normalized service less than another FQ policy with a smaller eligible set.
{"title":"Comparison of fair queuing algorithms with a stochastic approach","authors":"O. Abuamsha, N. Pekergin","doi":"10.1109/MASCOT.1998.693687","DOIUrl":"https://doi.org/10.1109/MASCOT.1998.693687","url":null,"abstract":"We compare fair queuing (FQ) algorithms with a novel approach based on the majorization theory of real valued vectors. We study the temporal evolution of the received normalized service of all backlogged sessions in order to give a better insight into the performance of a FQ policy than what worst-case measures can provide. As an application of this approach, we study the effect of the eligibility criterion on the service discrepancy. We show that a FQ policy with a large eligibility set scatters the normalized service less than another FQ policy with a smaller eligible set.","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":"134609853","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.693693
Jian Huang, D. Lilja
In developing a simulator for a new processor architecture, it often is not clear whether it is more efficient to write a new simulator or to modify an existing simulator. Writing a new simulator forces the processor architect to develop or adapt all of the related software tools. However, modifying an existing simulator and related tools, which are usually not well-documented, can be time-consuming and error-prone. We describe the SImulator for Multithreaded Computer Architectures (SIMCA) that was developed with the primary goal of obtaining a functional simulator as quickly as possible to begin evaluating the superthreaded architecture. The performance of the simulator itself was important, but secondary. We achieved our goal using a technique called process-pipelining that exploits the unique features of this new architecture to hide the details of the underlying simulator. This approach allowed us to quickly produce a functional simulator whose performance is only 3.8-4.9 times slower than the base simulator.
{"title":"An efficient strategy for developing a simulator for a novel concurrent multithreaded processor architecture","authors":"Jian Huang, D. Lilja","doi":"10.1109/MASCOT.1998.693693","DOIUrl":"https://doi.org/10.1109/MASCOT.1998.693693","url":null,"abstract":"In developing a simulator for a new processor architecture, it often is not clear whether it is more efficient to write a new simulator or to modify an existing simulator. Writing a new simulator forces the processor architect to develop or adapt all of the related software tools. However, modifying an existing simulator and related tools, which are usually not well-documented, can be time-consuming and error-prone. We describe the SImulator for Multithreaded Computer Architectures (SIMCA) that was developed with the primary goal of obtaining a functional simulator as quickly as possible to begin evaluating the superthreaded architecture. The performance of the simulator itself was important, but secondary. We achieved our goal using a technique called process-pipelining that exploits the unique features of this new architecture to hide the details of the underlying simulator. This approach allowed us to quickly produce a functional simulator whose performance is only 3.8-4.9 times slower than the base simulator.","PeriodicalId":272859,"journal":{"name":"Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247)","volume":"19 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":"126111138","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.693710
P. Ashenden, P. Wilsey
The paper describes extensions to VHDL to support system-level behavioral modeling by providing more abstract forms of communication and concurrency than those currently in the language. The report summarizes design objectives and issues that must be considered in developing such extensions, and presents definitions of our extensions. The extensions for communication consist of channel types, channel objects, dynamically allocated channels, and message passing statements. The extensions for concurrency consist of process declarations and static and dynamic process instantiation statements. Use of the extensions is illustrated with examples.
{"title":"Extensions to VHDL for abstraction of concurrency and communication","authors":"P. Ashenden, P. Wilsey","doi":"10.1109/MASCOT.1998.693710","DOIUrl":"https://doi.org/10.1109/MASCOT.1998.693710","url":null,"abstract":"The paper describes extensions to VHDL to support system-level behavioral modeling by providing more abstract forms of communication and concurrency than those currently in the language. The report summarizes design objectives and issues that must be considered in developing such extensions, and presents definitions of our extensions. The extensions for communication consist of channel types, channel objects, dynamically allocated channels, and message passing statements. The extensions for concurrency consist of process declarations and static and dynamic process instantiation statements. Use of the extensions is illustrated with examples.","PeriodicalId":272859,"journal":{"name":"Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247)","volume":"48 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":"130768704","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.693691
A. Iyengar, E. MacNair, M. Squillante, Li Zhang
We develop a general methodology for characterizing Web server access patterns based on a spectral analysis of finite collections of observed data from real systems. Our approach is used together with the access logs from the IBM Web site for the 1996 Olympic Games to demonstrate some of its advantages over previous methods and to analyze certain aspects of large-scale Web server performance.
{"title":"A general methodology for characterizing access patterns and analyzing Web server performance","authors":"A. Iyengar, E. MacNair, M. Squillante, Li Zhang","doi":"10.1109/MASCOT.1998.693691","DOIUrl":"https://doi.org/10.1109/MASCOT.1998.693691","url":null,"abstract":"We develop a general methodology for characterizing Web server access patterns based on a spectral analysis of finite collections of observed data from real systems. Our approach is used together with the access logs from the IBM Web site for the 1996 Olympic Games to demonstrate some of its advantages over previous methods and to analyze certain aspects of large-scale Web server performance.","PeriodicalId":272859,"journal":{"name":"Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247)","volume":"30 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":"117014938","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.693696
S. Fischer, H. Meer
Quality of service (QoS) management is an important issue in today's high-speed distributed systems supporting multimedia applications. Most existing QoS management schemes usually just cope with technical issues of resource reservations and QoS guarantees, often completely neglecting revenue issues which are especially important for service providers in order to maximize their profit. The revenue to be expected does not only depend on the stream itself but also very much on stochastic events such as network failures or QoS violations. A QoS management system taking revenue issues and the possibly stochastic behavior of the environment into account thus seems to be superior to the existing ones. We show how controller programs for such enhanced QoS management systems can be developed based on a new kind of Petri nets, so-called controlled stochastic Petri nets. We show how to numerically analyze such models using a tool environment in order to obtain strategies for the QoS management system.
{"title":"QoS management: a model-based approach","authors":"S. Fischer, H. Meer","doi":"10.1109/MASCOT.1998.693696","DOIUrl":"https://doi.org/10.1109/MASCOT.1998.693696","url":null,"abstract":"Quality of service (QoS) management is an important issue in today's high-speed distributed systems supporting multimedia applications. Most existing QoS management schemes usually just cope with technical issues of resource reservations and QoS guarantees, often completely neglecting revenue issues which are especially important for service providers in order to maximize their profit. The revenue to be expected does not only depend on the stream itself but also very much on stochastic events such as network failures or QoS violations. A QoS management system taking revenue issues and the possibly stochastic behavior of the environment into account thus seems to be superior to the existing ones. We show how controller programs for such enhanced QoS management systems can be developed based on a new kind of Petri nets, so-called controlled stochastic Petri nets. We show how to numerically analyze such models using a tool environment in order to obtain strategies for the QoS management system.","PeriodicalId":272859,"journal":{"name":"Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247)","volume":"41 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":"128221487","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.693680
M. Sivabalan, H. Mouftah
Alternate path routing (APR) can be used to achieve efficient routing in communications networks. We describe several approaches to APR in connection-oriented networks running link-state routing protocol, and evaluate their performance using call-level simulations. We assume source routing paradigm where primary paths for calls are computed only at source nodes. However, depending on the approach, alternate paths can be computed at source, intermediate or even destination nodes. We present simulation results to show that, if not carefully used, APR may degrade network performance under heavy load. Finally, we describe two mechanisms for improving APR, and address some of their implementation issues.
{"title":"Approaches to link-state alternate path routing in connection-oriented networks","authors":"M. Sivabalan, H. Mouftah","doi":"10.1109/MASCOT.1998.693680","DOIUrl":"https://doi.org/10.1109/MASCOT.1998.693680","url":null,"abstract":"Alternate path routing (APR) can be used to achieve efficient routing in communications networks. We describe several approaches to APR in connection-oriented networks running link-state routing protocol, and evaluate their performance using call-level simulations. We assume source routing paradigm where primary paths for calls are computed only at source nodes. However, depending on the approach, alternate paths can be computed at source, intermediate or even destination nodes. We present simulation results to show that, if not carefully used, APR may degrade network performance under heavy load. Finally, we describe two mechanisms for improving APR, and address some of their implementation issues.","PeriodicalId":272859,"journal":{"name":"Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247)","volume":"113 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":"133713448","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
扫码关注我们
求助内容：
应助结果提醒方式：