Pub Date : 2002-07-01DOI: 10.1109/ISCC.2002.1021744
T. Nagase, T. Araki, Y. Yoshioka, Tadao Nakamura
In unspecified bit rate (UBR) service provided by ATM networks, users send cells into networks with no feedback; no guarantee cells may be dropped during congestion. This paper describes a congestion control scheme using active network technology to avoid congestion in a conventional ATM network. The Ants routing algorithm for congestion control associated with active networks is implemented. The routing algorithm uses information that is monitored and revised according to the congestion status of output ports and sends commands to other switching elements. The active switching elements share information about traffic levels of the interconnection network and reciprocate customized programs for rerouting cells in the presence of congestion at a switching element's output ports. As a result, it is possible to build an active switching network that can avoid congestion in a conventional ATM network.
{"title":"Moderating traffic flow over conventional ATM service","authors":"T. Nagase, T. Araki, Y. Yoshioka, Tadao Nakamura","doi":"10.1109/ISCC.2002.1021744","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021744","url":null,"abstract":"In unspecified bit rate (UBR) service provided by ATM networks, users send cells into networks with no feedback; no guarantee cells may be dropped during congestion. This paper describes a congestion control scheme using active network technology to avoid congestion in a conventional ATM network. The Ants routing algorithm for congestion control associated with active networks is implemented. The routing algorithm uses information that is monitored and revised according to the congestion status of output ports and sends commands to other switching elements. The active switching elements share information about traffic levels of the interconnection network and reciprocate customized programs for rerouting cells in the presence of congestion at a switching element's output ports. As a result, it is possible to build an active switching network that can avoid congestion in a conventional ATM network.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127624328","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 : 2002-07-01DOI: 10.1109/ISCC.2002.1021687
Wen-Huei Chen, Cho-Ching Lu
We improve an earlier test sequence generation method for testing the conformance of a protocol implementation to its specification modeled by an extended finite state machine (EFSM) represented by a flow digraph. The earlier method produces an executable test sequence (i.e., one that has feasible parameter values) that covers a set of define-clear-use paths of the flow digraph for testing the data portion of the EFSM. We first overlap these define-clear-use paths into a shorter executable test sequence that tests the data portion. Second, we overlap the new test sequence with a set of transition-verifying paths for testing the control portion.
{"title":"Executable test sequence for the protocol control and data flow property with overlapping","authors":"Wen-Huei Chen, Cho-Ching Lu","doi":"10.1109/ISCC.2002.1021687","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021687","url":null,"abstract":"We improve an earlier test sequence generation method for testing the conformance of a protocol implementation to its specification modeled by an extended finite state machine (EFSM) represented by a flow digraph. The earlier method produces an executable test sequence (i.e., one that has feasible parameter values) that covers a set of define-clear-use paths of the flow digraph for testing the data portion of the EFSM. We first overlap these define-clear-use paths into a shorter executable test sequence that tests the data portion. Second, we overlap the new test sequence with a set of transition-verifying paths for testing the control portion.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132961210","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 : 2002-07-01DOI: 10.1109/ISCC.2002.1021669
K. Begain, G. I. Rózsa, A. Pfening, M. Telek
The paper presents an analytical model for a GSM-based cellular mobile network that applies an intelligent under-overlay (IUO) scheme to increase capacity by increasing frequency reuse while maintaining service quality. The IUO is a multi-layer cell structure that is based on dividing the frequency band into super layer and regular layer frequency groups. The super frequencies (channels) can be used by mobile stations with good C/I (carrier/interferer) ratio, while the regular frequencies can be used over the whole cell. The use of IUO is expected to provide up to 40% gain of capacity (see Nokia Telecommunications, www.nokia.com). We study the effect of various parameters on the performance of networks using IUO and provide practical planning support based on the analytical results. The considered parameters include network parameters, like super area coverage, and mobile user mobility parameters, like moving mobile ratio and average mobile speed.
{"title":"Performance analysis of GSM networks with intelligent underlay-overlay","authors":"K. Begain, G. I. Rózsa, A. Pfening, M. Telek","doi":"10.1109/ISCC.2002.1021669","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021669","url":null,"abstract":"The paper presents an analytical model for a GSM-based cellular mobile network that applies an intelligent under-overlay (IUO) scheme to increase capacity by increasing frequency reuse while maintaining service quality. The IUO is a multi-layer cell structure that is based on dividing the frequency band into super layer and regular layer frequency groups. The super frequencies (channels) can be used by mobile stations with good C/I (carrier/interferer) ratio, while the regular frequencies can be used over the whole cell. The use of IUO is expected to provide up to 40% gain of capacity (see Nokia Telecommunications, www.nokia.com). We study the effect of various parameters on the performance of networks using IUO and provide practical planning support based on the analytical results. The considered parameters include network parameters, like super area coverage, and mobile user mobility parameters, like moving mobile ratio and average mobile speed.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115103679","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 : 2002-07-01DOI: 10.1109/ISCC.2002.1021794
Arunabha Sen, Ibraz Mohammed, Ravikanth Samprathi, S. Bandyopadhyay
Over the years several queuing policies have been proposed to ensure fairness between competing requests at a service point. The fair queuing (FQ) algorithm due to Demers, Keshav and Shenkar (1990) is a queuing technique that attains near perfect fairness, where perfect fairness is considered to be the one attained by a fluid flow model. In a data network, the head of the line processor sharing (PS) is considered to be the most fair algorithm. It has been shown that the difference in throughput at any time, in any queue, for any arrival pattern between the FQ and the PS discipline will never exceed MAX, where MAX is the maximum packet size. This difference in throughput is taken as a metric for fairness measure of a queuing algorithm. The drawback of the FQ algorithm is its high packet processing overhead (O (log N)), where N is the number of active flows. To alleviate this problem of high computational complexity, Shreedhar and Varghese (1996) proposed a fair queuing algorithm based on the idea of deficit round robin (DRR). Although DRR reduces the packet processing overhead to O(1), its fairness measure is considerably worse (3MAX) than that of FQ (MAX). In this paper, we present a new round robin based fair queuing algorithm (FQRR) whose packet processing overhead is O(1) and fairness measure is 2MAX.
{"title":"Fair queuing with round robin: a new packet scheduling algorithm for routers","authors":"Arunabha Sen, Ibraz Mohammed, Ravikanth Samprathi, S. Bandyopadhyay","doi":"10.1109/ISCC.2002.1021794","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021794","url":null,"abstract":"Over the years several queuing policies have been proposed to ensure fairness between competing requests at a service point. The fair queuing (FQ) algorithm due to Demers, Keshav and Shenkar (1990) is a queuing technique that attains near perfect fairness, where perfect fairness is considered to be the one attained by a fluid flow model. In a data network, the head of the line processor sharing (PS) is considered to be the most fair algorithm. It has been shown that the difference in throughput at any time, in any queue, for any arrival pattern between the FQ and the PS discipline will never exceed MAX, where MAX is the maximum packet size. This difference in throughput is taken as a metric for fairness measure of a queuing algorithm. The drawback of the FQ algorithm is its high packet processing overhead (O (log N)), where N is the number of active flows. To alleviate this problem of high computational complexity, Shreedhar and Varghese (1996) proposed a fair queuing algorithm based on the idea of deficit round robin (DRR). Although DRR reduces the packet processing overhead to O(1), its fairness measure is considerably worse (3MAX) than that of FQ (MAX). In this paper, we present a new round robin based fair queuing algorithm (FQRR) whose packet processing overhead is O(1) and fairness measure is 2MAX.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126951961","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 : 2002-07-01DOI: 10.1109/ISCC.2002.1021783
P. Ho, H. Mouftah
This paper solves the problem of path selection for connection-oriented MPLS-based mesh networks with a special focus on implementation issues in middle-sized networks, such as metropolitan-area networks (MANs). A novel network planning algorithm, called capacity-balanced alternate routing (C-BAR), is proposed. For C-BAR, alternate paths between each ingress-egress pair are defined at a network planning stage according to the network topology and potential traffic load and location of each ingress-egress pair so that load-balancing can be achieved in routing label switched paths (LSPs). Both analytical and simulation-based studies have been conducted to examine the proposed approach. The results show that the C-BAR algorithm can significantly improve the performance in blocking probability by spreading potential traffic to the whole network compared with other reported connection-oriented routing schemes.
{"title":"Capacity-balanced alternate routing for MPLS traffic engineering","authors":"P. Ho, H. Mouftah","doi":"10.1109/ISCC.2002.1021783","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021783","url":null,"abstract":"This paper solves the problem of path selection for connection-oriented MPLS-based mesh networks with a special focus on implementation issues in middle-sized networks, such as metropolitan-area networks (MANs). A novel network planning algorithm, called capacity-balanced alternate routing (C-BAR), is proposed. For C-BAR, alternate paths between each ingress-egress pair are defined at a network planning stage according to the network topology and potential traffic load and location of each ingress-egress pair so that load-balancing can be achieved in routing label switched paths (LSPs). Both analytical and simulation-based studies have been conducted to examine the proposed approach. The results show that the C-BAR algorithm can significantly improve the performance in blocking probability by spreading potential traffic to the whole network compared with other reported connection-oriented routing schemes.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125915439","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 : 2002-07-01DOI: 10.1109/ISCC.2002.1021709
James S. Pascoe, V. Sunderam, R. Loader, G. Sibley
This paper presents schemes that enable high level communications protocols and applications to adapt to connectivity loss and quality degradation in metropolitan area wireless networks. We postulate that the majority of these problem areas or trouble spots, which are intrinsic to wireless networks, are related to location and environmental factors. Based on this premise, we propose a mechanism that gathers semantic data pertaining to trouble spots; prior knowledge of such locations can be used by higher-level communication protocols to preemptively adapt, thereby avoiding undesirable effects at the application level. To facilitate the detection and categorization of trouble spots, we propose a list of metrics to analyze the status of a wireless service. We report on our experiences with using these metrics to identify trouble spots and present initial results from an experimental evaluation of their effectiveness.
{"title":"Facilitating adaptation to trouble spots in wireless MANs","authors":"James S. Pascoe, V. Sunderam, R. Loader, G. Sibley","doi":"10.1109/ISCC.2002.1021709","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021709","url":null,"abstract":"This paper presents schemes that enable high level communications protocols and applications to adapt to connectivity loss and quality degradation in metropolitan area wireless networks. We postulate that the majority of these problem areas or trouble spots, which are intrinsic to wireless networks, are related to location and environmental factors. Based on this premise, we propose a mechanism that gathers semantic data pertaining to trouble spots; prior knowledge of such locations can be used by higher-level communication protocols to preemptively adapt, thereby avoiding undesirable effects at the application level. To facilitate the detection and categorization of trouble spots, we propose a list of metrics to analyze the status of a wireless service. We report on our experiences with using these metrics to identify trouble spots and present initial results from an experimental evaluation of their effectiveness.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121984359","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 : 2002-07-01DOI: 10.1109/ISCC.2002.1021722
R. Maresca, M. D'Arienzo, M. Esposito, S. Romano, G. Ventre
Virtual private networks (VPN) represent, in today's Internet, one of the most interesting applications. This is due both to their usefulness in corporate network scenarios and to the high revenues they guarantee to network providers. We propose an innovative approach to VPN implementation, exploiting the capabilities of active networks. We present a model aiming at building and dynamically configuring VPNs in a modular way and with a high degree of flexibility. We claim that the proposed approach has substantial advantages over traditional techniques and clearly shows how active technologies may help network engineers realize a number of critical applications for next generation networks.
{"title":"An active network approach to virtual private networks","authors":"R. Maresca, M. D'Arienzo, M. Esposito, S. Romano, G. Ventre","doi":"10.1109/ISCC.2002.1021722","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021722","url":null,"abstract":"Virtual private networks (VPN) represent, in today's Internet, one of the most interesting applications. This is due both to their usefulness in corporate network scenarios and to the high revenues they guarantee to network providers. We propose an innovative approach to VPN implementation, exploiting the capabilities of active networks. We present a model aiming at building and dynamically configuring VPNs in a modular way and with a high degree of flexibility. We claim that the proposed approach has substantial advantages over traditional techniques and clearly shows how active technologies may help network engineers realize a number of critical applications for next generation networks.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129790382","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 : 2002-07-01DOI: 10.1109/ISCC.2002.1021742
Chi-Chun Lo, Bing-Wen Chuang
A restoration mechanism based on backup capacity provides a solution for assuring network survivability. In this paper we propose an adaptive survivability admission control mechanism using backup virtual paths for self-healing asynchronous transfer mode (ATM) networks. Working virtual paths (WVP) and backup virtual paths (BVP) are configured during the network design phase. For each call request, the proposed mechanism selects a pair of WVP and BVP followed by bandwidth reservation for the pair only if both the WVP and the BVP selected succeed in the call admission control. A backup dependency matrix (BDM) is suggested for recording the most up-to-date information of backup capacity required on a link for restoring a failure on other links. However backup capacity actually reserved on a link is shared by all BVP passing the same link. This "sharing" concept substantially reduces the amount of backup capacity required. The selection of BVP uses the BDM so as to make the selection adaptive to the current traffic loads on the network. Two BVP selection methods, min-cost and min-expectation, are proposed. The min-cost strategy increases network utilization while maintaining full survivability under a single link failure. On the contrary, the min-expectation strategy enhances network survivability by slightly reducing network utilization.
{"title":"An adaptive survivability admission control mechanism using backup VPs for self-healing ATM networks","authors":"Chi-Chun Lo, Bing-Wen Chuang","doi":"10.1109/ISCC.2002.1021742","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021742","url":null,"abstract":"A restoration mechanism based on backup capacity provides a solution for assuring network survivability. In this paper we propose an adaptive survivability admission control mechanism using backup virtual paths for self-healing asynchronous transfer mode (ATM) networks. Working virtual paths (WVP) and backup virtual paths (BVP) are configured during the network design phase. For each call request, the proposed mechanism selects a pair of WVP and BVP followed by bandwidth reservation for the pair only if both the WVP and the BVP selected succeed in the call admission control. A backup dependency matrix (BDM) is suggested for recording the most up-to-date information of backup capacity required on a link for restoring a failure on other links. However backup capacity actually reserved on a link is shared by all BVP passing the same link. This \"sharing\" concept substantially reduces the amount of backup capacity required. The selection of BVP uses the BDM so as to make the selection adaptive to the current traffic loads on the network. Two BVP selection methods, min-cost and min-expectation, are proposed. The min-cost strategy increases network utilization while maintaining full survivability under a single link failure. On the contrary, the min-expectation strategy enhances network survivability by slightly reducing network utilization.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129045618","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 : 2002-07-01DOI: 10.1109/ISCC.2002.1021696
Binh Thai, Stephen Wan, A. Seneviratne
Integrated Personal Mobility Architecture (IPMoA) is a personal mobility framework that supports personality in both the areas of personal communications and personalising the user's operation environments and services. In this paper, we describe how we use mobile agents in this architecture to achieve the results of providing personal, mobility support in the area of personalising the user's operational environments and services. In particular, we describe the functionality of the Personal Service Assistant (PSA). The services that a PSA can provide includes executing user's applications that cannot be "migrated" with the user, such as applications implemented in native code, and customised Internet services, namely HTTP and e-mail, based on the user's terminal and network characteristics. This paper then illustrates the viability of the proposed scheme through a prototype implementation.
{"title":"Executions of \"home applications\" and service customisations in Integrated Personal Mobility Architecture","authors":"Binh Thai, Stephen Wan, A. Seneviratne","doi":"10.1109/ISCC.2002.1021696","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021696","url":null,"abstract":"Integrated Personal Mobility Architecture (IPMoA) is a personal mobility framework that supports personality in both the areas of personal communications and personalising the user's operation environments and services. In this paper, we describe how we use mobile agents in this architecture to achieve the results of providing personal, mobility support in the area of personalising the user's operational environments and services. In particular, we describe the functionality of the Personal Service Assistant (PSA). The services that a PSA can provide includes executing user's applications that cannot be \"migrated\" with the user, such as applications implemented in native code, and customised Internet services, namely HTTP and e-mail, based on the user's terminal and network characteristics. This paper then illustrates the viability of the proposed scheme through a prototype implementation.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122611268","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 : 2002-07-01DOI: 10.1109/ISCC.2002.1021738
Andrea Santoro, F. Quaglia
In this paper we present a communication layer for Myrinet based clusters, designed to efficiently support preemptive rollback operations in optimistic parallel simulation. Beyond standard low latency message delivery functionalities, this layer also embeds functionalities for allowing the overlying simulation application to efficiently track whether an incoming message will actually produce causality inconsistency of the currently executed simulation event upon its receipt at the application level. Exploiting these functionalities, awareness of the inconsistency precedes the message receipt at the application level, thus allowing timely event execution interruption for activating rollback procedures. Experimental results on a standard simulation benchmark show that the layer we implement allows a strong reduction of the rollback overhead which, in its turn, yields strong performance improvements (up to 33%), especially in case of large parallelism in the simulation model execution.
{"title":"Software supports for preemptive rollback in optimistic parallel simulation on Myrinet clusters","authors":"Andrea Santoro, F. Quaglia","doi":"10.1109/ISCC.2002.1021738","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021738","url":null,"abstract":"In this paper we present a communication layer for Myrinet based clusters, designed to efficiently support preemptive rollback operations in optimistic parallel simulation. Beyond standard low latency message delivery functionalities, this layer also embeds functionalities for allowing the overlying simulation application to efficiently track whether an incoming message will actually produce causality inconsistency of the currently executed simulation event upon its receipt at the application level. Exploiting these functionalities, awareness of the inconsistency precedes the message receipt at the application level, thus allowing timely event execution interruption for activating rollback procedures. Experimental results on a standard simulation benchmark show that the layer we implement allows a strong reduction of the rollback overhead which, in its turn, yields strong performance improvements (up to 33%), especially in case of large parallelism in the simulation model execution.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128436351","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
扫码关注我们
求助内容：
应助结果提醒方式：