Showing papers on "Shared resource published in 2003"

KARMA : A Secure Economic Framework for Peer-to-Peer Resource Sharing

Abstract: Peer-to-peer systems are typically designed around the assumption that all peers will willingly contribute resources to a global pool. They thus suffer from freeloaders, that is, participants who consume many more resources than they contribute. In this paper, we propose a general economic framework for avoiding freeloaders in peer-to-peer systems. Our system works by keeping track of the resource consumption and resource contribution of each participant. The overall standing of each participant in the system is represented by a single scalar value, called their karma. A set of nodes, called a bankset, keeps track of each node’s karma, increasing it as resources are contributed, and decreasing it as they are consumed. Our framework is resistant to malicious attempts by the resource provider, consumer, and a fraction of the members of the bank set. We illustrate the application of this framework to a peer-to-peer filesharing

Dynamic resource allocation for shared data centers using online measurements

Abstract: Since web workloads are known to vary dynamically with time, in this paper, we argue that dynamic resource allocation techniques are necessary to provide guarantees to web applications running on shared data centers. To address this issue, we use a system architecture that combines online measurements with prediction and resource allocation techniques. To capture the transient behavior of the application workloads, we model a server resource using a time-domain description of a generalized processor sharing (GPS) server. This model relates application resource requirements to their dynamically changing workload characteristics. The parameters of this model are continuously updated using an online monitoring and prediction framework. This framework uses time series analysis techniques to predict expected workload parameters from measured system metrics. We then employ a constrained non-linear optimization technique to dynamically allocate the server resources based on the estimated application requirements. The main advantage of our techniques is that they capture the transient behavior of applications while incorporating nonlinearity in the system model. We evaluate our techniques using simulations with synthetic as well as real-world web workloads. Our results show that these techniques can judiciously allocate system resources, especially under transient overload conditions.

OurGrid: An Approach to Easily Assemble Grids with Equitable Resource Sharing

Abstract: Available grid technologies like the Globus Toolkit make possible for one to run a parallel application on resources distributed across several administrative domains. Most grid computing users, however, don’t have access to more than a handful of resources onto which they can use this technologies. This happens mainly because gaining access to resources still depends on personal negotiations between the user and each resource owner of resources. To address this problem, we are developing the OurGrid resources sharing system, a peer-to-peer network of sites that share resources equitably in order to form a grid to which they all have access. The resources are shared accordingly to a network of favors model, in which each peer prioritizes those who have credit in their past history of bilateral interactions. The emergent behavior in the system is that peers that contribute more to the community are prioritized when they request resources. We expect, with OurGrid, to solve the access gaining problem for users of bag-of-tasks applications (those parallel applications whose tasks are independent).

Ontology-based resource matching in the grid: the grid meets the semantic web

Abstract: The Grid is an emerging technology for enabling resource sharing and coordinated problem solving in dynamic multi-institutional virtual organizations. In the Grid environment, shared resources and users typically span different organizations. The resource matching problem in the Grid involves assigning resources to tasks in order to satisfy task requirements and resource policies. These requirements and policies are often expressed in disjoint application and resource models, forcing a resource selector to perform semantic matching between the two. In this paper, we propose a flexible and extensible approach for solving resource matching in the Grid using semantic web technologies. We have designed and prototyped an ontology-based resource selector that exploits ontologies, background knowledge, and rules for solving resource matching in the Grid.

Flexible information discovery in decentralized distributed systems

Abstract: The ability to efficiently discover information using partial knowledge (for example keywords, attributes or ranges) is important in large, decentralized, resource sharing distributed environments such as computational grids and peer-to-peer (P2P) storage and retrieval systems. This paper presents a P2P information discovery system that supports flexible queries using partial keywords and wildcards, and range queries. It guarantees that all existing data elements that match a query are found with bounded costs in terms of number of messages and number of peers involved. The key innovation is a dimension reducing indexing scheme that effectively maps the multidimensional information space to physical peers. The design, implementation and experimental evaluation of the system are presented.

Enforcing Fair Sharing of Peer-to-Peer Resources

Abstract: Cooperative peer-to-peer applications are designed to share the resources of each computer in an overlay network for the common good of everyone. However, users do not necessarily have an incentive to donate resources to the system if they can get the system’s resources for free. This paper presents architectures for fair sharing of storage resources that are robust against collusions among nodes. We show how requiring nodes to publish auditable records of their usage can give nodes economic incentives to report their usage truthfully, and we present simulation results that show the communication overhead of auditing is small and scales well to large networks.

An end-user perspective on file-sharing systems

