Computing and Information Systems - Research Publications
Permanent URI for this collection
Search Results
1 - 10 of 26
-
ItemProactive Traffic Merging Strategies for Sensor-Enabled Cars(IGI Global, 2009)Congestion is a major challenge in today’s road traffic. The primary cause is bottlenecks such as ramps leading onto highways, or lane blockage due to obstacles. In these situations, the road capacity reduces because several traffic streams merge to fewer streams. Another important factor is the non-coordinated driving behavior resulting from the lack of information or the intention to minimize the travel time of a single car. This chapter surveys traffic control strategies for optimizing traffic flow on highways, with a focus on more adaptive and flexible strategies facilitated by current advancements in sensor-enabled cars and vehicular ad hoc networks (VANETs). The authors investigate proactive merging strategies assuming that sensor-enabled cars can detect the distance to neighboring cars and communicate their velocity and acceleration among each other. Proactive merging strategies can significantly improve traffic flow by increasing it up to 100% and reduce the overall travel delay by 30%.
-
ItemA Taxonomy of CDNs(SPRINGER, 2008)
-
ItemDecentralized overlay for federation of enterprise clouds(IGI Global, 2009-12-01)This chapter describes Aneka-Federation, a decentralized and distributed system that combines enterprise Clouds, overlay networking, and structured peer-to-peer techniques to create scalable wide-area networking of compute nodes for high-throughput computing. The Aneka-Federation integrates numerous small scale Aneka Enterprise Cloud services and nodes that are distributed over multiple control and enterprise domains as parts of a single coordinated resource leasing abstraction. The system is designed with the aim of making distributed enterprise Cloud resource integration and application programming flexible, efficient, and scalable. The system is engineered such that it: enables seamless integration of existing Aneka Enterprise Clouds as part of single wide-area resource leasing federation; self-organizes the system components based on a structured peer-to-peer routing methodology; and presents end-users with a distributed application composition environment that can support variety of programming and execution models. This chapter describes the design and implementation of a novel, extensible and decentralized peer-to-peer technique that helps to discover, connect and provision the services of Aneka Enterprise Clouds among the users who can use different programming models to compose their applications. Evaluations of the system with applications that are programmed using the Task and Thread execution models on top of an overlay of Aneka Enterprise Clouds have been described here.
-
ItemPartial correlations of Galois ring sequences(IEEE, 2007)
-
ItemScheduling parallel applications on Utility Grids: Time and cost trade-off management(Australian Computer Society, 2009-12-01)
-
ItemWorkflow Scheduling Algorithms for Grid Computing(SPRINGER-VERLAG BERLIN, 2008)
-
ItemScheduling parameter sweep applications on global Grids: A deadline and budget constrained cost-time optimization algorithm(Wiley, 2005)Computational Grids and peer-to-peer (P2P) networks enable the sharing, selection, and aggregation of geographically distributed resources for solving large-scale problems in science, engineering, and commerce. The management and composition of resources and services for scheduling applications, however, becomes a complex undertaking. We have proposed a computational economy framework for regulating the supply of and demand for resources and allocating them for applications based on the users' quality-of-service requirements. The framework requires economy-driven deadline- and budget-constrained (DBC) scheduling algorithms for allocating resources to application jobs in such a way that the users' requirements are met. In this paper, we propose a new scheduling algorithm, called the DBC cost-time optimization scheduling algorithm, that aims not only to optimize cost, but also time when possible. The performance of the cost-time optimization scheduling algorithm has been evaluated through extensive simulation and empirical studies for deploying parameter sweep applications on global Grids.
-
ItemAn SCP-based heuristic approach for scheduling distributed data-intensive applications on global grids(ACADEMIC PRESS INC ELSEVIER SCIENCE, 2008-04)
-
ItemA least flow-time first load sharing approach for distributed server farm(ACADEMIC PRESS INC ELSEVIER SCIENCE, 2005-07)
-
ItemSecure communication in Mobile Ad Hoc network using efficient certificateless encryption(Academy Publisher, 2009-11-10)