Pub Date : 1995-06-27DOI: 10.1109/SCAC.1995.523694
B. Welch, A. Helal, R. Elmasri
A methodology for detecting failures that occur in distributed computer systems connected by a communications network is described. The methodology utilizes active polling of monitored systems. The entities polled must be service entities that function at the application layers of service providing machines. A prototype system has been implemented to test this methodology.
{"title":"A resilient application-level failure detection system for distributed computing environments","authors":"B. Welch, A. Helal, R. Elmasri","doi":"10.1109/SCAC.1995.523694","DOIUrl":"https://doi.org/10.1109/SCAC.1995.523694","url":null,"abstract":"A methodology for detecting failures that occur in distributed computer systems connected by a communications network is described. The methodology utilizes active polling of monitored systems. The entities polled must be service entities that function at the application layers of service providing machines. A prototype system has been implemented to test this methodology.","PeriodicalId":90699,"journal":{"name":"Proceedings. IEEE Symposium on Computers and Communications","volume":"66 4 1","pages":"401-406"},"PeriodicalIF":0.0,"publicationDate":"1995-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89876243","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 : 1995-06-27DOI: 10.1109/SCAC.1995.523698
A. Nguyen, N. Bambos, M. Sherif
Integrated multiplexing schemes are needed to optimize the use of transmission bandwidth in integrated networks. In this paper, we introduce the idea of a dynamically controlled (T/sub 1/, T/sub 2/) multiplexing scheme. The advantages of this transmission policy is that it allocates the transmission capacity of the channel to two traffic types according to the instantaneous needs. We consider only two types of traffic, voice band traffic and digital data. The channel access times for voice and data are T/sub 1/ and T/sub 2/, respectively. In this paper, we present some preliminary results of our proposed scheme. In our simulations, we observe that a reduction in blocking probability of 15% or more is possible.
{"title":"Adaptive (T/sub 1/, T/sub 2/)-multiplexing transmission schemes for voice/data integrated networks","authors":"A. Nguyen, N. Bambos, M. Sherif","doi":"10.1109/SCAC.1995.523698","DOIUrl":"https://doi.org/10.1109/SCAC.1995.523698","url":null,"abstract":"Integrated multiplexing schemes are needed to optimize the use of transmission bandwidth in integrated networks. In this paper, we introduce the idea of a dynamically controlled (T/sub 1/, T/sub 2/) multiplexing scheme. The advantages of this transmission policy is that it allocates the transmission capacity of the channel to two traffic types according to the instantaneous needs. We consider only two types of traffic, voice band traffic and digital data. The channel access times for voice and data are T/sub 1/ and T/sub 2/, respectively. In this paper, we present some preliminary results of our proposed scheme. In our simulations, we observe that a reduction in blocking probability of 15% or more is possible.","PeriodicalId":90699,"journal":{"name":"Proceedings. IEEE Symposium on Computers and Communications","volume":"43 1","pages":"430-435"},"PeriodicalIF":0.0,"publicationDate":"1995-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90701703","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 : 1995-06-27DOI: 10.1109/SCAC.1995.523697
H. Mathkour, A. Al-Salamah
A machine learning technique based database monitoring system is introduced. We report on a system which makes use of effective machine learning techniques to analyze user's queries and make appropriate, valuable suggestions to the database administrator (DBA) to fine tune the performance of the database at hand. The system uses several machine learning algorithms to monitor the queries and attempt to extract commonalities exhibited by the queries. The concepts learnt are passed to another module of the system which will perform the restructuring of the database. We also report on the design and development of a carefully selected database application and the set of queries formed for the system.
{"title":"A machine learning technique for monitoring database systems","authors":"H. Mathkour, A. Al-Salamah","doi":"10.1109/SCAC.1995.523697","DOIUrl":"https://doi.org/10.1109/SCAC.1995.523697","url":null,"abstract":"A machine learning technique based database monitoring system is introduced. We report on a system which makes use of effective machine learning techniques to analyze user's queries and make appropriate, valuable suggestions to the database administrator (DBA) to fine tune the performance of the database at hand. The system uses several machine learning algorithms to monitor the queries and attempt to extract commonalities exhibited by the queries. The concepts learnt are passed to another module of the system which will perform the restructuring of the database. We also report on the design and development of a carefully selected database application and the set of queries formed for the system.","PeriodicalId":90699,"journal":{"name":"Proceedings. IEEE Symposium on Computers and Communications","volume":"45 1","pages":"421-427"},"PeriodicalIF":0.0,"publicationDate":"1995-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78291140","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 : 1995-06-27DOI: 10.1109/SCAC.1995.523679
Habib M. Ammari, A. Jaoua
This paper discusses how a program can be represented by a binary relation, R, and how to decompose the latter into a set of rectangular relations. Next, we present our methodology based on relational operators and dependence relations, to show how we can use these rectangles to obtain more interesting ones that describe the entire behavior of every variable in the program. The notion of lattice of maximal rectangles is effective in that it permits to have a particular representation of the program which shows all the different parts that constitute the original program. By looking at this lattice structure, we find that the set of the leaves of this lattice, which represent "pertinent" rectangles associated to output variables, gives a minimal program covering.
{"title":"Minimal program covering based on the output variables","authors":"Habib M. Ammari, A. Jaoua","doi":"10.1109/SCAC.1995.523679","DOIUrl":"https://doi.org/10.1109/SCAC.1995.523679","url":null,"abstract":"This paper discusses how a program can be represented by a binary relation, R, and how to decompose the latter into a set of rectangular relations. Next, we present our methodology based on relational operators and dependence relations, to show how we can use these rectangles to obtain more interesting ones that describe the entire behavior of every variable in the program. The notion of lattice of maximal rectangles is effective in that it permits to have a particular representation of the program which shows all the different parts that constitute the original program. By looking at this lattice structure, we find that the set of the leaves of this lattice, which represent \"pertinent\" rectangles associated to output variables, gives a minimal program covering.","PeriodicalId":90699,"journal":{"name":"Proceedings. IEEE Symposium on Computers and Communications","volume":"70 1","pages":"282-288"},"PeriodicalIF":0.0,"publicationDate":"1995-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79162330","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 : 1995-06-27DOI: 10.1109/SCAC.1995.523659
M. Mansour, F. Wong
The paper provides a set of guidelines to design and evaluate automatic restoration for telecommunication networks. The operation of a telecommunications network is defined to be in one of three modes: normal, abnormal and restorative. The paper emphasizes the coordinated performance of a network management system (NMS) and an automatic restoration system (RS). The NMS detects the abnormal mode, and the RS restores normal operating conditions. The paper defines and explains the necessary steps of real-time restoration, provides design and evaluation parameters for automatic restoration and presents the operational reliability considerations.
{"title":"Automatic restoration of telecommunication networks","authors":"M. Mansour, F. Wong","doi":"10.1109/SCAC.1995.523659","DOIUrl":"https://doi.org/10.1109/SCAC.1995.523659","url":null,"abstract":"The paper provides a set of guidelines to design and evaluate automatic restoration for telecommunication networks. The operation of a telecommunications network is defined to be in one of three modes: normal, abnormal and restorative. The paper emphasizes the coordinated performance of a network management system (NMS) and an automatic restoration system (RS). The NMS detects the abnormal mode, and the RS restores normal operating conditions. The paper defines and explains the necessary steps of real-time restoration, provides design and evaluation parameters for automatic restoration and presents the operational reliability considerations.","PeriodicalId":90699,"journal":{"name":"Proceedings. IEEE Symposium on Computers and Communications","volume":"17 1","pages":"141-147"},"PeriodicalIF":0.0,"publicationDate":"1995-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/SCAC.1995.523659","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72526002","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 : 1995-06-27DOI: 10.1109/SCAC.1995.523641
A. Zaghloul, H. Perros
In this paper, we present an approximate analysis of a generic shared-medium ATM switch with input and output queueing. Input traffic is assumed to be bursty and is modelled by an interrupted Bernoulli process (IBP). Three different bus service policies are analyzed: time division multiplexing (TDM), cyclic, and random. The output links may have constant or geometric service time. The analysis is based on the notion of decomposition whereby the switch is decomposed into smaller sub-systems. First, each input queue is analyzed in isolation after we modify its service process. Subsequently, the shared medium is analyzed as a separate sub-system utilizing the output process of each input queue. Finally, each output queue is analyzed in isolation. The results from the individual sub-systems are combined together through an iterative scheme. This method permits realistic system characteristics such as limited buffer size, asymmetric load conditions, and nonuniform destinations to be taken into consideration in the analysis. The model's accuracy is verified through simulation.
{"title":"Performance analysis of a shared-medium ATM switch","authors":"A. Zaghloul, H. Perros","doi":"10.1109/SCAC.1995.523641","DOIUrl":"https://doi.org/10.1109/SCAC.1995.523641","url":null,"abstract":"In this paper, we present an approximate analysis of a generic shared-medium ATM switch with input and output queueing. Input traffic is assumed to be bursty and is modelled by an interrupted Bernoulli process (IBP). Three different bus service policies are analyzed: time division multiplexing (TDM), cyclic, and random. The output links may have constant or geometric service time. The analysis is based on the notion of decomposition whereby the switch is decomposed into smaller sub-systems. First, each input queue is analyzed in isolation after we modify its service process. Subsequently, the shared medium is analyzed as a separate sub-system utilizing the output process of each input queue. Finally, each output queue is analyzed in isolation. The results from the individual sub-systems are combined together through an iterative scheme. This method permits realistic system characteristics such as limited buffer size, asymmetric load conditions, and nonuniform destinations to be taken into consideration in the analysis. The model's accuracy is verified through simulation.","PeriodicalId":90699,"journal":{"name":"Proceedings. IEEE Symposium on Computers and Communications","volume":"83 1","pages":"16-22"},"PeriodicalIF":0.0,"publicationDate":"1995-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85599895","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 : 1995-06-27DOI: 10.1109/SCAC.1995.523693
H. Meleis
The obstacles to adopting new network technologies that enable new applications and services are reviewed and discussed. Technologies such as client-server and interconnection mechanisms enable the realization of new applications which are "nice to have." Making these new technologies as easy as possible to exploit and use is a key in adopting them. Obstacles such as cost and complexity of managing the changes have been proven to be two of the barriers to adopting these technologies. Additionally, ignoring the importance of the legacy systems and their associated applications services, and infrastructures as well as introducing a set of new technologies which may not work well with the older systems impedes the acceptance of these new technologies. A set of migration technologies and strategies must be developed to remove the obstacles and to accelerate the adoption of these new network technologies.
{"title":"Removing the obstacles to network technology adoption","authors":"H. Meleis","doi":"10.1109/SCAC.1995.523693","DOIUrl":"https://doi.org/10.1109/SCAC.1995.523693","url":null,"abstract":"The obstacles to adopting new network technologies that enable new applications and services are reviewed and discussed. Technologies such as client-server and interconnection mechanisms enable the realization of new applications which are \"nice to have.\" Making these new technologies as easy as possible to exploit and use is a key in adopting them. Obstacles such as cost and complexity of managing the changes have been proven to be two of the barriers to adopting these technologies. Additionally, ignoring the importance of the legacy systems and their associated applications services, and infrastructures as well as introducing a set of new technologies which may not work well with the older systems impedes the acceptance of these new technologies. A set of migration technologies and strategies must be developed to remove the obstacles and to accelerate the adoption of these new network technologies.","PeriodicalId":90699,"journal":{"name":"Proceedings. IEEE Symposium on Computers and Communications","volume":"12 1","pages":"392-400"},"PeriodicalIF":0.0,"publicationDate":"1995-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90259239","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 : 1995-06-27DOI: 10.1109/SCAC.1995.523660
M. El-Hadidi, N. Hegazi, H. Aslan
A software-based implementation of a hybrid encryption scheme for Ethernet LAN is given. It uses a DES-type symmetric key for information exchange between communicating users. In addition, a Diffie-Hellman method is adopted for key distribution which incorporates an RSA-type public key scheme for securing the exchange of the symmetric key components. To facilitate distribution of public keys and to guarantee authenticity, a separate network entity called security management facility (SMF) is deployed. A brief description of the software components for the proposed hybrid encryption scheme is given, and a Petri net representation of the software operation is provided. In addition, evaluation of the proposed scheme is carried out on a prototype network, and the numerical values for the encryption time and the message transfer time are obtained to illustrate the feasibility of the new scheme.
{"title":"Implementation of a hybrid encryption scheme for Ethernet","authors":"M. El-Hadidi, N. Hegazi, H. Aslan","doi":"10.1109/SCAC.1995.523660","DOIUrl":"https://doi.org/10.1109/SCAC.1995.523660","url":null,"abstract":"A software-based implementation of a hybrid encryption scheme for Ethernet LAN is given. It uses a DES-type symmetric key for information exchange between communicating users. In addition, a Diffie-Hellman method is adopted for key distribution which incorporates an RSA-type public key scheme for securing the exchange of the symmetric key components. To facilitate distribution of public keys and to guarantee authenticity, a separate network entity called security management facility (SMF) is deployed. A brief description of the software components for the proposed hybrid encryption scheme is given, and a Petri net representation of the software operation is provided. In addition, evaluation of the proposed scheme is carried out on a prototype network, and the numerical values for the encryption time and the message transfer time are obtained to illustrate the feasibility of the new scheme.","PeriodicalId":90699,"journal":{"name":"Proceedings. IEEE Symposium on Computers and Communications","volume":"77 1","pages":"150-156"},"PeriodicalIF":0.0,"publicationDate":"1995-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88110743","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 : 1995-06-27DOI: 10.1109/SCAC.1995.523682
J. Lias
The paper provides a strategic impact analysis of communications technology on a nations' global competitiveness. Global competitiveness and its definition is described, along with communications architectures, technologies and economics that have a direct impact on national competitiveness. It is shown that enhancing the communications needs of business workers can fundamentally shift the global competitive position of a nation. The technologies and architectures required to enable the satisfaction of these communications needs are analyzed. Technology and architectural evolution required to provide a business worker oriented service offering from PTTs and communications service providers is also presented.
{"title":"Building a network infrastructure for global competitiveness","authors":"J. Lias","doi":"10.1109/SCAC.1995.523682","DOIUrl":"https://doi.org/10.1109/SCAC.1995.523682","url":null,"abstract":"The paper provides a strategic impact analysis of communications technology on a nations' global competitiveness. Global competitiveness and its definition is described, along with communications architectures, technologies and economics that have a direct impact on national competitiveness. It is shown that enhancing the communications needs of business workers can fundamentally shift the global competitive position of a nation. The technologies and architectures required to enable the satisfaction of these communications needs are analyzed. Technology and architectural evolution required to provide a business worker oriented service offering from PTTs and communications service providers is also presented.","PeriodicalId":90699,"journal":{"name":"Proceedings. IEEE Symposium on Computers and Communications","volume":"16 1","pages":"305-312"},"PeriodicalIF":0.0,"publicationDate":"1995-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88446304","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 : 1995-06-27DOI: 10.1109/SCAC.1995.523695
Y. Dakroury, J. Elloy
The manufacturing message specification (MMS) is an application service element of the manufacturing automation protocol (MAP) standardized by ISO to support messaging communication to and from programmable devices in a computer integrated manufacturing (CIM) environment. Although this MMS standard is designed to function in a distributed environment, its specification does not include a support to execute distributed transactions while these ones are mandatory for the CIM applications to support the manufacturing operations implemented by the distributed devices. We propose a distributed transaction processing facility that permits the organization of a distributed manufacturing process in terms of a set of MMS services encapsulated together to perform the manufacturing task. The facility is supported by the transaction processing (TP) standard, designed by the ISO, to guarantee the correct behavior of the distributed MMS transactions. This guarantee is based on the satisfaction of the atomicity, consistency, isolation, and durability (ACID) properties defined by the ISO.
{"title":"A distributed transaction processing facility for the MMS specification","authors":"Y. Dakroury, J. Elloy","doi":"10.1109/SCAC.1995.523695","DOIUrl":"https://doi.org/10.1109/SCAC.1995.523695","url":null,"abstract":"The manufacturing message specification (MMS) is an application service element of the manufacturing automation protocol (MAP) standardized by ISO to support messaging communication to and from programmable devices in a computer integrated manufacturing (CIM) environment. Although this MMS standard is designed to function in a distributed environment, its specification does not include a support to execute distributed transactions while these ones are mandatory for the CIM applications to support the manufacturing operations implemented by the distributed devices. We propose a distributed transaction processing facility that permits the organization of a distributed manufacturing process in terms of a set of MMS services encapsulated together to perform the manufacturing task. The facility is supported by the transaction processing (TP) standard, designed by the ISO, to guarantee the correct behavior of the distributed MMS transactions. This guarantee is based on the satisfaction of the atomicity, consistency, isolation, and durability (ACID) properties defined by the ISO.","PeriodicalId":90699,"journal":{"name":"Proceedings. IEEE Symposium on Computers and Communications","volume":"45 1","pages":"407-413"},"PeriodicalIF":0.0,"publicationDate":"1995-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89360520","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
扫码关注我们
求助内容：
应助结果提醒方式：