Abstract: P2P file-sharing systems enable their users to share files directly among themselves without the need for a central file server. They form one of the most well-known categories of P2P systems, thanks largely to the Napster controversy and its appeal to the large potential user base. At its peak, Napster boasted a registered user base of 70 million [9] and 1.57 million simultaneous users. Now, after Napster's downfall, over 50 systems have taken its place. The files shared through these systems include not only music files but also videos, audio books, and pictures. P2P file-sharing applications account for five of the top 10 downloads from the download.com Web site, together representing over 4.5 million downloads in the last week of June 2002 alone. Also, as of June 2002, 19% of Americans over age 12 (about 40 million users) have downloaded music files from these systems, according to cyberatlas.internet.com. These systems are interesting in many ways. They blur the distinction between server, client, and router because individual computers fill these roles, communicating and sharing resources without dedicated servers [6]. They challenge the ability to enforce copyright. They form a backbone for other types of P2P applications, such as groupware and content distribution.

System and method for community centric resource sharing based on a publishing subscription model

Abstract: The invention provides a Web service which enables a publisher to share his digital resources such as an address card or a calendar with a number of subscribers based on different sharing relationships. The Web service includes a host-based interface called “My Community”, for example, with which the publisher manages the share-relationships with his community members. The community members are organized into different groups. Each group includes a number of community members who have a common sharing relationship with the publisher with respect to one or more views of the shared resources. A resource may have multiple views. Each of the views has Metadata describing sharing-styles, as well as version, creation date, size, and the like. Each sharing style corresponds to a specific sharing relationship between a community member and the publisher.

Towards High Performance Peer-to-Peer Content and Resource Sharing Systems

Abstract: Peer-to-peer sharing systems are becoming increasingly popular and an exciting new class of innovative, internet-based data management systems. In these systems, users contribute their own resources (processing units and storage devices) and content (i.e., documents) to the P2P community. We focus on the management of content and resources in such systems. Our goal is to harness all available resources in the P2P network so that the users can access all available content efficiently. Efficiency is taken both from (i) the point of view of the system, in that we strive to ensure fair load distribution among all peer nodes, and (ii) from the point of view of the users, in that we strive to ensure low user-request response times. We propose a novel architecture for this new class of applications, which differs drastically from what is either found currently in existing products or proposed in academia. We contribute and study novel solutions that achieve our goals, while at the same time addressing the formidable challenges due to the autonomy of peers, their heterogeneous processing and storage capacities, their different content contributions, the huge system scale, and the highly dynamic system environment.

Method, system, and program for diagnosing a computer in a network system

Abstract: Disclosed is a method, system, and program for diagnosing a computer over a network, such as the Internet. A program, such as an applet, is provided that executes on the computer. The program causes the computer to download at least one object from a server over the network. Performance data is determined with respect to downloading the object from the server to the computer over the network in order to diagnose performance problems with the computer. The determined performance data is then transmitted to a diagnostic system over the network.

System management infrastructure for corrective actions to servers with shared resources

Abstract: A corrective action method or subsystem for providing corrective actions in a for a computing domain shared among multiple customers wherein different domain resources are shared by different customers, and each customer's corrective action preferences are accommodated differently according a repository of customer preferences. A database may be queried when a fault event or out-of-limits condition is detected for a given shared resource to determine which customers share the resource, determine each affected customer's response preferences, and to perform corrective actions according to those response preferences. For example, three customers may share a particular hard drive in a shared computing system. One customer may prefer to receive an email notice when the drive is nearly full, another may prefer to receive additional allocation of disk space elsewhere, and the third may prefer to receive a written report of space utilization.

Method and system of using shared file for data collaboration

Abstract: A method of using at least one shared data file for data collaboration for a plurality attendees in a meeting. The method includes first determining a web server for the meeting. Local files are opened by attendees, respectively. A computer program is invoked by the attendees to send a shared file of the local files to the web server through a network with a security level. Wherein, the web server puts the shared file at a specific directory, responds an URL path, and displays the shared file to the attendees. A command is sent to the web server to handle or modify the shared file. Attendee's browser or custom program can update and display shared file in real-time.

Energy Aware Grid: Global Workload Placement Based on Energy Efficiency

