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.
We present our ongoing work on synchronization in hierarchical scheduled real-time systems, where tasks are scheduled using fixed-priority pre-emptive scheduling. In this paper, we show that the original local schedulability analysis of the synchronization protocol SIRAP [4] is very pessimistic when tasks of a subsystem access many global shared resources. The analysis therefore suggests that a subsystem...
BitTorrent, one of the most popular content distribution protocols nowadays, has an identification generation scheme that is completely autonomous. Furthermore, BitTorrent uses a random mechanism to discover new peers. This leaves the system vulnerable to a sybil attack, by which an entity associates multiple identifications to itself in an attempt to fool the other peers that execute the agreed protocol...
This paper develops a diversity-multiplexing tradeoff (DMT) over a bidirectional random relay set in a wireless network where the distribution of all nodes is a stationary Poisson point process. This is a nontrivial extension of the DMT because it requires consideration of the cooperation (or lack thereof) of relay nodes, the traffic pattern and the time allocation between the forward and reverse...
Consider the problem of scheduling sporadic tasks on a multiprocessor platform under mutual exclusion constraints. We present an approach which appears promising for allowing large amounts of parallel task executions and still ensures low amounts of blocking.
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...
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...
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,...
Nowadays, grid computing is moving from sharing computing power and storage resources to sharing business resources, including any abstract business entities and resources. The new trend brings a big challenge, since these universal business resources typically do not belong to the same level. Describing them is already difficult; describing them in a unified way is even more difficult. Business process...
Whereas grids enable the sharing, selection, query and aggregation of geographically distributed resources for solving large-scale problems, providing efficient resource allocation mechanism managing grid resources is a complex undertaking. In this work, we consider the problem of engineering agents that act as proxies for the procurement of computational and data resources. Since applications may...
The following topics are dealt with: cloud computing; resource management; P2P networks; distributed storage; delay assurance; data security; wireless networks; QoS routing; TCP; and service management.
New applications are likely to ask for a more flexible bandwidth, large bandwidth for limited amount of time. In order to meet these new requirements, flexible optical transport networks in which connections could be set up and released on dynamic short-term basis have to be introduced. We propose a distributed Holding-Time-Aware provisioning framework based on intelligent destination routing to assign...
The aim of this paper has been to introduce a novel market based algorithm for grid resource allocation and resolve some incompetence with current mechanisms. Grid resource allocation could be considered as a double auction in which grid resource manager acts as an auctioneer and jobs and resource owners act as buyers (resource consumers) and sellers. In our approach resource allocation is based on...
The fixed channelization structure used by IEEE 802.11-based WLANs constrains the total capacity and leads to unfairness. The concept of variable-width channels is recently proposed to overcome these drawbacks. To investigate the problem of the non-overlapping variable-width channel allocation for selfish access points (APs) in a WLAN, we model it as a non- cooperative game, we aim to investigate...
Cognitive radio networks are envisioned to solve the problem of spectral scarcity in wireless networks; through providing highly configurable radios and protocol stacks to support the application of a variety of efficient and possibly cross-layered solutions. However, the large numbers of hardware and software modules involved in realising these goals raises a fundamental design problem. Specifically,...
Though plenty of research has been conducted to improve Internet P2P streaming quality perceived by end-users, little has been known about the upper bounds of achievable performance with available resources so that different designs could compare against. On the other hand, the current practice has shown increasing demand of server capacities in P2P-assisted streaming systems in order to maintain...
Whereas Grids enable the sharing, selection, query and aggregation of geographically distributed resources for solving large-scale problems, providing efficient resource allocation mechanism managing Grid resources is a complex undertaking. In this work, we consider the problem of engineering agents that act as proxies for the procurement of computational and data resources. Since applications may...
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.