Cloud computing offers its customers an economical and convenient pay-as-you-go service model, known also as usage-based pricing . Cloud customers1 pay only for the actual use of computing resources, storage, and bandwidth, according to their changing needs, utilizing the cloud’s scalable and elastic computational capabilities. In particular, data transfer costs (i.e., bandwidth) is an important […]
Heuristic load balancing Method for improving the task scheduling
SOC is different from the traditional Grid model (including P2P desktop Grid) in the resource consumption manner. Grids generally assume exclusive resource usage to ensure user QoS. The problem of job scheduling in Grids is usually categorized as a multiprocessor scheduling (MPS) problem (a kind of combinatorial optimization problem), which has been proved to be […]
Visual cryptography is a secret sharing scheme
Visual cryptography (VC) is a secret sharing scheme, based on black and white or binary images. Secret images are divided into share images which, on their own, reveal no information of the original secret. Shares may be distributed to various parties so that only by collaborating with an appropriate number of other parties, can the […]
SOCIAL NETWORK ANALYSIS-BASED MOBILE NODE GROUPING
The proposed cooperative packet delivery approach is related to the concept of delay-tolerant networks (DTNs), in this section, we review the related work on delay tolerant and cooperative data transmission in wireless networks. DTNs are characterized by long transmission delay, high error rates, intermittent connectivity, and existence of multiple unreliable links . Vehicular delay tolerant […]
A Multicast Discovery Protocol To Locate Services On A Local
Network Our research aims at providing a scalable, reliable, and robust approach for web service discovery. An overview of web service discovery. Service-oriented Computing (SOC) is emerging as a new paradigm for developing distributed applications. Service discovery, among the most fundamental elements of SOC, is critical to the success of SOC as a whole. Traditional […]
The type system is parameterized by an arbitrary lattice of security levels
A survey on language-based information-flow security contains an overview of the area. Most related to ours is work on tracking information flow in object-oriented languages and on information-flow controls in the presence of exceptions. Language-based concepts and techniques are becoming increasingly popular in the context of security , because they provide an appropriate level of […]
Scalable Video Coding Technique in Mobile Networks
In this paper, we discussed our proposal of an adaptive mobile video streaming and sharing framework, called AMES-Cloud, which efficiently stores videos in the clouds (VC), and utilizes cloud computing to construct private agent (subVC) for each mobile user to try to offer “non-terminating” video streaming adapting to the fluctuation of link quality based on […]
WIRELESS NETWORKS TO ACHIEVE VMISO LINKS
The wireless channel is impaired by random fluctuations in signal level across space, time, and frequency dimensions known as fading. This signal fluctuation (also called diversity) can be exploited by the use of multiple transmissions/ receptions distributed across time or space with appropriate encoding to enhance and stabilize the signal level at the receiver. Such […]
MOBILE SENSOR NAVIGATION STRATEGY
A navigator in this case aims to control the mobile sensor to get close to the moving target from any initial position. Since the target maneuvers are not known a priori to the controller, solving the problem requires a real-time strategy. The joint problem of mobile sensor navigation and mobile target tracking based on a […]
VM multiplexing resource allocation scheme to manage decentralized resources
The design of our dynamic optimal proportional-share resource allocation method, which leverages the proportional share model.The key idea to redistribute available resources among running tasks dynamically, such that these tasks could use up the maximum capacity of each resource in a node (i.e., up to cðpsÞ), while each task’s execution time can be further minimized […]
- « Previous Page
- 1
- …
- 4
- 5
- 6
- 7
- 8
- …
- 13
- Next Page »