Pub Date : 1998-07-19DOI: 10.1109/MASCOT.1998.693673
Honge Wang, D. Blough
A tree-based fault-tolerant multicast algorithm built on top of pipelined circuit switching is presented. The algorithm is provably deadlock-free and livelock-free, requires only a single message startup, and guarantees messages are delivered over shortest paths in the fault-free and traffic-free case. Simulation results in two-dimensional mesh networks show that the algorithm produces significantly shorter average communication latency than previous fault-tolerant multicast algorithms over a range of network loads and fault conditions.
{"title":"Tree-based fault-tolerant multicast in multicomputer networks","authors":"Honge Wang, D. Blough","doi":"10.1109/MASCOT.1998.693673","DOIUrl":"https://doi.org/10.1109/MASCOT.1998.693673","url":null,"abstract":"A tree-based fault-tolerant multicast algorithm built on top of pipelined circuit switching is presented. The algorithm is provably deadlock-free and livelock-free, requires only a single message startup, and guarantees messages are delivered over shortest paths in the fault-free and traffic-free case. Simulation results in two-dimensional mesh networks show that the algorithm produces significantly shorter average communication latency than previous fault-tolerant multicast algorithms over a range of network loads and fault conditions.","PeriodicalId":272859,"journal":{"name":"Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247)","volume":"24 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":"123797523","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.693698
K. Khan, H. Peyravi
In TDMA (time division multiple access), stations transmit their messages on a shared communication channel using their dedicated time slots. All the previous delay analyses of TDMA have been based on the assumption that either the interarrival times of the traffic is exponential or the message lengths are geometrically distributed. This paper presents a generalized model in which the above assumptions are relaxed. This model allows us to compute the exact performance characteristics in closed forms for the mean and the variance of the queue size and the message delay for the TDMA. The model is used to define and compare five bursty traffic distributions. These distributions are used to study their effects on the buffer size and the end-to-end delay for the Mars Regional Network.
{"title":"Delay and queue size analysis of TDMA with general traffic","authors":"K. Khan, H. Peyravi","doi":"10.1109/MASCOT.1998.693698","DOIUrl":"https://doi.org/10.1109/MASCOT.1998.693698","url":null,"abstract":"In TDMA (time division multiple access), stations transmit their messages on a shared communication channel using their dedicated time slots. All the previous delay analyses of TDMA have been based on the assumption that either the interarrival times of the traffic is exponential or the message lengths are geometrically distributed. This paper presents a generalized model in which the above assumptions are relaxed. This model allows us to compute the exact performance characteristics in closed forms for the mean and the variance of the queue size and the message delay for the TDMA. The model is used to define and compare five bursty traffic distributions. These distributions are used to study their effects on the buffer size and the end-to-end delay for the Mars Regional Network.","PeriodicalId":272859,"journal":{"name":"Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247)","volume":"81 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":"124681756","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.693670
E. Tam, J. Rivers, G. Tyson, E. Davidson
As the gap between processor and memory speeds increases, cache performance becomes more critical to overall system performance. Multi-lateral cache designs such as the Assist, Victim, and NTS cache have been shown to perform as well as or better than larger, single structure caches. Unlike current cache simulators, mlcache (an event-driven, timing-sensitive simulator based on the Latency Effects cache timing model) can evaluate a variety of multilateral cache configurations. It was developed to help designers in the middle of the design cycle decide which cache configuration would best meet the performance needs of the target processor. It can easily model various cache configurations by using its library of cache state and data movement routines. We use the SPEC95 benchmarks to illustrate how mlcache can be used to compare the performance of several different data cache configurations.
{"title":"mlcache: a flexible multi-lateral cache simulator","authors":"E. Tam, J. Rivers, G. Tyson, E. Davidson","doi":"10.1109/MASCOT.1998.693670","DOIUrl":"https://doi.org/10.1109/MASCOT.1998.693670","url":null,"abstract":"As the gap between processor and memory speeds increases, cache performance becomes more critical to overall system performance. Multi-lateral cache designs such as the Assist, Victim, and NTS cache have been shown to perform as well as or better than larger, single structure caches. Unlike current cache simulators, mlcache (an event-driven, timing-sensitive simulator based on the Latency Effects cache timing model) can evaluate a variety of multilateral cache configurations. It was developed to help designers in the middle of the design cycle decide which cache configuration would best meet the performance needs of the target processor. It can easily model various cache configurations by using its library of cache state and data movement routines. We use the SPEC95 benchmarks to illustrate how mlcache can be used to compare the performance of several different data cache configurations.","PeriodicalId":272859,"journal":{"name":"Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247)","volume":"210 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":"121715834","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.693684
Byron Bashforth, C. Williamson
Achieving statistical gains when multiplexing video streams, as in a video-on-demand (VOD) scenario, is difficult because of the stringent QOS demands and the self-similar nature of the traffic. This paper explores, through empirical simulation, the QOS, network utilization, and statistical characteristics of the aggregate traffic resulting from multiple independent MPEG video streams. In addition, the simulation results are compared against several recently-derived theoretical results for self-similar network traffic. Three main results are evident from our experiments. First, moderate statistical multiplexing gain can be achieved when multiplexing multiple self-similar streams. Second, video multiplexing is extremely sensitive to traffic phasing effects and to heavy-tailed frame size distributions. Finally, the theoretical approach considered (Norros (see IEEE Journal on Selected Areas in Communications, vol.13, no.6, p.953-62, 1995) effective bandwidth formulation) appears promising but requires fine-tuning to be practical for call admission and network dimensioning.
{"title":"Statistical multiplexing of self-similar video streams: simulation study and performance results","authors":"Byron Bashforth, C. Williamson","doi":"10.1109/MASCOT.1998.693684","DOIUrl":"https://doi.org/10.1109/MASCOT.1998.693684","url":null,"abstract":"Achieving statistical gains when multiplexing video streams, as in a video-on-demand (VOD) scenario, is difficult because of the stringent QOS demands and the self-similar nature of the traffic. This paper explores, through empirical simulation, the QOS, network utilization, and statistical characteristics of the aggregate traffic resulting from multiple independent MPEG video streams. In addition, the simulation results are compared against several recently-derived theoretical results for self-similar network traffic. Three main results are evident from our experiments. First, moderate statistical multiplexing gain can be achieved when multiplexing multiple self-similar streams. Second, video multiplexing is extremely sensitive to traffic phasing effects and to heavy-tailed frame size distributions. Finally, the theoretical approach considered (Norros (see IEEE Journal on Selected Areas in Communications, vol.13, no.6, p.953-62, 1995) effective bandwidth formulation) appears promising but requires fine-tuning to be practical for call admission and network dimensioning.","PeriodicalId":272859,"journal":{"name":"Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247)","volume":"22 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":"114762647","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.693677
Haining Wang, C. Williamson
This paper presents a new approach to TCP congestion control. The new scheme includes two parts: (I) the smooth-start algorithm, which replaces the slow-start algorithm at the start of a TCP connection or after a retransmission timeout, and (2) the dynamic recovery algorithm, which replaces the fast recovery algorithm to recover packet losses when a TCP connection is congested. Both algorithms require modifications only to the sender side of the TCP implementation. Simulation is used to evaluate the performance of the algorithms. The simulation experiments are conducted using the ns simulator to facilitate comparisons with Tahoe, Reno, New-Reno, SACK, and FACK TCP. The simulation results show that the new scheme performs at least as well as SACK and FACK TCP, which in turn consistently outperform TCP Tahoe and Reno. Furthermore, the implementation of the new scheme is simpler than that of SACK and FACK.
{"title":"A new scheme for TCP congestion control: smooth-start and dynamic recovery","authors":"Haining Wang, C. Williamson","doi":"10.1109/MASCOT.1998.693677","DOIUrl":"https://doi.org/10.1109/MASCOT.1998.693677","url":null,"abstract":"This paper presents a new approach to TCP congestion control. The new scheme includes two parts: (I) the smooth-start algorithm, which replaces the slow-start algorithm at the start of a TCP connection or after a retransmission timeout, and (2) the dynamic recovery algorithm, which replaces the fast recovery algorithm to recover packet losses when a TCP connection is congested. Both algorithms require modifications only to the sender side of the TCP implementation. Simulation is used to evaluate the performance of the algorithms. The simulation experiments are conducted using the ns simulator to facilitate comparisons with Tahoe, Reno, New-Reno, SACK, and FACK TCP. The simulation results show that the new scheme performs at least as well as SACK and FACK TCP, which in turn consistently outperform TCP Tahoe and Reno. Furthermore, the implementation of the new scheme is simpler than that of SACK and FACK.","PeriodicalId":272859,"journal":{"name":"Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247)","volume":"57 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":"121740035","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.693707
C. C. Fong, John C.S. Lui, M. Wong, E. D. S. E. Silva
Currently, many location update protocols have been proposed for mobile terminal tracking in cellular networks. These protocols, such as the time-based and the distance-based protocols, try to minimize the system overhead for locating a mobile user in the network. The contribution of this paper to develop a novel mathematical model to analyze these protocols and at the same time, make a general model to capture many important movement features. In this paper, we propose to use the transient analysis method to predict the location of a mobile user and the accuracy of the prediction of the location of a user can be enhanced. By applying the transient analysis to evaluate the time-based and the distance-based protocol, it gives us more insights in the performance of these protocols under different movement configurations. Last but not least, our model is general enough such that it provides a general framework to analyze other location update protocols in cellular networks.
{"title":"Transient performance analysis for location update protocols in cellular networks","authors":"C. C. Fong, John C.S. Lui, M. Wong, E. D. S. E. Silva","doi":"10.1109/MASCOT.1998.693707","DOIUrl":"https://doi.org/10.1109/MASCOT.1998.693707","url":null,"abstract":"Currently, many location update protocols have been proposed for mobile terminal tracking in cellular networks. These protocols, such as the time-based and the distance-based protocols, try to minimize the system overhead for locating a mobile user in the network. The contribution of this paper to develop a novel mathematical model to analyze these protocols and at the same time, make a general model to capture many important movement features. In this paper, we propose to use the transient analysis method to predict the location of a mobile user and the accuracy of the prediction of the location of a user can be enhanced. By applying the transient analysis to evaluate the time-based and the distance-based protocol, it gives us more insights in the performance of these protocols under different movement configurations. Last but not least, our model is general enough such that it provides a general framework to analyze other location update protocols in cellular networks.","PeriodicalId":272859,"journal":{"name":"Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247)","volume":"51 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":"132526288","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.693669
B. Sonah, M. Ito
The architecture of the Berkeley distributed hierarchical video-on-demand (VOD) system consists of continuous media servers (CMS) basically standing as a cache between the archive servers (AS) and the clients. Many replacement policies used in cache management, we notice, is restricted in that they consider only one (or few) parameters to decide which video to kick out of the cache, like the frequency of requests, or the size of objects. We look at a new cache management algorithm which is higher-performing since it considers, besides the time of requests and the past request history of a video, the video characteristics which viewers, generally, have a bias for. However, the viewer's bias and the objects' characteristics vary with time and location. We enhanced the cache management technique by making it adaptive to the different characteristics viewers and videos have at different times and places.
{"title":"New adaptive object replacement policy for video-on-demand systems","authors":"B. Sonah, M. Ito","doi":"10.1109/MASCOT.1998.693669","DOIUrl":"https://doi.org/10.1109/MASCOT.1998.693669","url":null,"abstract":"The architecture of the Berkeley distributed hierarchical video-on-demand (VOD) system consists of continuous media servers (CMS) basically standing as a cache between the archive servers (AS) and the clients. Many replacement policies used in cache management, we notice, is restricted in that they consider only one (or few) parameters to decide which video to kick out of the cache, like the frequency of requests, or the size of objects. We look at a new cache management algorithm which is higher-performing since it considers, besides the time of requests and the past request history of a video, the video characteristics which viewers, generally, have a bias for. However, the viewer's bias and the objects' characteristics vary with time and location. We enhanced the cache management technique by making it adaptive to the different characteristics viewers and videos have at different times and places.","PeriodicalId":272859,"journal":{"name":"Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247)","volume":"10 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":"115414808","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.693678
B. Mah, P. Sholander, L. Martínez, L. Tolendino
A common shortcoming of many network measurement programs is that their metrics are not expressed in terms directly applicable to applications and users. To address this problem, we have developed the IP Benchmark (IPB), a benchmark program that synthetically generates traffic to simulate the network activity of common Internet applications. It measures the performance experienced by the simulated applications, and expresses that performance in terms of application-specific metrics. After presenting same details of the design and implementation of IPB, we show how we use it to measure HTTP performance along various long-delay, lossy ATM links, such as might be found in satellite or wireless ATM environments. These links themselves are simulated by using a BBN Long Link Emulator which adds delays and errors to local-area OC-3 links. Finally, we present some preliminary results.
{"title":"IPB: an Internet Protocol Benchmark using simulated traffic","authors":"B. Mah, P. Sholander, L. Martínez, L. Tolendino","doi":"10.1109/MASCOT.1998.693678","DOIUrl":"https://doi.org/10.1109/MASCOT.1998.693678","url":null,"abstract":"A common shortcoming of many network measurement programs is that their metrics are not expressed in terms directly applicable to applications and users. To address this problem, we have developed the IP Benchmark (IPB), a benchmark program that synthetically generates traffic to simulate the network activity of common Internet applications. It measures the performance experienced by the simulated applications, and expresses that performance in terms of application-specific metrics. After presenting same details of the design and implementation of IPB, we show how we use it to measure HTTP performance along various long-delay, lossy ATM links, such as might be found in satellite or wireless ATM environments. These links themselves are simulated by using a BBN Long Link Emulator which adds delays and errors to local-area OC-3 links. Finally, we present some preliminary results.","PeriodicalId":272859,"journal":{"name":"Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247)","volume":"36 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":"126888482","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.693679
Nunzio N. Savino, R. Puigjaner
This paper presents a pool of performance models for user applications using IONA's OrbixTalk, a software system that provides a reliable multicast objects message system using UDP-based IP multicast. The solution presents models for all the levels involved, from the OrbixTalk user program level to the logical level regarding internal proxies using UDP sockets over TCP/IP ports. The OrbixTalk models have been included into the Models' Repository of HELIOS (Hierarchical Evaluation of Large Information Open Systems), a CASE tool for predicting the performance of distributed information systems.
{"title":"Performance modelling of OrbixTalk: a message delivery system based on reliable multicast protocols","authors":"Nunzio N. Savino, R. Puigjaner","doi":"10.1109/MASCOT.1998.693679","DOIUrl":"https://doi.org/10.1109/MASCOT.1998.693679","url":null,"abstract":"This paper presents a pool of performance models for user applications using IONA's OrbixTalk, a software system that provides a reliable multicast objects message system using UDP-based IP multicast. The solution presents models for all the levels involved, from the OrbixTalk user program level to the logical level regarding internal proxies using UDP sockets over TCP/IP ports. The OrbixTalk models have been included into the Models' Repository of HELIOS (Hierarchical Evaluation of Large Information Open Systems), a CASE tool for predicting the performance of distributed information systems.","PeriodicalId":272859,"journal":{"name":"Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247)","volume":"16 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":"130856833","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.693668
D. Weikle, S. Mckee, W. Wulf
As the processor-memory performance gap continues to grow, so does the need for effective tools and metrics to guide the design of efficient memory hierarchies to bridge that gap. Aggregate statistics of cache performance can be useful for comparison, but they give us little insight into how to improve the design of a particular component. We propose a different approach to cache analysis-viewing caches as filters-and present two new metrics for analyzing cache behavior: instantaneous hit rate and instantaneous locality. We demonstrate how these measures can give us insight into the reference pattern of an executing program, and show an application of these measures in analyzing the effectiveness of the second level cache of a particular memory hierarchy.
{"title":"Caches as filters: a new approach to cache analysis","authors":"D. Weikle, S. Mckee, W. Wulf","doi":"10.1109/MASCOT.1998.693668","DOIUrl":"https://doi.org/10.1109/MASCOT.1998.693668","url":null,"abstract":"As the processor-memory performance gap continues to grow, so does the need for effective tools and metrics to guide the design of efficient memory hierarchies to bridge that gap. Aggregate statistics of cache performance can be useful for comparison, but they give us little insight into how to improve the design of a particular component. We propose a different approach to cache analysis-viewing caches as filters-and present two new metrics for analyzing cache behavior: instantaneous hit rate and instantaneous locality. We demonstrate how these measures can give us insight into the reference pattern of an executing program, and show an application of these measures in analyzing the effectiveness of the second level cache of a particular memory hierarchy.","PeriodicalId":272859,"journal":{"name":"Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247)","volume":"132 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":"133976567","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
扫码关注我们
求助内容：
应助结果提醒方式：