{"title":"Censorship resistant publishing through document entanglements","authors":"Marc Waldman, David Mazières","doi":"10.1109/HOTOS.2001.990101","DOIUrl":"https://doi.org/10.1109/HOTOS.2001.990101","url":null,"abstract":"Summary form only given. Today, most documents available over the the Internet are easy to censor. Each document can usually be traced back to a specific host or even the individual responsible for publishing the document. Someone wishing to censor a document can use the courts, threats, or some other means to force the host administrator or author to delete a particular file. Clearly, a censorship resistant system must replicate a published document across many hosts. We propose a system, named Tangler, that we believe provides some incentive to retain such documents and solves the document naming problem. Tangler is a censorship resistant distributed file system that employs a unique document storage mechanism.","PeriodicalId":444804,"journal":{"name":"Proceedings Eighth Workshop on Hot Topics in Operating Systems","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116620615","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":"Beyond address spaces-flexibility, performance, protection, and resource management in the type-safe JX operating system","authors":"M. Golm, J. Kleinöder, Frank Bellosa","doi":"10.1109/HOTOS.2001.990053","DOIUrl":"https://doi.org/10.1109/HOTOS.2001.990053","url":null,"abstract":"Early type-safe operating systems were hampered by poor performance. Contrary to these experiences we show that an operating system that is founded on an object-oriented, type-safe intermediate code can compete with MMU-based microkernels concerning performance while widening the realm of possibilities. Moving from hardware-based protection to software-based protection offers new options for operating system quality, flexibility, and versatility that are superior to traditional process models based on MMU protection. However, using a type-safe language-such as Java-alone, is not sufficient to achieve an improvement. While other Java operating systems adopted a traditional process concept, JX implements fine-grained protection boundaries. The JX System architecture consists of a set of Java components executing on the JX core that is responsible for system initialization, CPU context switching and low-level domain management. The Java code is organized in components which are loaded into domains, verified, and translated to native code. JX runs on commodity PC hardware, supports network communication, a frame grabber device, and contains an Ext2-compatible file system. Without extensive optimization this file system already reaches a throughput of 50% of Linux.","PeriodicalId":444804,"journal":{"name":"Proceedings Eighth Workshop on Hot Topics in Operating Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114957965","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":"Design issues in system support for programmable routers","authors":"P. Pradhan, Kartik Gopalan, T. Chiueh","doi":"10.1109/HOTOS.2001.990054","DOIUrl":"https://doi.org/10.1109/HOTOS.2001.990054","url":null,"abstract":"Placement of computation inside the network is a powerful computation model that can improve the overall performance of network applications. The authors address the problem of providing sound and efficient system support for placing computation in a network router We identify a set of requirements, related to protection, resource control, scheduling and efficiency, that are relevant to the design of this system support. We have developed a system that attempts to meet these requirements, and have used it to write a router application that performs aggregated congestion control.","PeriodicalId":444804,"journal":{"name":"Proceedings Eighth Workshop on Hot Topics in Operating Systems","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114506478","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}
F. Dabek, E. Brunskill, M. Kaashoek, David R Karger, R. Morris, I. Stoica, H. Balakrishnan
{"title":"Building peer-to-peer systems with chord, a distributed lookup service","authors":"F. Dabek, E. Brunskill, M. Kaashoek, David R Karger, R. Morris, I. Stoica, H. Balakrishnan","doi":"10.1109/HOTOS.2001.990065","DOIUrl":"https://doi.org/10.1109/HOTOS.2001.990065","url":null,"abstract":"We argue that the core problem facing peer-to-peer Systems is locating documents in a decentralized network and propose Chord, a distributed lookup primitive. Chord provides an efficient method of locating documents while placing few constraints on the applications that use it. As proof that Chord's functionality is useful in the development of peer-to-peer applications, we outline the implementation of a peer-to-peer file sharing system based on Chord.","PeriodicalId":444804,"journal":{"name":"Proceedings Eighth Workshop on Hot Topics in Operating Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130293443","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}
Kevin Hui, J. Appavoo, R. Wisniewski, M. Auslander, D. Edelsohn, Benjamin Gamsa, O. Krieger, Bryan S. Rosenburg, M. Stumm
{"title":"Supporting hot-swappable components for system software","authors":"Kevin Hui, J. Appavoo, R. Wisniewski, M. Auslander, D. Edelsohn, Benjamin Gamsa, O. Krieger, Bryan S. Rosenburg, M. Stumm","doi":"10.1109/HOTOS.2001.990086","DOIUrl":"https://doi.org/10.1109/HOTOS.2001.990086","url":null,"abstract":"Summary form only given. A hot-swappable component is one that can be replaced with a new or different implementation while the system is running and actively using the component. For example, a component of a TCP/IP protocol stack, when hot-swappable, can be replaced (perhaps to handle new denial-of-service attacks or improve performance), without disturbing existing network connections. The capability to swap components offers a number of potential advantages such as: online upgrades for high availability systems, improved performance due to dynamic adaptability and simplified software structures by allowing distinct policy and implementation options to be implemented in separate components (rather than as a single monolithic component) and dynamically swapped as needed. In order to hot-swap a component, it is necessary to (i) instantiate a replacement component; (ii) establish a quiescent state in which the component is temporarily idle; (iii) transfer state from the old component to the new component; (iv) swap the new component for the old; and (v) deallocate the old component.","PeriodicalId":444804,"journal":{"name":"Proceedings Eighth Workshop on Hot Topics in Operating Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131871580","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":"Position summary: the Lana approach to wireless computing","authors":"Chrislain Razafimahefa, C. Bryce, Michel Pawlak","doi":"10.1109/HOTOS.2001.990096","DOIUrl":"https://doi.org/10.1109/HOTOS.2001.990096","url":null,"abstract":"The goal of the Lana project is to develop system support for short-distance wireless applications. We chose a language-based approach: mechanisms like scoping and typing are used to enforce system properties. The Lana language is strongly influenced by Java-it contains interfaces, packages, single inheritance etc.-though is designed with support for disconnected operation, coordination and security. Lana supports concurrent programs. The language semantics states that all memory locations transitively reachable from a program object must be moved along with the program. Further, the set of programs is organized into a hierarchy. When a program moves between nodes then all of its sibling programs are moved along with it. This feature is used by applications to specify hoarding policies: all related programs and objects are grouped under a common umbrella program which is moved. Method calls between programs are asynchronous; thus, a caller is never blocked awaiting a reply that might never come. Each method call generates a unique key object that is used by a program to locate the reply message or exception if ever the program momentarily leaves the network. Return messages-or security or mobility exceptions provoked by the call-have this key value bound to them. Any program that is delegated the key by the caller may therefore service the reply message. Thus a node may leave a network yet safely delegate its pending jobs to other nodes.","PeriodicalId":444804,"journal":{"name":"Proceedings Eighth Workshop on Hot Topics in Operating Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129857123","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}
Nuno M. Preguiça, José Legatheaux Martins, S. Duarte, H. Domingos
{"title":"Position summary: supporting disconnected operation in DOORS","authors":"Nuno M. Preguiça, José Legatheaux Martins, S. Duarte, H. Domingos","doi":"10.1109/HOTOS.2001.990095","DOIUrl":"https://doi.org/10.1109/HOTOS.2001.990095","url":null,"abstract":"The increasing popularity of portable computers opens the possibility of collaboration among multiple distributed and disconnected users. In such environments, collaboration is often achieved through the concurrent modification of shared data. DOORS is a distributed object store to support asynchronous collaboration in distributed systems that may contain disconnected computers. In this summary we focus on the mechanisms to support disconnected operation. The DOORS architecture is composed by servers that replicate objects using an epidemic propagation model. Clients cache key objects to support disconnected operation. Users run applications to read and modify the shared data (independently from other users)-a read any/write any model of data access is used. Modifications are propagated from clients to servers and among servers as sequences of operations-the system is log-based. Objects are structured according to an object framework that decomposes object operation in several components. Each component manages a different aspect of object execution. Each object represents a data type (e.g. a structured document) and it is composed by a set of sub-objects. Each sub-object represents a subpart of the data type (e.g. sections). A new object is created composing the set of subobjects that store the type-specific data with the adequate implementations of the other components. The following main characteristics are the base to support disconnected operation in DOORS.","PeriodicalId":444804,"journal":{"name":"Proceedings Eighth Workshop on Hot Topics in Operating Systems","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121202462","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":"Transport layer support for highly-available network services","authors":"F. Sultan, Kiran Srinivasan, L. Iftode","doi":"10.1109/HOTOS.2001.990098","DOIUrl":"https://doi.org/10.1109/HOTOS.2001.990098","url":null,"abstract":"We advocate a transport layer protocol for highly available network services by means of transparent migration of the server endpoint of a live connection between cooperating servers that provide the same service. We propose a transport protocol that: (i) offers a better alternative than the simple retransmission to the same server, which may be suffering from overload or a DoS attack, may be down, or may not be easily reachable due to congestion; and (ii) decouples a given service from the unique/fixed identity of its provider. Our protocol can be viewed as an extension to the existing TCP, and compatible with it.","PeriodicalId":444804,"journal":{"name":"Proceedings Eighth Workshop on Hot Topics in Operating Systems","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134246447","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":"Reconsidering Internet mobility","authors":"A. Snoeren, H. Balakrishnan, M. Kaashoek","doi":"10.1109/HOTOS.2001.990059","DOIUrl":"https://doi.org/10.1109/HOTOS.2001.990059","url":null,"abstract":"Despite the popularity of mobile computing platforms, appropriate system support for mobile operation is lacking in the Internet. The paper argues that this is not for lack of deployment incentives, but because a comprehensive system architecture that efficiently addresses the needs of mobile applications does not exist. We identify five fundamental issues raised by mobility: location, preservation of communication, disconnection handling, hibernation, and reconnection, and suggest design guidelines for a system that attempts to support Internet mobility. In particular, we argue that a good system architecture should: (i) eliminate the dependence of higher protocol layers upon lower-layer identifiers; (ii) work with any application-selected naming scheme; (iii) handle (unexpected) network disconnections in a graceful way, exposing its occurrence to applications; and (iv) provide mobility services at the mobile nodes themselves, rather than via proxies. Motivated by these principles, we propose a session-oriented, end-to-end architecture called Migrate, and briefly examine the set of services it should provide.","PeriodicalId":444804,"journal":{"name":"Proceedings Eighth Workshop on Hot Topics in Operating Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134561199","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":"Anypoint Communication Protocol","authors":"K. Yocum, Jeffrey S. Chase, Amin Vahdat","doi":"10.1109/HOTOS.2001.990105","DOIUrl":"https://doi.org/10.1109/HOTOS.2001.990105","url":null,"abstract":"Summary form only given. We are developing the Anypoint Communication Protocol (ACP). ACP clients establish connections to abstract services, represented at the network edge by Anypoint intermediaries. The intermediary is an intelligent network switch that acts as an extension of the service; it encapsulates a service-specific policy for distributing requests among servers in the active set for each service. The switch routes incoming requests on each ACP connection to any active server at the discretion of the service routing policy, hence the name \"Anypoint\". The Anypoint abstraction and ACP protocol enable virtualization using intermediaries for a general class of wide-area network services based on request/response communication over persistent transport connections. Potential applications include scalable IP-based network storage protocols and next-generation Web services.","PeriodicalId":444804,"journal":{"name":"Proceedings Eighth Workshop on Hot Topics in Operating Systems","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131895666","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}