J. Vass, Jia Yao, A. Joshi, K. Palaniappan, X. Zhuang
{"title":"Interactive image retrieval over the Internet","authors":"J. Vass, Jia Yao, A. Joshi, K. Palaniappan, X. Zhuang","doi":"10.1109/RELDIS.1998.740541","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740541","url":null,"abstract":"An efficient image database system is developed. The most important features of the proposed system include compressed domain indexing, searching by using scalable features, and progressive image transmission. User interaction is involved both at the search refinement stage and in the display of the query results. The most important query types include query by color layout and query by wavelet-coefficient clustering information. The indexing and searching algorithms are tightly coupled with the underlying image compression algorithm by which means the images are stored in the database, reducing both the complexity and the storage requirements of the database management system. In this research, we utilize our previously developed (B.-B. Chai et al., 1997, 1998) high-performance wavelet image coding algorithm, termed \"significance-linked connected component analysis\", which not only renders a very high compression performance when compared to other top-ranked wavelet image coding algorithms and the JPEG standard, but also inherently supports scalable features and progressive transmission. Computer experiments demonstrate the efficiency of the developed system.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114636322","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}
{"title":"Programming the grid: component systems for distributed applications","authors":"Dennis Gannon","doi":"10.1109/RELDIS.1998.740521","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740521","url":null,"abstract":"Summary form only given. The traditional model of software design for large scale scientific problem solving is outdated. The emphasis is now on large teams that must build simulation software that integrates physical systems from multiple scientific disciplines. In addition to the problem of multi-disciplinary physics, the computational environment is now a grid of distributed resources consisting of large supercomputers, databases and networked instruments connected by high speed networks. Consequently, a new model for programming these applications is required. What is emerging is a programming style where the individual components of a large simulation can be located on remote systems and the application is built by composing these elements together to form a single distributed system. Building applications from software components is not a new idea. It has a rich history in the visualization and object oriented software design communities. More recently, the desktop top software industry has embraced this concept with systems like Java Beans, ActiveX and CORBA-Enterprise Beans. The author examines a new project to design a component architecture for scientific programming. He examines some of the design trade-offs that make this problem different from the conventional CA environment.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116944093","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}
{"title":"View consistency for optimistic replication","authors":"Ashvin Goel, C. Pu, G. Popek","doi":"10.1109/RELDIS.1998.740472","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740472","url":null,"abstract":"Optimistically replicated systems provide highly available data even when communication between data replicas is unreliable or unavailable. The high availability comes at the cost of allowing inconsistent accesses, since users can read and write old copies of data. Session guarantees have been used to reduce such inconsistencies. They preserve most of the availability benefits of optimistic systems. We generalize session guarantees to apply to persistent as well as distributed entities. We implement these guarantees, called view consistency, on Ficus an optimistically replicated file system. Our implementation enforces consistency on a per-file basis and does not require changes to individual applications. View consistency is enforced by clients accessing the data and thus requires minimal changes to the replicated data servers. We show that view consistency allows access to available and high performing data replicas and can be implemented efficiently. Experimental results show that the consistency overhead for clients ranges from 1% to 8% of application runtime for the benchmarks studied in the prototype system. The benefits of the system are an improvement in access times due to better replica selection and improved consistency guarantees over a purely optimistic system.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115617579","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}
T. Apostolopoulos, V. C. Daskalou, S. Katsikas, K. Moulinos
{"title":"Enforcing security policies in large scale communication networks","authors":"T. Apostolopoulos, V. C. Daskalou, S. Katsikas, K. Moulinos","doi":"10.1109/RELDIS.1998.740529","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740529","url":null,"abstract":"Due to unexpected network interconnection growth, the security of technological and information infrastructures is becoming difficult to be managed and controlled. In addition, security is becoming more and more crucial for an organisation's information systems operation. The management of an organisation has to establish rules and regulations in order to face the threats that its information systems face. The network manager is obliged to enforce the regulations that senior management addresses. We propose a framework that a network manager could use in order to effectively enforce security policies. In addition, we present a scalable security management architecture suitable for TCP/IP networks. The communication of systems' logical components is based on the use of the SNMP protocol. Finally, the system includes facilities for collecting and efficiently storing raw and aggregate historical security management information in a temporal database for off-line analysis.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"11 23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123349153","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}
{"title":"Cyber-intrusion response","authors":"Richard Brackney","doi":"10.1109/RELDIS.1998.740533","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740533","url":null,"abstract":"Cyber response technologies are a relatively new area of research. This paper provides a high level description of the hard problems associated with responding to a cyber intrusion, identifies several questions that need to be addressed in order to solve these hard problems, provides a few examples of current response technologies, and describes an approach that can be taken to fill the gaps between the current response state of practice and the desired capabilities.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125681263","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}
{"title":"Requirements for a true enterprise-wide security infrastructure: the play's the thing","authors":"Doug Merrill, Alastair MacWillson, Gary Loveland","doi":"10.1109/RELDIS.1998.740531","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740531","url":null,"abstract":"Business has certain requirements that must be met if the enterprise is to thrive; some of these requirements are affected by security systems. The relationship of these requirements and supporting business has been well illustrated by the success of enterprise resource planning (ERP) systems and the initial failure and subsequent transformational impact of tools such as spreadsheets. If designed correctly, an enterprise-wide security infrastructure can, in fact, enable new business. However, the best security in the world will not be adequate if the business itself is not supported. This paper describes a set of minimum requirements that must be met if security systems are to meet their promise of enabling entirely new lines of business, and then describes an instantiation of these requirements in a currently available system.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127423405","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}
J. Ren, D. Bakken, T. Courtney, M. Cukier, D. Karr, P. Rubel, C. Sabnis, W. Sanders, R. Schantz, Mouna Seri
{"title":"AQuA: an adaptive architecture that provides dependable distributed objects","authors":"J. Ren, D. Bakken, T. Courtney, M. Cukier, D. Karr, P. Rubel, C. Sabnis, W. Sanders, R. Schantz, Mouna Seri","doi":"10.1109/RELDIS.1998.740506","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740506","url":null,"abstract":"Dependable distributed systems are difficult to build. This is particularly true if they have dependability requirements that change during the execution of an application, and are built with commercial off-the-shelf hardware. In that case, fault tolerance must be achieved using middleware software, and mechanisms must be provided to communicate the dependability requirements of a distributed application to the system and to adapt the system's configuration to try to achieve the desired dependability. The AQuA architecture allows distributed applications to request a desired level of availability using the Quality Objects (QuO) framework and includes a dependability manager that attempts to meet requested availability levels by configuring the system in response to outside requests and changes in system resources due to faults. The AQuA architecture uses the QuO runtime to process and invoke availability requests, the Proteus dependability manager to configure the system in response to faults and availability requests, and the Ensemble protocol stack to provide group communication services. Furthermore, a CORBA interface is provided to application objects using the AQuA gateway. The gateway provides a mechanism to translate between process-level communication, as supported by Ensemble, and IIOP messages, understood by Object Request Brokers. Both active and passive replication are supported, and the replication type to use is chosen based on the performance and dependability requirements of particular distributed applications.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130896575","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}
{"title":"Distributed center location algorithm for fault-tolerant multicast in wide-area networks","authors":"Shahzad Ali, A. Khokhar","doi":"10.1109/RELDIS.1998.740517","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740517","url":null,"abstract":"Group shared trees form a major component of most multicast routing protocols (e.g. PIM-SMv2, CBTv3). The shared trees are built by choosing one node as the center of the tree. The optimal location of a center under the constraints of minimal tree cost and delay for a particular group is an NP-complete problem. Current implementations of protocols decide on the location of these centers administratively, an attractive choice given that the solution is obviously sub-optimal and does not lend itself to dynamic reconfiguration of centers. We present a scalable heuristic to find a near-optimal solution to the center location problem. Our solution is easily amenable to distributed implementation and provides the protocol with a list of possible centers ranked in the order of their optimality, therefore providing fault tolerance and reducing the chances of a single point of failure at the center.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130457880","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}
{"title":"Legal reliability in large-scale distributed systems","authors":"P. Sommer","doi":"10.1109/RELDIS.1998.740534","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740534","url":null,"abstract":"The \"legal reliability\" of an information system is the extent to which it is able to produce robust evidence upon which legal proceedings can be based. As such it is an essential feature of all information systems operating in the commercial and social domain. The legal test of reliability is not scientific proof or extent of assessment of quality of engineering but compliance with admissibility rules and demonstration of weight of evidence before a court. The gap between regular computer industry methods of achieving reliability and the approaches of the courts is explained. Adjustment in system development methodologies to encompass \"legal reliability\" are discussed. Finally it is suggested that \"legal reliability\" provides a new and useful determinant in the information security agenda.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132082104","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}
{"title":"On patterns for practical fault tolerant software in Java","authors":"G. Richard, S. Tu","doi":"10.1109/RELDIS.1998.740485","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740485","url":null,"abstract":"Fault tolerance is important for both sequential and distributed software, and particularly so for long-running applications. The ability to stop an application and restart it, with minimal lost work, is especially useful. If components of the application can be restarted on arbitrary hosts, so much the better. In this paper, we explore Java's potential to support fault tolerant software design. We note that while there are \"deficiencies\" in these facilities, a little creativity can still yield solutions that would be quite difficult in other programming environments. The main contributions of the paper are several preliminary fault tolerant programming design patterns, aimed at easing the burden of application programmers who must write completely portable fault tolerant applications. This class of applications is growing, as Internet-domain software becomes increasingly prevalent. We expect that with further development the proposed patterns will be applicable to a wide range of sequential and parallel applications.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116566386","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}