Pub Date : 1994-01-31DOI: 10.1109/MASCOT.1994.284418
H. Owen
Due to the complexity of Synchronous Digital Hierarchy (SDH) networks, planning and developing such networks requires computer aided design tools. Because survivable SDH network design is a relatively new area and the need for planning tools has only been recognized in the last few years, virtually no comprehensive tools exist to address the specific questions which must be answered by SDH network engineers. In particular the migration of existing networks into SDH networks requires the capability to model existing transmission and switching methodologies while simultaneously modeling new hybrid topologies consisting of meshed point to point systems, unidirectional and bidirectional topologies and direct point to point TIE lines. Two hierarchical metropolitan optical transmission network architectures examined in this paper using a simulation tool to demonstrate the requirements for a SDH network analysis tool.<>
{"title":"Synchronous digital hierarchy network modeling","authors":"H. Owen","doi":"10.1109/MASCOT.1994.284418","DOIUrl":"https://doi.org/10.1109/MASCOT.1994.284418","url":null,"abstract":"Due to the complexity of Synchronous Digital Hierarchy (SDH) networks, planning and developing such networks requires computer aided design tools. Because survivable SDH network design is a relatively new area and the need for planning tools has only been recognized in the last few years, virtually no comprehensive tools exist to address the specific questions which must be answered by SDH network engineers. In particular the migration of existing networks into SDH networks requires the capability to model existing transmission and switching methodologies while simultaneously modeling new hybrid topologies consisting of meshed point to point systems, unidirectional and bidirectional topologies and direct point to point TIE lines. Two hierarchical metropolitan optical transmission network architectures examined in this paper using a simulation tool to demonstrate the requirements for a SDH network analysis tool.<<ETX>>","PeriodicalId":288344,"journal":{"name":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127938971","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 : 1994-01-31DOI: 10.1109/MASCOT.1994.284452
J. Fourneau, E. Gelenbe, R. Surós
A new class of queueing networks with "negative and positive" customers was introduced and shown to have a non-standard product form (Gelenbe E., Product form queueing networks with negative and positive customers, Journal of Applied Probability, Vol. 28, p. 656-63, 1991); since then this model has undergone several generalizations. Positive customers are identical to the usual customers of a queueing network, while a negative customer which arrives at a queue simply destroys a positive customer. We call these generalized queueing networks G-Networks. In this paper we extend the basic model to the case of multiple class of positive customers, and multiple class of negative customers. As in known multiple class queueing networks a positive customer class is characterized by the routing probabilities and the service rate parameter at each service center while negative customers of different classes may have different "customer destruction" capabilities. All service time distributions are exponential and the service centers can be of the following types: FIFO (first-in-first-out), LIFO/PR (last-in-first-out with preemption), and PS (processor sharing), with class dependent service rates.<>
引入了一类具有“负客户和正客户”的新排队网络，并证明其具有非标准产品形式(Gelenbe E.，具有负客户和正客户的产品形式排队网络，Journal of Applied Probability, Vol. 28, p. 656-63, 1991);从那时起，这个模型经历了几次推广。积极客户与排队网络中的普通客户相同，而到达队列的消极客户则会破坏积极客户。我们称这些广义排队网络为g网络。本文将基本模型推广到多类正顾客和多类负顾客的情况。在已知的多类别排队网络中，正客户类别以每个服务中心的路由概率和服务率参数为特征，而不同类别的负客户可能具有不同的“客户破坏”能力。所有的服务时间分布都是指数型的，服务中心可以是以下类型:FIFO(先进先出)、LIFO/PR(后进先出)和PS(处理器共享)，服务率依赖于类别。
{"title":"G-Networks with multiple class negative and positive customers","authors":"J. Fourneau, E. Gelenbe, R. Surós","doi":"10.1109/MASCOT.1994.284452","DOIUrl":"https://doi.org/10.1109/MASCOT.1994.284452","url":null,"abstract":"A new class of queueing networks with \"negative and positive\" customers was introduced and shown to have a non-standard product form (Gelenbe E., Product form queueing networks with negative and positive customers, Journal of Applied Probability, Vol. 28, p. 656-63, 1991); since then this model has undergone several generalizations. Positive customers are identical to the usual customers of a queueing network, while a negative customer which arrives at a queue simply destroys a positive customer. We call these generalized queueing networks G-Networks. In this paper we extend the basic model to the case of multiple class of positive customers, and multiple class of negative customers. As in known multiple class queueing networks a positive customer class is characterized by the routing probabilities and the service rate parameter at each service center while negative customers of different classes may have different \"customer destruction\" capabilities. All service time distributions are exponential and the service centers can be of the following types: FIFO (first-in-first-out), LIFO/PR (last-in-first-out with preemption), and PS (processor sharing), with class dependent service rates.<<ETX>>","PeriodicalId":288344,"journal":{"name":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"178 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131361903","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 : 1994-01-31DOI: 10.1109/MASCOT.1994.284391
S. Alexandre, W. Alexander, D. Reeves
A programmable simulator has been developed for analyzing the performance of a class of parallel computers. The simulator provides detailed information about the timing, resource usage, and output results for an algorithm executing on the parallel computer. A user specifies the configuration and performance characteristics of the computer to be simulated. The user also describes the algorithm to be executed on the computer. The use of the simulator for QR factorization is briefly described and the results are presented. Our approach is compared with other simulation methods.<>
{"title":"A programmable simulator for analyzing the block data flow architecture","authors":"S. Alexandre, W. Alexander, D. Reeves","doi":"10.1109/MASCOT.1994.284391","DOIUrl":"https://doi.org/10.1109/MASCOT.1994.284391","url":null,"abstract":"A programmable simulator has been developed for analyzing the performance of a class of parallel computers. The simulator provides detailed information about the timing, resource usage, and output results for an algorithm executing on the parallel computer. A user specifies the configuration and performance characteristics of the computer to be simulated. The user also describes the algorithm to be executed on the computer. The use of the simulator for QR factorization is briefly described and the results are presented. Our approach is compared with other simulation methods.<<ETX>>","PeriodicalId":288344,"journal":{"name":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115211196","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 : 1994-01-31DOI: 10.1109/MASCOT.1994.284411
R. L. R. Carmo, G. Juanole
The goal of the authors is to present a modeling methodology based on the stochastic timed Petri nets that allows an exhaustive analysis of the protocol DQDB. This methodology is based on structured models and abstraction concept. A new contribution to the analysis of the queue arbitrated (QA) mechanism is the determination by the modeling process of the time distribution function of the empty slots which arrive at a node (we take into account the correlation between the request arrival process and the empty slot arrival process). The study also points out: the unfairness of the QA mechanism; the control of this unfairness by introducing the BWB mechanism and also a counterpart of this mechanism (the bandwidth wastage can appear); and the increase of unfairness of the QA mechanism when the PA access is considered.<>
{"title":"Modeling and evaluating the DQDB protocol with stochastic timed Petri nets","authors":"R. L. R. Carmo, G. Juanole","doi":"10.1109/MASCOT.1994.284411","DOIUrl":"https://doi.org/10.1109/MASCOT.1994.284411","url":null,"abstract":"The goal of the authors is to present a modeling methodology based on the stochastic timed Petri nets that allows an exhaustive analysis of the protocol DQDB. This methodology is based on structured models and abstraction concept. A new contribution to the analysis of the queue arbitrated (QA) mechanism is the determination by the modeling process of the time distribution function of the empty slots which arrive at a node (we take into account the correlation between the request arrival process and the empty slot arrival process). The study also points out: the unfairness of the QA mechanism; the control of this unfairness by introducing the BWB mechanism and also a counterpart of this mechanism (the bandwidth wastage can appear); and the increase of unfairness of the QA mechanism when the PA access is considered.<<ETX>>","PeriodicalId":288344,"journal":{"name":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124086694","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 : 1994-01-31DOI: 10.1109/MASCOT.1994.284404
Yen-Wen Lu, K. Bagchi, J. Burr, A. Peterson
Wormhole routing is an attractive scheme for large multicomputer networks. The authors include several such representative schemes and make performance comparisons via simulation on an N/spl times/N torus with nearest neighbor connections. A systematic performance scheme is followed, which shows that among all these 6 algorithms, worm1, a hill-climbing version, has a better performance. worm1, in addition, is simpler in structure and easier to implement.<>
{"title":"A comparison of different wormhole routing schemes","authors":"Yen-Wen Lu, K. Bagchi, J. Burr, A. Peterson","doi":"10.1109/MASCOT.1994.284404","DOIUrl":"https://doi.org/10.1109/MASCOT.1994.284404","url":null,"abstract":"Wormhole routing is an attractive scheme for large multicomputer networks. The authors include several such representative schemes and make performance comparisons via simulation on an N/spl times/N torus with nearest neighbor connections. A systematic performance scheme is followed, which shows that among all these 6 algorithms, worm1, a hill-climbing version, has a better performance. worm1, in addition, is simpler in structure and easier to implement.<<ETX>>","PeriodicalId":288344,"journal":{"name":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121964154","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 : 1994-01-31DOI: 10.1109/MASCOT.1994.284407
L. Huynh, R. Chang, W. Chou
There have recently been simulation studies of the dynamic behavior of the TCP Slow-Start (TCP-SS) congestion control mechanism, S. Schenker et al. (1990) and L. Zhang et al. (1991), that show problems of oscillatory behavior in packet delay, congestion windows and throughput. The scheme also suffers from rapid fluctuations in queue length, periodic packet losses, and underutilization of the transmission line in a large pipeline size and/or two-way traffic environments. Fairness problems in TCP-SS are also known to occur. Based on the principles of rate control and preventive congestion mechanism, the present authors have developed a new Adaptive Rate-Based (ARB) congestion avoidance scheme that avoids these problems present in TCP-SS. Through simulations, they demonstrate, that ARB outperforms TCP-SS in two important areas: network efficiency and fairness.<>
{"title":"Performance comparison between TCP slow-start and a new adaptive rate-based congestion avoidance scheme","authors":"L. Huynh, R. Chang, W. Chou","doi":"10.1109/MASCOT.1994.284407","DOIUrl":"https://doi.org/10.1109/MASCOT.1994.284407","url":null,"abstract":"There have recently been simulation studies of the dynamic behavior of the TCP Slow-Start (TCP-SS) congestion control mechanism, S. Schenker et al. (1990) and L. Zhang et al. (1991), that show problems of oscillatory behavior in packet delay, congestion windows and throughput. The scheme also suffers from rapid fluctuations in queue length, periodic packet losses, and underutilization of the transmission line in a large pipeline size and/or two-way traffic environments. Fairness problems in TCP-SS are also known to occur. Based on the principles of rate control and preventive congestion mechanism, the present authors have developed a new Adaptive Rate-Based (ARB) congestion avoidance scheme that avoids these problems present in TCP-SS. Through simulations, they demonstrate, that ARB outperforms TCP-SS in two important areas: network efficiency and fairness.<<ETX>>","PeriodicalId":288344,"journal":{"name":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129736974","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 : 1994-01-31DOI: 10.1109/MASCOT.1994.284454
S. Tripathi, S. Mukherjee
Studies the problem of transmitting time constrained synchronous messages in local area networks. A bandwidth allocation scheme for synchronous messages is developed and the sufficient condition for schedulability is derived. Implementation of the allocation scheme is proposed on slotted ring and DQDB networks.<>
{"title":"Time constrained message transmission in a LAN environment","authors":"S. Tripathi, S. Mukherjee","doi":"10.1109/MASCOT.1994.284454","DOIUrl":"https://doi.org/10.1109/MASCOT.1994.284454","url":null,"abstract":"Studies the problem of transmitting time constrained synchronous messages in local area networks. A bandwidth allocation scheme for synchronous messages is developed and the sufficient condition for schedulability is derived. Implementation of the allocation scheme is proposed on slotted ring and DQDB networks.<<ETX>>","PeriodicalId":288344,"journal":{"name":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114197545","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 : 1994-01-31DOI: 10.1109/MASCOT.1994.284395
D. Chao, David T. Wang
A user-friendly CAD graphical tool, running on Sun workstations, has been designed for the design, verification, simulation, and synthesis of protocols based on an interactive tool for Petri net and state diagram designs. Special features of this tool are: capability of modelling of both control and data flows, reduction and analysis, simulation of network behavior and performance, coding (parameterized protocols and automatic implementation) synthesis (two party protocol and ordinary Petri nets), animation and flexible design. Since it is Petri net based it allows simulation during all design phases and has extensive applications such as parallel debugging and simulation, expert systems, etc. Future enhancements of this tool are also discussed.<>
{"title":"An interactive tool for design, simulation, verification, and synthesis of protocols","authors":"D. Chao, David T. Wang","doi":"10.1109/MASCOT.1994.284395","DOIUrl":"https://doi.org/10.1109/MASCOT.1994.284395","url":null,"abstract":"A user-friendly CAD graphical tool, running on Sun workstations, has been designed for the design, verification, simulation, and synthesis of protocols based on an interactive tool for Petri net and state diagram designs. Special features of this tool are: capability of modelling of both control and data flows, reduction and analysis, simulation of network behavior and performance, coding (parameterized protocols and automatic implementation) synthesis (two party protocol and ordinary Petri nets), animation and flexible design. Since it is Petri net based it allows simulation during all design phases and has extensive applications such as parallel debugging and simulation, expert systems, etc. Future enhancements of this tool are also discussed.<<ETX>>","PeriodicalId":288344,"journal":{"name":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116231167","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 : 1994-01-31DOI: 10.1109/MASCOT.1994.284448
Jyh-Charn S. Liu, S. M. Shahrier
This paper studies the effects of hit ratio on the timing predictability of real-time tasks based on trace driven simulation. The impact on execution times of the variance of the hit ratio for different program runs is studied, covering a wide range of cache sizes and organizations. An analytical expression to quantify the timing predictability is derived, so that timing errors due to variations of the hit ratio con be bounded. Based on this result, we derived the upper bound for the worst-case execution time (WCET) when using caches. Using the WCET bounds, some experimental results are presented on the performance impact on hard real-time systems of different cache sizes and organizations.<>
{"title":"On predictability of caches for real-time applications","authors":"Jyh-Charn S. Liu, S. M. Shahrier","doi":"10.1109/MASCOT.1994.284448","DOIUrl":"https://doi.org/10.1109/MASCOT.1994.284448","url":null,"abstract":"This paper studies the effects of hit ratio on the timing predictability of real-time tasks based on trace driven simulation. The impact on execution times of the variance of the hit ratio for different program runs is studied, covering a wide range of cache sizes and organizations. An analytical expression to quantify the timing predictability is derived, so that timing errors due to variations of the hit ratio con be bounded. Based on this result, we derived the upper bound for the worst-case execution time (WCET) when using caches. Using the WCET bounds, some experimental results are presented on the performance impact on hard real-time systems of different cache sizes and organizations.<<ETX>>","PeriodicalId":288344,"journal":{"name":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122307784","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 : 1994-01-31DOI: 10.1109/MASCOT.1994.284445
A. Bragg, W. Chou
Empirical studies suggest that video traffic streams in high speed BISDN/ATM telecommunication networks can be modeled as ARMA processes, but some results appear to be inconsistent due to differences in scene content and in the granularity of the time series. We propose a generic model for single source ARMA/ARIMA video streams that explains the effects of aggregation and sampling frequency at different timescales. We extend this to multiplexed independent video streams and describe how specific empirical results fit within the framework. We show that realizations of some models are non-stationary, and that restrictive assumptions of stationarity can be relaxed in the general case. Empirical results are consistent if the timescale is considered. The superposition of multiple independent video streams has certain predictable and consistent ARMA/ARIMA characteristics.<>
{"title":"Analytic models and characteristics of video traffic in high speed networks","authors":"A. Bragg, W. Chou","doi":"10.1109/MASCOT.1994.284445","DOIUrl":"https://doi.org/10.1109/MASCOT.1994.284445","url":null,"abstract":"Empirical studies suggest that video traffic streams in high speed BISDN/ATM telecommunication networks can be modeled as ARMA processes, but some results appear to be inconsistent due to differences in scene content and in the granularity of the time series. We propose a generic model for single source ARMA/ARIMA video streams that explains the effects of aggregation and sampling frequency at different timescales. We extend this to multiplexed independent video streams and describe how specific empirical results fit within the framework. We show that realizations of some models are non-stationary, and that restrictive assumptions of stationarity can be relaxed in the general case. Empirical results are consistent if the timescale is considered. The superposition of multiple independent video streams has certain predictable and consistent ARMA/ARIMA characteristics.<<ETX>>","PeriodicalId":288344,"journal":{"name":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133996359","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
扫码关注我们
求助内容：
应助结果提醒方式：