Repository logo

Browsing by Author "Banka, Tarun, author"

Now showing 1 - 5 of 5
  • Thumbnail Image
    ItemOpen Access
    Application-aware in-network service deployment for collaborative adaptive sensing of the atmosphere (CASA)
    (Colorado State University. Libraries, 2008) Lee, Panho, author; Banka, Tarun, author; Lim, Sang-hun, author; Jayasumana, Anura P., author; Chandrasekar, V., author
    An Engineering Research Center for Collaborative Adaptive Sensing of the Atmosphere (CASA) funded by the National Science Foundation, seeks to revolutionize the way we detect, monitor and predict atmospheric phenomena by creating a dense network of small, low-cost, low-power radars that could collaboratively and adaptively sense the lower atmosphere. Such a network is expected to provide more timely and accurate forecasts for tornadoes, flash floods, and other hazardous weathers. In addition, the networked radars can offer improved accuracies and more specific inferences that could not be achieved by the use of a single long-range radar. In CASA, multiple end users may be present that have distinct sensing, communication and computation requirements for their operations. In addition, the underlying network infrastructure may itself be subjected to adverse conditions due to severe weather and link degradation/outage along wired and wireless links. We use overlay networking to provide acceptable quality of service (QoS) and robust data transport service for the CASA end-users. At CSU, we have developed an AWON (Application-aWare Overlay Networks) architecture for deploying application-aware services in an overlay network to best meet the end-users' QoS requirements over the available networking infrastructure; based on this, we have implemented an application-aware multicast service for CASA. We also present a multi-sensor fusion framework which can provide a mechanism for selecting a set of data for data fusion considering application-specific needs, and a distributed processing scheme to minimize the execution time required for processing data per integration algorithm.
  • Thumbnail Image
    ItemOpen Access
    Application-aware transport services for sensor-actuator networks
    (Colorado State University. Libraries, 2007) Banka, Tarun, author; Jayasumana, Anura P., advisor; Chandrasekar, V., advisor
    Many emerging mission-critical sensor actuator network applications rely on the best-effort service provided by the Internet for data dissemination. This dissertation investigates the paradigm of application-aware networking to meet the QoS requirements of the mission-critical applications over best-effort networks that do not provide end-to-end QoS support. An architecture framework is proposed for application-aware data dissemination using overlay networks. The application-aware architecture framework enables application-aware processing at overlay nodes in the best-effort network to meet the QoS requirements of the heterogeneous end users of mission-critical sensor-actuator network applications. An application-aware congestion control protocol performs data selection and real-time scheduling of data for transmission while considering different bandwidth and data quality requirements of heterogeneous end users. A packet-marking scheme is proposed that enables application-aware selective drop and forwarding of packets at intermediate overlay nodes during network congestion to further enhance the QoS received by the end users under dynamic network conditions. Effectiveness of the transport services based on application-aware architecture framework is demonstrated by one-to-many high-bandwidth time-series radar data dissemination protocol for CASA (Collaborative Adaptive Sensing of the Atmosphere) application. Experiment results demonstrate that under similar network conditions and available bandwidth, application-aware processing at overlay nodes significantly improves the quality of the time-series radar data delivered to the end users compared to case when no such application-aware processing is performed. Moreover, it is shown that application-aware congestion control protocol is friendly to the already existing TCP cross-traffic on the network as long as bandwidth requirements of the mission-critical applications are met. Scalability analysis of application-aware congestion control protocol shows that it is able to schedule data at cumulative rates of more than 700M bps without degrading the QoS received by multiple end users.
  • Thumbnail Image
    ItemOpen Access
    Mapping of subtasks with multiple versions in a heterogeneous ad hoc grid environment
    (Colorado State University. Libraries, 2004) Velazco, Jose, author; Sugavanam, Prasanna, author; Sridharan, Jayashree, author; Sousa, J., author; Sendek, David, author; Satyasekaran, Praveen, author; Pichumani, Prakash, author; Penumarthy, Prashanth, author; Kutruff, Andrew,, author; Dussinger, Steve, author; Chindam, Kiran, author; Banka, Tarun, author; Maciejewski, Anthony A., author; Siegel, H. J., author; Shivle, Sameer, author; IEEE Computer Society, publisher
    An ad hoc grid is a heterogeneous computing system composed of mobile devices. The problem studied here is to statically assign resources to the subtasks of an application, which has an execution time constraint, when the resources are oversubscribed. Each subtask has a preferred version, and a secondary version that uses fewer resources. The goal is to assign resources so that the application meets its execution time constraint while minimizing the number of secondary versions used. Five resource allocation heuristics to derive near-optimal solutions to this problem are presented and evaluated.
  • Thumbnail Image
    ItemOpen Access
    Static allocation of resources to communicating subtasks in a heterogeneous ad hoc grid environment
    (Colorado State University. Libraries, 2006) Velazco, José, author; Sridharan, Jayashree, author; Sousa, J., author; Sendek, David, author; Saylor, William, author; Satyasekaran, Praveen, author; Pichumani, Prakash, author; Dussinger, Steve, author; Chindam, Kiran, author; Castain, Ralph, author; Banka, Tarun, author; Sugavanam, Prasanna, author; Maciejewski, Anthony A., author; Siegel, H. J., author; Shivle, Sameer, author; Elsevier Inc., publisher
    An ad hoc grid is a heterogeneous computing and communication system that allows a group of mobile devices to accomplish a mission, often in a hostile environment. Energy management is a major concern in ad hoc grids. The problem studied here focuses on statically assigning resources in an ad hoc grid to an application composed of communicating subtasks. The goal of the allocation is to minimize the average percentage of energy consumed by the application to execute across the machines in the ad hoc grid, while meeting an application execution time constraint. This pre-computed allocation is then used when the application is deployed in a mission. Six different heuristic approaches of varying time complexities have been designed and compared via simulations to solve this ad hoc grid allocation problem. Also, a lower bound based on the performance metric has been designed to compare the performance of the heuristics developed.
  • Thumbnail Image
    ItemOpen Access
    Static mapping of subtasks in a heterogeneous ad hoc grid environment
    (Colorado State University. Libraries, 2004) Velazco, José, author; Sugavanam, Prasanna V., author; Sridharan, Jayashree, author; Sousa, J. C., author; Sendek, David, author; Saylor, William W., author; Satyasekaran, Praveen Moses, author; Pichumani, Prakash K., author; Dussinger, Steve, author; Chindam, Kiran, author; Banka, Tarun, author; Maciejewski, Anthony A., author; Siegel, Howard Jay, author; Castain, Ralph, author; Shivle, Sameer, author; IEEE, publisher
    An ad hoc grid is a heterogeneous computing and communication system without a fixed infrastructure; all of its components are mobile. Energy management is a major concern in an ad hoc grid. One important aspect of energy management is to minimize the energy consumption during a mission. In an ad hoc grid, communication and computations are deeply intertwined, and any energy optimization must consider both types of activities together rather than separately. The mapping (defined as matching and scheduling) of tasks onto machines with varied computational capabilities has been shown, in general, to be an NP-complete problem. Therefore, heuristic techniques are required to efficiently map tasks to machines in an ad hoc grid so as to minimize the energy consumed due to communication and computation. This research evaluates and compares energy management issues for resource allocation in ad hoc grids using six static heuristics.