Shared resource

About: Shared resource is a research topic. Over the lifetime, 7536 publications have been published within this topic receiving 123491 citations. The topic is also known as: network share.

Shared resource arbitration

Abstract: Masters request access to a shared resource, such as a shared bus. Usage of the shared bus by each of the masters is monitored, a request to use the shared bus by one of the masters is received, and usage of the shared bus by the master is compared with a corresponding bandwidth threshold. The request is arbitrated if the usage of the shared bus by the master is below the bandwidth threshold, and the request to use the shared bus is granted to the master based on the arbitration.

Resource sharing for multi-party real-time communication

Abstract: Approaches to supporting real-time communication allocate network resources either to individual connections, or to aggregates of connections. Resource sharing is a new approach that exploits known relationships between related connections to allow network resources to be shared between them without sacrificing well-defined guarantees. The authors present a fully distributed technique for using resource sharing to provide guaranteed performance communication in a heterogeneous internetwork. Results show that resource sharing leads to a large gain in the connection acceptance rate, and a significant reduction in the computational overhead associated with admission control. Thus, resource sharing is an important tool for providing real-time performance guarantees for large conferences.

Communication network having packetized security codes and a system for detecting security breach locations within the network

Abstract: Architectures, systems, and methods are provided for securing and prioritizing packets of data sent through a communication network. Each packet is assigned a security code and priority code as it enters the network. The security code or priority code may remain the same or change as it travels from node-to-node across the network. By assigning security and priority codes to each packet, maximum bandwidth allocation can be achieved among the nodes in a packet-switched environment. The assigned security and priority codes enter and travel through the network according to modules which have a hierarchical class or grouping. Thus, the security and priority information may be sent solely within one class or among classes depending on where, within the classes the data path exists. In this manner, a specified quality of service can be achieved to ensure the data path is secured dynamically as it travels from node to node, and also to determine which packet among several is to be forwarded across a shared resource of that network.

Data Encryption and Decryption Using RSA Algorithm in a Network Environment

Abstract: One of the principal challenges of resource sharing on data communication network is its security. This is premised on the fact that once there is connectivity between computers sharing some resources, the issue of data security becomes critical. This paper presents a design of data encryption and decryption in a network environment using RSA algorithm with a specific message block size. The algorithm allows a message sender to generate a public keys to encrypt the message and the receiver is sent a generated private key using a secured database. An incorrect private key will still decrypt the encrypted message but to a form different from the original message.