Pub Date : 1994-06-27DOI: 10.1109/SDNE.1994.337781
Don Libes
The NIST EXPRESS server is a computational facility at the National Institute of Standards and Technology (NIST), which provides the ability to run toolkit-based applications remotely. Users e-mail EXPRESS schemas and other data files to the server, which runs the requested applications on the files and returns any diagnostics or output. Applications requiring interaction can either be returned via e-mail so that they can be run locally, or run remotely by telnet or rlogin across the Internet. Access to the EXPRESS server is available free to anyone who can send e-mail. Use is anonymous by default, however it is possible to use the server as a collaborative testbed in which case results can be immediately shared with other server users. The server is capable of restricting file access to one user or a subset of users. It is also possible to make files publicly available. The server maintains many STEP-related standards and draft standards for public access. Machine-processable standards such as STEP schemas can be incorporated automatically when processing user files even if they are not publicly available. The server dramatically lowers the traditional start-up cost and manpower required to obtain and install STEP and EXPRESS tools as well as the continuing support costs to upgrade and maintain the software, by leveraging NIST research, software support and installation, and computing facilities. The server enables people to experiment or demonstrate STEP without a significant investment of time and money, allowing them to build experience and make informed decisions about their future needs for STEP.<>
{"title":"Concepts of the NIST EXPRESS server","authors":"Don Libes","doi":"10.1109/SDNE.1994.337781","DOIUrl":"https://doi.org/10.1109/SDNE.1994.337781","url":null,"abstract":"The NIST EXPRESS server is a computational facility at the National Institute of Standards and Technology (NIST), which provides the ability to run toolkit-based applications remotely. Users e-mail EXPRESS schemas and other data files to the server, which runs the requested applications on the files and returns any diagnostics or output. Applications requiring interaction can either be returned via e-mail so that they can be run locally, or run remotely by telnet or rlogin across the Internet. Access to the EXPRESS server is available free to anyone who can send e-mail. Use is anonymous by default, however it is possible to use the server as a collaborative testbed in which case results can be immediately shared with other server users. The server is capable of restricting file access to one user or a subset of users. It is also possible to make files publicly available. The server maintains many STEP-related standards and draft standards for public access. Machine-processable standards such as STEP schemas can be incorporated automatically when processing user files even if they are not publicly available. The server dramatically lowers the traditional start-up cost and manpower required to obtain and install STEP and EXPRESS tools as well as the continuing support costs to upgrade and maintain the software, by leveraging NIST research, software support and installation, and computing facilities. The server enables people to experiment or demonstrate STEP without a significant investment of time and money, allowing them to build experience and make informed decisions about their future needs for STEP.<<ETX>>","PeriodicalId":174691,"journal":{"name":"Proceedings of IEEE Workshop on Services for Distributed and Networked Environments","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128558237","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-06-27DOI: 10.1109/SDNE.1994.337762
Shepherd S. B. Shi, David D. H. Lin, C. Yang
The paper presents a dynamic load sharing implementation based on OSF (Open Software Foundation) DCE (Distributed Computing Environment). Although DCE provides a wide spectrum of services for developing distributed application, DCE does not provide load sharing services. The proposed algorithm makes use of the technique of threshold and a smoothing function to reduce the overhead incurred by workload information update. The proposed algorithm also considers the heterogeneity of hardware platforms.<>
{"title":"Dynamic load sharing services with OSF DCE","authors":"Shepherd S. B. Shi, David D. H. Lin, C. Yang","doi":"10.1109/SDNE.1994.337762","DOIUrl":"https://doi.org/10.1109/SDNE.1994.337762","url":null,"abstract":"The paper presents a dynamic load sharing implementation based on OSF (Open Software Foundation) DCE (Distributed Computing Environment). Although DCE provides a wide spectrum of services for developing distributed application, DCE does not provide load sharing services. The proposed algorithm makes use of the technique of threshold and a smoothing function to reduce the overhead incurred by workload information update. The proposed algorithm also considers the heterogeneity of hardware platforms.<<ETX>>","PeriodicalId":174691,"journal":{"name":"Proceedings of IEEE Workshop on Services for Distributed and Networked Environments","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127610700","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-06-27DOI: 10.1109/SDNE.1994.337771
J. Bacon, R. Hayton, S. Lo, K. Moody
We have designed and built a modular and extensible multi service storage architecture (MSSA) which allows evolution from, and compatibility with, traditional applications. The MSSA comprises a two-level hierarchy of storage servers with value-adding service layers above them. We present the access control mechanism of the MSSA. Access control lists (ACLs) are used to allow fine grained expression of policy together with capabilities for efficient runtime access after a once-off ACL check. Our capabilities are principal-specific and transient and their design ensures that access to objects is via the correct service hierarchy; for example, a directory object may only be manipulated via a directory service. The implementation of this protection is stateless at the servers above the storage service. The scheme also provides a convenient means to delegate rights for an object, temporarily, to an unprivileged server, for example a print-server. The fact that our capabilities are short-lived alleviates the requirement for selective revocation and crash recovery. We report on experiences with a prototype implementation of the scheme and suggest some optimisations.<>
{"title":"Access control for a modular, extensible storage service","authors":"J. Bacon, R. Hayton, S. Lo, K. Moody","doi":"10.1109/SDNE.1994.337771","DOIUrl":"https://doi.org/10.1109/SDNE.1994.337771","url":null,"abstract":"We have designed and built a modular and extensible multi service storage architecture (MSSA) which allows evolution from, and compatibility with, traditional applications. The MSSA comprises a two-level hierarchy of storage servers with value-adding service layers above them. We present the access control mechanism of the MSSA. Access control lists (ACLs) are used to allow fine grained expression of policy together with capabilities for efficient runtime access after a once-off ACL check. Our capabilities are principal-specific and transient and their design ensures that access to objects is via the correct service hierarchy; for example, a directory object may only be manipulated via a directory service. The implementation of this protection is stateless at the servers above the storage service. The scheme also provides a convenient means to delegate rights for an object, temporarily, to an unprivileged server, for example a print-server. The fact that our capabilities are short-lived alleviates the requirement for selective revocation and crash recovery. We report on experiences with a prototype implementation of the scheme and suggest some optimisations.<<ETX>>","PeriodicalId":174691,"journal":{"name":"Proceedings of IEEE Workshop on Services for Distributed and Networked Environments","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130601039","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-06-27DOI: 10.1109/SDNE.1994.337766
G. Gimenez, J. Iñigo, J. Lagares, L. Navarro, F. Reig, G. Rodríguez
"Real world" group work occurs in a complex sociotechnical environment: CSCW and distributed systems have a word to say. This environment poses problems such as how to manage the whole system without having a master central element, how to support a diverse and large community of people, how to obtain information about different resources, how different systems can interoperate with unlike functionality, etc. A contribution to deal with this problem is given by means of an explicit resource management function. Scaling up is supported by a federation mechanism. The paper describes a modelling approach for this environment, a computational model and some engineering issues of a prototype system being developed in the framework of the ESPRIT BRA COMIC.<>
“真实世界”的小组工作发生在复杂的社会技术环境中:CSCW和分布式系统有话要说。这种环境提出了一些问题，例如如何在没有主中心元素的情况下管理整个系统，如何支持多样化的大型社区，如何获取关于不同资源的信息，不同的系统如何与不同的功能进行互操作，等等。通过显式的资源管理功能，可以解决这个问题。扩展由联邦机制支持。本文描述了该环境的建模方法、计算模型以及在ESPRIT BRA COMIC框架下正在开发的原型系统的一些工程问题。
{"title":"Ecology in global distributed systems","authors":"G. Gimenez, J. Iñigo, J. Lagares, L. Navarro, F. Reig, G. Rodríguez","doi":"10.1109/SDNE.1994.337766","DOIUrl":"https://doi.org/10.1109/SDNE.1994.337766","url":null,"abstract":"\"Real world\" group work occurs in a complex sociotechnical environment: CSCW and distributed systems have a word to say. This environment poses problems such as how to manage the whole system without having a master central element, how to support a diverse and large community of people, how to obtain information about different resources, how different systems can interoperate with unlike functionality, etc. A contribution to deal with this problem is given by means of an explicit resource management function. Scaling up is supported by a federation mechanism. The paper describes a modelling approach for this environment, a computational model and some engineering issues of a prototype system being developed in the framework of the ESPRIT BRA COMIC.<<ETX>>","PeriodicalId":174691,"journal":{"name":"Proceedings of IEEE Workshop on Services for Distributed and Networked Environments","volume":"871 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120882220","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-06-27DOI: 10.1109/SDNE.1994.337776
D. Bachmann, P. Honeyman, L. Huston
Because we like to run the AFS distributed file system on dataless clients at our homes, it is vital that the meager bandwidth available be used effectively. This makes Rx, the AFS remote procedure call package, a critical link in the overall system performance chain. We report on progress in adapting Rx to networks characterized by low bandwidth, high delay, or variable round-trip time. When we started, the throughput delivered by Rx over dialup networks was approximately zero, due to fragmentation and congestion collapse. By making extensive modifications to Rx, focusing on congestion avoidance and control and header compression, we have accomplished our throughput objectives and made Rx a high-performing transport layer.<>
{"title":"The Rx Hex [AFS remote procedure call package]","authors":"D. Bachmann, P. Honeyman, L. Huston","doi":"10.1109/SDNE.1994.337776","DOIUrl":"https://doi.org/10.1109/SDNE.1994.337776","url":null,"abstract":"Because we like to run the AFS distributed file system on dataless clients at our homes, it is vital that the meager bandwidth available be used effectively. This makes Rx, the AFS remote procedure call package, a critical link in the overall system performance chain. We report on progress in adapting Rx to networks characterized by low bandwidth, high delay, or variable round-trip time. When we started, the throughput delivered by Rx over dialup networks was approximately zero, due to fragmentation and congestion collapse. By making extensive modifications to Rx, focusing on congestion avoidance and control and header compression, we have accomplished our throughput objectives and made Rx a high-performing transport layer.<<ETX>>","PeriodicalId":174691,"journal":{"name":"Proceedings of IEEE Workshop on Services for Distributed and Networked Environments","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124189698","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-06-27DOI: 10.1109/SDNE.1994.337772
S. Chanson, G. Phillips
The paper investigates a mechanism that allows distributed programs to reduce their network usage by moving code segments between computers. The idea of moving code is developed into an abstract model of distributed computation called the Ship Model that has a basic entity called a ship. Ships contain code and data and are somewhat like objects that can migrate. The term 'ship' is used to emphasize its mobility. The Ship Model uses mobility both as a way of moving code and data between machines and as an inter-ship communication mechanism. A prototype implementation written in C and running under Unix is constructed with test machines connected either by a high speed Ethernet network or a slow speed dialup line. A few example applications are implemented and tested under the prototype. Various measurements show that the Ship Model can provide increased performance both in the high and lour speed settings. Various issues regarding the implementation of the Ship Model are also discussed.<>
{"title":"The Ship Model for communication and mobility in distributed systems","authors":"S. Chanson, G. Phillips","doi":"10.1109/SDNE.1994.337772","DOIUrl":"https://doi.org/10.1109/SDNE.1994.337772","url":null,"abstract":"The paper investigates a mechanism that allows distributed programs to reduce their network usage by moving code segments between computers. The idea of moving code is developed into an abstract model of distributed computation called the Ship Model that has a basic entity called a ship. Ships contain code and data and are somewhat like objects that can migrate. The term 'ship' is used to emphasize its mobility. The Ship Model uses mobility both as a way of moving code and data between machines and as an inter-ship communication mechanism. A prototype implementation written in C and running under Unix is constructed with test machines connected either by a high speed Ethernet network or a slow speed dialup line. A few example applications are implemented and tested under the prototype. Various measurements show that the Ship Model can provide increased performance both in the high and lour speed settings. Various issues regarding the implementation of the Ship Model are also discussed.<<ETX>>","PeriodicalId":174691,"journal":{"name":"Proceedings of IEEE Workshop on Services for Distributed and Networked Environments","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121640876","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-06-27DOI: 10.1109/SDNE.1994.337777
Danny Dolev, D. Malkhi, Y. Yarom
Local area networks use a broadcast media to transfer messages between hosts. This allows for network snooping by unlisted parties. This paper proposes a novel way for cheaply replicating services in a local area network via snooping. We present a tool for the warm backup of files that employs network snooping for data dissemination. The tool allows for a selective replication of files in the system. The use of snooping significantly reduces the overhead of file replication. Operations on non-replicated files suffer only a slight overhead.<>
{"title":"Warm backup using snooping","authors":"Danny Dolev, D. Malkhi, Y. Yarom","doi":"10.1109/SDNE.1994.337777","DOIUrl":"https://doi.org/10.1109/SDNE.1994.337777","url":null,"abstract":"Local area networks use a broadcast media to transfer messages between hosts. This allows for network snooping by unlisted parties. This paper proposes a novel way for cheaply replicating services in a local area network via snooping. We present a tool for the warm backup of files that employs network snooping for data dissemination. The tool allows for a selective replication of files in the system. The use of snooping significantly reduces the overhead of file replication. Operations on non-replicated files suffer only a slight overhead.<<ETX>>","PeriodicalId":174691,"journal":{"name":"Proceedings of IEEE Workshop on Services for Distributed and Networked Environments","volume":"14 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113932478","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-06-27DOI: 10.1109/SDNE.1994.337782
A. Bond, D. Arnold
Service interaction in open distributed processing (ODP) environments is difficult to visualize. Interaction often takes place asynchronously and new participants can join the system at any time. If errors are apparent in an interaction, debugging usually takes place through each service involved in the exchange. When peer-to-peer systems involve more than a couple of parties, this technique is often inadequate. This paper describes a tool for visualizing service interaction in a DCE/sup 1/ environment. We combine an event logging service (ELVIN) and an animation tool (WALTER) to provide an, insight into service interaction. Important events are logged by each participant and then animated through a graphical display. These tools have proven useful in both the management and debugging of complex ODP systems.<>
{"title":"Visualizing service interaction in an open distributed system","authors":"A. Bond, D. Arnold","doi":"10.1109/SDNE.1994.337782","DOIUrl":"https://doi.org/10.1109/SDNE.1994.337782","url":null,"abstract":"Service interaction in open distributed processing (ODP) environments is difficult to visualize. Interaction often takes place asynchronously and new participants can join the system at any time. If errors are apparent in an interaction, debugging usually takes place through each service involved in the exchange. When peer-to-peer systems involve more than a couple of parties, this technique is often inadequate. This paper describes a tool for visualizing service interaction in a DCE/sup 1/ environment. We combine an event logging service (ELVIN) and an animation tool (WALTER) to provide an, insight into service interaction. Important events are logged by each participant and then animated through a graphical display. These tools have proven useful in both the management and debugging of complex ODP systems.<<ETX>>","PeriodicalId":174691,"journal":{"name":"Proceedings of IEEE Workshop on Services for Distributed and Networked Environments","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124880174","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-06-27DOI: 10.1109/SDNE.1994.337784
J. Dobson
Any architecture and infrastructure will implicitly embody certain concepts of the system life-cycle, of integration and of management that will be reproduced in any service that is developed on, or uses, them. Furthermore, the implicit assumptions in the architecture and the infrastructure might conflict. This is an architectural issue that is now recognised in the distributed system community, and means that the path from architecture via infrastructure to the creation of new telecommunications services is not straightforward and free from problems. In this paper we reconnoitre this path and identify the main problems that might be encountered on it. There is useful experience to be gained from studying the relations between architecture, infrastructure and application life cycle that have been recognised in the software engineering and open distributed processing communities and applying the lessons to telecommunications architectures and infrastructures and the service creation applications built using them.<>
{"title":"Issues for service engineering","authors":"J. Dobson","doi":"10.1109/SDNE.1994.337784","DOIUrl":"https://doi.org/10.1109/SDNE.1994.337784","url":null,"abstract":"Any architecture and infrastructure will implicitly embody certain concepts of the system life-cycle, of integration and of management that will be reproduced in any service that is developed on, or uses, them. Furthermore, the implicit assumptions in the architecture and the infrastructure might conflict. This is an architectural issue that is now recognised in the distributed system community, and means that the path from architecture via infrastructure to the creation of new telecommunications services is not straightforward and free from problems. In this paper we reconnoitre this path and identify the main problems that might be encountered on it. There is useful experience to be gained from studying the relations between architecture, infrastructure and application life cycle that have been recognised in the software engineering and open distributed processing communities and applying the lessons to telecommunications architectures and infrastructures and the service creation applications built using them.<<ETX>>","PeriodicalId":174691,"journal":{"name":"Proceedings of IEEE Workshop on Services for Distributed and Networked Environments","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115316790","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-06-27DOI: 10.1109/SDNE.1994.337767
A. Nakamura, T. Tachikawa, M. Takizawa
In distributed systems, group communication among multiple entities is required in addition to the conventional one-to-one communication. Group communication protocols provide multiple entities with reliable data transmission service, i.e. messages are delivered to all the destination entities in the group. It is also important to guarantee that every application entity can receive messages in a well-defined order in the presence of multiple entities sending messages. The paper discusses logical properties of the group communication. It presents communication protocols to provide various kinds of group communication services and evaluate the protocols.<>
{"title":"Group communication protocols: properties and evaluation","authors":"A. Nakamura, T. Tachikawa, M. Takizawa","doi":"10.1109/SDNE.1994.337767","DOIUrl":"https://doi.org/10.1109/SDNE.1994.337767","url":null,"abstract":"In distributed systems, group communication among multiple entities is required in addition to the conventional one-to-one communication. Group communication protocols provide multiple entities with reliable data transmission service, i.e. messages are delivered to all the destination entities in the group. It is also important to guarantee that every application entity can receive messages in a well-defined order in the presence of multiple entities sending messages. The paper discusses logical properties of the group communication. It presents communication protocols to provide various kinds of group communication services and evaluate the protocols.<<ETX>>","PeriodicalId":174691,"journal":{"name":"Proceedings of IEEE Workshop on Services for Distributed and Networked Environments","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116443995","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
扫码关注我们
求助内容：
应助结果提醒方式：