Abstract: Computing will be pervasive, and enablers of pervasive computing will be data centers housing computing, networking and storage hardware. The data center of tomorrow is envisaged as one containing thousands of single board computing systems deployed in racks. A data center, with 1000 racks, over 30,000 square feet, would require 10 MW of power to power the computing infrastructure. At this power dissipation, an additional 5 MW would be needed by the cooling resources to remove the dissipated heat. At $100/MWh, the cooling alone would cost $4 million per annum for such a data center. The concept of Computing Grid, based on coordinated resource sharing and problem solving in dynamic, multi-institutional virtual organizations, is emerging as the new paradigm in distributed and pervasive computing for scientific as well as commercial applications. We envision a global network of data centers housing an aggregation of computing, networking and storage hardware. The increased compaction of such devices in data centers has created thermal and energy management issues that inhibit sustainability of such a global infrastructure. In this paper, we propose the framework of Energy Aware Grid that will provide a global utility infrastructure explicitly incorporating energy efficiency and thermal management among data centers. Designed around an energy-aware co-allocator, workload placement decisions will be made across the Grid, based on data center energy efficiency coefficients. The coefficient, evaluated by the data center’s resource allocation manager, is a complex function of the data center thermal management infrastructure and the seasonal and diurnal variations. A detailed procedure for implementation of a test case is provided with an estimate of energy savings to justify the economics. An example workload deployment shown in the paper aspires to seek the most energy efficient data center in the global network of data centers. The locality based energy efficiency in a data center is shown to arise from use of ground coupled loops in cold climates to lower ambient temperature for heat rejection e.g. computing and rejecting heat from a data center at nighttime ambient of 20°C. in New Delhi, India while Phoenix, USA is at 45°C. The efficiency in the cooling system in the data center in New Delhi is derived based on lower lift from evaporator to condenser. Besides the obvious advantage due to external ambient, the paper also incorporates techniques that rate the efficiency arising from internal thermo-fluids behavior of a data center in workload placement decision.Copyright © 2003 by ASME

Achieving fast and bandwidth-efficient shared-path protection

Abstract: Dynamic provisioning of restorable bandwidth guaranteed paths is a challenge in the design of broad-band transport networks, especially next-generation optical networks. A common approach is called (failure-independent) path protection, whereby for every mission-critical active path to be established, a link (or node) disjoint backup path (BP) is also established. To optimize network resource utilization, shared path protection should be adopted, which often allows a new BP to share the bandwidth allocated to some existing BPs. However, it usually leads the backup paths to use too many links, with zero cost in term of additional backup bandwidth, along its route. It will violate the restoration time guarantee. In this paper, we propose novel integer linear programming (ILP) formulations by introducing two parameters (/spl epsi/ and /spl mu/) in both the sharing with complete information (SCI) scheme and the distributed partial information management (DPIM) scheme. Our results show that the proposed ILP formulations can not only improve the network resource utilization effectively, but also keep the BPs as short as possible.

Techniques for limiting network access

Abstract: A network architecture in a Universal Plug and Play (UPnP) network includes a resource sharing service to govern the distribution of resource information from a server to a recipient entity (such as rendering device or a control point). The network architecture includes one or more of the following provisions: (a) setting the server to operate in a predetermined private address range or an Auto IP range; (b) operating one or more parts of the network architecture on the same subnet; (c) setting a time to live (TTL) parameter associated with messages transmitted by the server to a predetermined number; (d) setting a number of permitted recipient entities to a predetermined number; (e) setting a number of permitted concurrent content distribution sessions to a predetermined session number; (f) granting access to a recipient entity on condition that the recipient entity has generated a message that conforms to the UPnP protocol; and (g) retiring a URL used to identify a location of a resource provided by the server after a predetermined amount of time.

MAC for ad-hoc inter-vehicle network: services and performance

Abstract: In this paper we analyze the performance of ADHOC MAC, a new MAC protocol proposed within CarTALK200, a European research project with the purpose to design novel solutions for inter-vehicle communications. ADHOC MAC has been devised to provide a reliable single hop broadcast channel overcoming the hidden terminal problem, and an effective multi hop broadcast service by exploiting the connectivity information provided by the protocol. The simulation results presented in the paper prove the effectiveness of ADHOC MAC in terms of access delay to the shared resource and resource reuse when considering a single hop broadcast service. The efficiency of the multi-hop broadcast service is compared through simulation with flooding and with a centralized greedy heuristics that gives an upper bound to the performance. Results show that the distributed ADHOC-MAC multi-hop broadcast mechanism performs closely to the centralized greedy heuristics.

Towards self-organizing distributed computing frameworks: the h2o approach

Abstract: A novel component-based, service-oriented framework for distributed metacomputing is described. Adopting a provider-centric view of resource sharing, this framework emphasizes lightweight software infrastructures that maintain minimal state, and interface to current and emerging distributed computing standards. In this model, resource owners host a software backplane onto which owners, clients, or third-party resellers may load components or component-suites that deliver value added services without compromising owner security or control. Standards-based descriptions of services facilitate publication and discovery via established schemes. The architecture of the container framework, design of components, security and access control schemes, and preliminary experiences are described in this paper.

Concurrent access of shared resources utilizing tracking of request reception and completion order

Abstract: An apparatus, program product and method to manage access to a shared resource by a plurality of processes in a multithreaded computer via a collection of atomic operations that track both the order in which requests that use a shared resource are received, and the order in which processing of such requests are completed after they are received. Dispatching of requests is effectively deferred until processing of all non-dispatched requests that were received earlier than a most recently completed request has been completed. In many instances, completion of processing of requests can be performed non-atomically, thus reducing contention issues with respect to the shared resource. Furthermore, dispatching of requests may be batched to reduce the overhead associated with individual dispatch operations.

