The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
As is known to all, the shortcomings of traditional SOAP-based Web service and the older XML-RPC protocols, such as lacking of addressability and connectedness, greatly limit the modeling and abstraction of enterprise resources. In order to integrate the resources of enterprise information systems in heterogeneous environment, this paper proposes a REST-based resource-oriented approach to integrate...
Resource allocation is a critical issue for Wireless Sensor Networks (WSNs) especially for Ultra-Wide Band (UWB) based networks. In this paper, we present frequency allocation scheme for an efficient spectrum management that is able to statically assign control channels and dynamically reuse data channels for Personal Area Networks (PANs) inside a Large-Scale WSN based on UWB technology. The frequency...
As part of the resource allocation mechanisms, each router must implement some queuing discipline that governs how packets are buffered while waiting to be transmitted. Various queuing disciplines can be used to control which packets get transmitted (bandwidth allocation) and which packets get dropped (buffer space). The queuing discipline also affects the latency experienced by a packet, by determining...
Resource discovery is an important aspect of many modern large-scale distributed systems. In the past, this problem has been solved using many different approaches, such as a central registry server, flooding-based protocols, and distributed hash tables. In this paper, these three widely used architectures are compared, using measurement results obtained from real implementations run on an Emulab...
Universal plug and play, or UPnP in short, is a ldquoplug and playrdquo methodology used in network environment. It's designed to share resources, connect network devices and offer control over services. It implements zero-configuration. Developer can save the cost of network setup and concentrate on the offering services only and do not need to concern the under layer protocol. As the wide spreading...
Conducting data fusion and Command and Control (C2) in large-scale systems requires more than the presently available Peer-to-Peer (P2P) technologies provide. Resource Clustered Chord (RC-Chord) is an extension to the Chord protocol that incorporates elements of a hierarchical peer-to-peer architecture to facilitate coalition formation algorithms in large-scale systems. Each cluster in this hierarchy...
A mission critical environment (MCE) consists of error-prone, highly variable, and highly rate limited communication channels. Paradoxically, this substantially increases the need to perform optimal task allocation (OTA), while at the same time making it much harder to perform OTA efficiently. To simplify the problem, we consider OTA for publish/subscribe-based MCE since it has unique characteristics...
Computing capacity bounds of ad hoc networks, as well as optimizing radio resource allocation in order to approach those bounds is a hard task that have recently attracted the interest of the research community. In this paper we address the problem of jointly optimizing the routing of flows, the transmission scheduling over wireless links along the path, and the emitted power for bandwidth guaranteed...
InfiniBand networks are aimed to fulfill increasing communication demand of parallel applications in high performance clusters. However, the dynamic behavior of communication load may cause bottlenecked link(s) which lead to message congestion. Congestion spreading increases latency and reduces network throughput causing important performance degradation. In this paper, we propose a congestion control...
In this paper we present the design and evaluation of a system for deploying highly available and migratable services in shared infrastructures, such as the PlanetLab, where the available resource capacities at a node can fluctuate significantly. A migratable service can monitor its operating conditions and autonomously relocate itself to another node when the available resource capacities at the...
Multi-core architectures have received significant interest as thermal and power consumption problems limit further increase of speed in single-cores. In the multi-core research community a considerable amount of work has been done on real-time multi-core scheduling algorithms where it is assumed tasks are independent. However, synchronization of dependent tasks executing on multi-cores has not received...
Resource allocation and task scheduling are two key technologies in grid computing system. The market-based resource allocation model is considered as a good one. In this paper, an on-line reverse auction method of resource allocation for computational grids was proposed to solve the problem of resource management considering the dynamic characteristics of computing resources in the computational...
Informing users about new resource assignments has to be broadcast, thus generating a substantial amount of the mapping overhead that influences the system throughput. In particular, the performance of voice-over-Internet protocol (VoIP) services is seriously affected by the mapping overhead because the VoIP packet size is small. In order to reduce the mapping overhead, a semi-fixed mapping scheme...
A method for ldquopreempting memoryrdquo is presented, where (parts of) the memory allocated to an active task may be reallocated to another task, without corrupting the state of the active task's job. The method is based on combining scalable components with fixed-priority scheduling with deferred preemption (FPDS).Real-time systems composed of scalable components are investigated. A scalable component...
Constraint satisfaction has been a very successful paradigm for solving problems such as resource allocation and planning. Many of these problems pose themselves in a context involving multiple agents, and protecting privacy of information among them is often desirable. Secure multiparty computation (SMC) provides methods that in principle allow such computation without leaking any information. However,...
Recently, two SRP-based synchronization protocols for hierarchically scheduled real-time systems based on fixed priority preemptive scheduling (FPPS) have been presented, i.e., HSRP and SIRAP. Preventing depletion of budget during global resource access, the former implements an overrun mechanism, while the later exploits a skipping mechanism. A theoretical comparison of the performance of these mechanisms...
Recently, task allocation in multi-agent systems has been investigated by many researchers. Some researchers suggested to have a central controller which has a global view about the environment to allocate tasks. Although centralized control brings convenience during task allocation processes, it also has some obvious weaknesses. Firstly, a central controller plays an important role in a multi-agent...
The Grid provides access to execution and storage resources - through middleware - by normalizing the access to resources. UNICORE calls this quality dasiaseamlessnesspsila. One result of this is that a request for some action at one resource can, with relative ease, be re-targeted to another, making possible the coordinated usage of multiple resources. In this paper we describe a seamless interface...
DCUR follows the same procedure as define in Bellman-Ford but uses two vectors, namely least cost and least delay vector. The main drawback of DCUR is its assumption of link costs. It means that the minimum cost path is more often chosen and therefore the load distribution is not fair for the minimum cost paths. In this paper we propose a way to modify the cost and delay metrics dynamically in the...
In order to alleviate the burden of network administrators in the network resource management field, a network resource management system is designed and implemented based on the design idea of SNMP. This system which based on VC++ platform utilizes the principle of network communication and the feature of network resource, implements management of the IP addresses and the monitoring of the servers,...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.