Cold data contributes a large portion of the big data today and is usually stored in secondary storage. Various sketch data structures are implemented to represent the stored elements and provide constant-time members...
详细信息
Data distribution management (DDM) is one of the services defined by the DoD High Level Architecture. DDM is necessary to provide efficient, scalable mechanisms for distributing state updates and interaction informati...
详细信息
Data distribution management (DDM) is one of the services defined by the DoD High Level Architecture. DDM is necessary to provide efficient, scalable mechanisms for distributing state updates and interaction information in large scale distributed simulations. We describe data distribution management mechanisms (also known as filtering) used for real time training simulations. We propose a new DDM approach to multicast group allocation, which we refer to as a dynamic grid-based allocation. Our scheme is based on a combination of a fixed grid-based method, known for its low overhead and ease of implementation, and a sender-based strategy, which uses fewer multicast groups than the fixed grid-based method. We describe our DDM algorithm, its implementation, and report on the performance results that we have obtained using the RTI-Kit framework. These results include the outcome of experiments comparing our approach to the fixed grid-based method, and they show that our scheme is scalable and significantly reduces the message overhead of previous grid-based allocation schemes.
In order to generate local addresses for an array section A(l:h:s) with block-cyclic distribution, an efficient compiling method is required. In this paper, two local address generation methods for the block-cyclic di...
详细信息
This paper proposes a novel real-time adaptive admission control (AAC) scheme with a desired quality of service (QoS) guarantee and high network utilization in high-speed networks. The QoS is given in terms of service...
详细信息
This paper proposes a novel real-time adaptive admission control (AAC) scheme with a desired quality of service (QoS) guarantee and high network utilization in high-speed networks. The QoS is given in terms of service delay, which is defined as the time it takes for a source to get admitted into the network after it initiates its intended request, packet/cell losses, and transmission delay (time taken to complete transmission from its initiation). AAC uses the following information- the available capacity from a novel adaptive bandwidth estimation scheme, a congestion indicator derived from a congestion controller, Peak Cell Rate (PCR) estimate from new sources, along with the desired QoS metrics, and outputs an 'admit' or 'reject' decision signal to the new sources while guaranteeing QoS and network utilization. Simulation results are presented by streaming ON/OFF and video data into the network. Results show that the proposed AAC admits significantly more traffic compared to other available admission control schemes thereby guaranteeing high network utilization while maintaining the desired QoS.
We present an efficient distributed dynamic channel allocation algorithm for mobile communications systems. The algorithm is based upon the mutual exclusion model, where the channels are grouped by the number of cells...
详细信息
We present an efficient distributed dynamic channel allocation algorithm for mobile communications systems. The algorithm is based upon the mutual exclusion model, where the channels are grouped by the number of cells in a cluster and each group of channels cannot be shared concurrently within the cluster. We discuss the algorithm and prove its correctness. We also show that the algorithm requires at most (worst case) O(N/sub g/*N/sub n/logN/sub n/) messages, where N/sub g/ is the number of groups and N/sub n/ is the number of neighbors. This is compared to Choy's (1995) algorithm which requires O(N/sub g//sup 2/*N/sub n/), where N/sub g/ is the number of groups. Our simulation experiments indicate that the DDRA algorithm outperforms previous schemes. A 5% reduction in the denial rate, and a 10-30% reduction in the acquisition time channel were obtained using our algorithm when compared to the previous algorithm.
Searching a Peer-to-Peer (P2P) network without using a central index has been widely investigated but proved to be very difficult. Various strategies have been proposed, however no practical solution to date also addr...
详细信息
Searching a Peer-to-Peer (P2P) network without using a central index has been widely investigated but proved to be very difficult. Various strategies have been proposed, however no practical solution to date also addresses privacy concerns.
Non-Fungible Token(NFT) is the latest tech-jargon buzzing in IT Industry. The continuous work in the area of securing contents with BlockChain has given rise to Non-Fungible Tokens(NFTs). One of the major problems of ...
详细信息
In this Internet era, we have become heavily dependent on the World Wide Web and it has become a basic amenity for humans. A normal user can be trapped easily in this vicious web if not careful enough. It is a field t...
详细信息
暂无评论