A method to realize dynamic networking and resource sharing among equipments

Abstract: The invention relates to a method allowing dynamically networking among a plurality of devices to share resource. It includes: installing a software of dynamic networking and resource sharing on each of devices to realize dynamic networking and resource sharing. These devices periodically announce information with multicasting. A device serves as node control device, and announces the message of the existence of the device through multicasting, creates a node. A device can find the node by monitoring announcement message from the node. The device which requests to join into the node device registers its service information that can be provided by the device to the node control device. The device which has joined into the node finds the device providing service by indexing the nodal control device, and obtains desired service from the device by sending a service calling information. The method is applied to home backbone network for performing networking in home network. Then a topology connection structure with master/slave and peer-to-peer modes can be realized. The dynamic networking and resource sharing between the service providing device and the service utilizing device in the home backbone network can be realized.

SAN/NAS integrated storage system

Abstract: In a storage system directly connected to a network, if conventional interfaces and protocols are used when an I/O command issued from a file server is transmitted to the storage system, the command/data is serially transferred via a single transfer path so that the performance is lowered. Conventional interfaces do not provide the means to notify the storage system of the failure at the file server. The file server and a channel adapter of the storage system are mounted on the same board and connection paths therebetween are controlled so that a plurality of protocols can be operated independently. A path independent from a command/data path is provided between the file server and channel adapter, and the received failure information is stored in a shared memory of the storage system and used for the fail-over.

Small-scale secured computer network group without centralized management

Abstract: Computers on a local computer network, such as a home network or a small business network, are formed into a secured network group that provides common user access control and enables resource sharing among the computers in the group. A computer on the local network discovers whether there are secured network groups existing on the local network. If one secured network group is found, the computer indicates to a second computer in the group its desire to join the group, and establishes trust with that computer, such as by entering a proper user name and password, or a secret identification number. Once the trust is established, the first computer joins the group. Within the secured network group, user accounts and user profiles are replicated to each of the computers in the group. The establishment of trust and the replication of user accounts and profiles among the computers in the group enable the implementation of security policies and user access control in a group-wide manner.

Parallel multi-threaded processing

Abstract: A parallel, multi-threaded processor system and technique for arbitrating command requests is described. The system includes a plurality of microengines, a plurality of shared system resources and a global command arbiter. The global command arbiter uses a command request protocol that is based on the shared system resources and command type to grant or deny a microengine command request for a shared resource.

Creating records of patients using a browser based hand-held assistant

Abstract: A method, computer program product and system for creating records using a hand-held device capable of recording a voice file. A server may receive a request to select an encounter template, e.g., knee template, from the user of a hand-held computer. The server may transmit one or more screens of the selected encounter template to the hand-held computer. The server may receive a request to generate a voice file from the hand-held computer. A tag file may be generated in response to the request to generate a voice file where the tag file associates the voice file to be generated with the appropriate field the transcription of the voice file is to be inserted in the selected encounter template. Upon transcription of the voice file, the server may insert the transcription in the appropriate field in the template created by the user using the tag file.

Version control of metadata

Abstract: A method and system for efficiently determining compatibility between a server node and a shared resource. The system includes a version control record that organizes metadata relating to the cluster and to data within the shared resource into a searchable format. A server node joining the cluster accesses the version control record at a known location ( 102 ). Prior to joining the cluster, the server node will use the version control record to determine compatibility with the disk header version ( 104 ), compatibility with the control record version ( 110 ), and compatibility with each data item in the version control record ( 112 ). In addition, the system may be used as a control mechanism for upgrades to system resources for existing cluster members.

AdHocFS: sharing files in WLANs

Abstract: This paper presents the ADHOCFS file system for mobile users, which realizes transparent, adaptive file access according to the users' specific situations (e.g., device in use, network connectivity, etc). The paper concentrates more specifically on the support of ADHOCFS for collaborative file sharing within ad hoc groups of trusted nodes that are in the local communication of each other using the underlying ad hoc network, which has not been addressed in the past.

An Analysis of GNUnet and the Implications for Anonymous, Censorship-Resistant Networks

Abstract: Peer-to-peer networks are a popular platform for file sharing, but only few of them offer strong anonymity to their users. GNUnet is a new peer-to-peer network that claims to provide practical anonymous and censorship-resistant file sharing. In this paper we show that GNUnet’s performance-enhancing features can be exploited to determine the initiator of a download. We also present an efficient filter mechanism for GNUnet. Assuming that content filtering is legally enforced, GNUnet can be censored at a large scale.