By Topic

Performance, Computing, and Communications, 2004 IEEE International Conference on

Date 2004

Filter Results

Displaying Results 1 - 25 of 265
  • A game theory based approach for security in wireless sensor networks

    Page(s): 259 - 263
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (675 KB) |  | HTML iconHTML  

    Based on cooperative game theory, we propose a new technique for handling security issues in mobile wireless sensor networks. We define a game between sensor nodes and concentrate on three fundamental factors: cooperation, reputation and quality of security. Stronger cooperation between two nodes implies more reliable data communication between them. And the more a node cooperates the better is its reputation, which decreases when misbehavior is detected. When security of the network is compromised, the percentage of exposed traffic measures the quality of security of sensor nodes. By incorporating these three factors, we cluster the sensor nodes such that within a cluster, the payoff function of all sensor nodes are close to each other, where payoff is the largest possible individual gain for each sensor according to a defined utility metric. We define one strategy set for each node, which guarantees reaching to an equilibrium point for payoff function. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On intrusion detection and response for mobile ad hoc networks

    Page(s): 747 - 752
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (742 KB) |  | HTML iconHTML  

    We present network intrusion detection (ID) mechanisms that rely upon packet snooping to detect aberrant behavior in mobile ad hoc networks. Our extensions, which are applicable to several mobile, ad hoc routing protocols, offer two response mechanisms, passive - to singularly determine if a node is intrusive and act to protect itself from attacks, or active - to collaboratively determine if a node, is intrusive and act to protect all of the nodes of an ad hoc cluster. We have implemented our extensions using the GloMoSim simulator and detail their efficacy under a variety of operational conditions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A simulation study on a layered video multicast algorithm

    Page(s): 265 - 269
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (689 KB) |  | HTML iconHTML  

    In this paper, the improvement of the quality of received video is demonstrated by applying priority dropping mechanism (PDM) to RED algorithm to protect the video layers selectively. Moreover, to achieve fairness among different types of network traffic with PDM, new packet classification scheme (PCS) is implemented to assign the priority to each SPLIT layer based upon the target rate. This PCS can also distinguish the priority for packets even within the same layer. In an effort to gauge the performance of the SPLIT protocol with the proposed packet classification scheme and to study the effects of PDM on the network, a number of experiments were conducted and compared. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Predicting node location in a PCS network

    Page(s): 165 - 170
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (694 KB) |  | HTML iconHTML  

    Predicting the location of a mobile via a previously known location can reduce costs over non-predictive methods that always begin paging in the last known location. If the mobility pattern of a mobile can be described by a mathematical model, such as the Gauss-Markov model, a predictive management scheme based on that model is ideal. Typically, however, the mobility pattern of a mobile is too complex to be modeled accurately. In this paper, we propose an adaptive mobility management method which is not based upon a mathematical model. In our method, the location of a mobile is predicted solely on the basis of previously reported locations. We compare our method, through simulations, with a non-predictive method and a method based upon a mathematical model. The results show that our adaptive mobility management method performs well under a wide variety of mobility patterns. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of the Globus Toolkit Monitoring and Discovery Service, MDS2

    Page(s): 843 - 849
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (708 KB) |  | HTML iconHTML  

    Monitoring and information services form a key component of a distributed system, or grid. A quantitative study of such services can aid in understanding the performance limitations, advise in the deployment of the monitoring system, and help evaluate future development work. To this end, we examined the performance of the Globus Toolkit® Monitoring and Discovery Service (MDS2) by instrumenting its main services using NetLogger. Our study shows a strong advantage to caching or prefetching the data, as well as the need to have primary components at well-connected sites. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Object allocation and memory contention study of Java multithreaded applications

    Page(s): 375 - 382
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (891 KB) |  | HTML iconHTML  

    Java has become a popular programming language used on different platforms, ranging from embedded systems to powerful servers. Since the memory management is one of the most time-consuming parts within Java virtual machine (JVM), various techniques have been developed to boost its performance. However, the JVM memory management still does not scale very well, especially for multithreaded server applications. In this paper, we study different aspects of JVM object allocation from thread's perspective, using the trace data we collected from Sun JDK 1.3.1. Additionally, we construct a heap simulator to study the potential memory contentions among different threads. The simulation results show that dividing heap into different subheaps is very effective in alleviating the memory contentions. The results imply the potential benefits of using subheaps in improving the Java memory management performance. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A location information-based route discovery protocol for mobile ad hoc networks

    Page(s): 625 - 630
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (688 KB) |  | HTML iconHTML  

    A mobile ad hoc network (MANET) is a set of mobile nodes that agreed upon forming a temporary, spontaneous network in spite of the lack of any infrastructure or centralized administration. MANET topology changes frequently and arbitrarily due to node mobility. Therefore, an efficient routing protocol is required to cope with the dynamic change of MANET topology, which requires discovering and maintaining new routes, in this paper we propose a route discovery protocol based on location information, which could be provided to MANET nodes by a Global Positioning System (GPS). Our route discovery protocol utilizes the essential features of Voronoi diagrams in order to reduce the search space of routes by allowing only a small subset of MANET nodes, called authorized forwarders, to forward a route request. This results in a restrictive, selective route discovery protocol, which significantly reduces the routing overhead compared to other location-based routing protocol, such as LAR. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A performance analysis of the sockets direct protocol (SDP) with asynchronous I/O over 4X InfiniBand

    Page(s): 241 - 246
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (718 KB) |  | HTML iconHTML  

    The sockets direct protocol (SDP) is a stream transport protocol, which is capable of supporting kernel bypass data transfers as well as zero-copy data transfers. It was developed for new networking technologies, which support user-level networking and remote direct memory access (RDMA). This paper studies the performance of an SDP implementation over 4X InfiniBand. SDP performance is studied for two APIs: the regular sockets API without zero-copy transfers, and the asynchronous I/O (AIO) API that supports zero-copy transfers and multiple outstanding transfers. Tests were run to measure latency, throughput, and CPU load. One goal was to determine the message size threshold where it starts being beneficial to use SDP with the AIO API instead of the regular sockets API. It is shown that the optimal threshold is different depending on whether the goal is to maximize throughput alone or throughput per unit of CPU load. SDP performance is also compared to InfiniBand verbs performance and to TCP performance over Gigabit Ethernet. It is shown that SDP is capable of low latencies (31 μs for small messages) and very high throughput at low CPU loads (close to 6 Gbs with 64 KB buffers at under 30% CPU load). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive power aware remote processing - a step towards power aware middleware

    Page(s): 851 - 856
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (703 KB) |  | HTML iconHTML  

    Due to slow improvements in battery technology there will be an insignificant increase of battery capacities in near future. Therefore, the ubiquitous environment should help mobile battery-operated devices to increase their runtime. One possibility is power aware remote processing. The needed flexibility should be provided by power aware middleware. This paper describes a concept for adaptive power aware remote processing, shows some implementation details, and presents evaluation results of real-world image processing tasks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance consequences of inconsistent client-side membership information in the open group model

    Page(s): 777 - 782
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (754 KB) |  | HTML iconHTML  

    In a distributed fault-tolerant server system realized according to the open group model, inconsistency will (temporarily) arise between the dynamic membership of the replicated service and its client-side representation in the event of server failures and recoveries. The paper proposes techniques for maintaining this consistency and discuss their performance implications in failure/recovery scenarios where clients load balance requests on the servers. Comparative performance measurements is carried out for two of the proposed techniques. The results indicate that the performance impact of lacking consistency is easily kept small, and that the cost of the technique is small. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new protocol for a low power sensor network

    Page(s): 393 - 399
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (737 KB) |  | HTML iconHTML  

    This paper proposes a simple protocol for low-power sensor networks with battery-operated sensing devices. The sensors are expected to become active only when certain events in the environment occur. Therefore, a scheme for the application and medium access cycles is developed which avoids common problems of energy loss due to idle actions. Subsequently, the protocol is evaluated according to sensor lifetime. In contrast to common performance analysis, the approach considers the application behavior as a main impact on the sensor lifetime. Capabilities to save energy are derived. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Relocation of gateway for enhanced timeliness in wireless sensor networks

    Page(s): 471 - 476
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (776 KB) |  | HTML iconHTML  

    In recent years, due to increasing interest in applications of wireless sensor networks that demand certain quality of service (QoS) guarantees, new routing protocols have been proposed for providing energy-efficient real-time relaying of data. However, none of these protocols considered any possible movement of the sink node for performance purposes. In this paper, we propose possible relocation of sink (gateway) for improving the timeliness of real-time packets. Our approach searches for a location close to the most loaded node. The gateway is then relocated to the new location so that the load of that node is alleviated and the real-time traffic can be split. As long as the gateway stays within the transmission range of all last hop nodes, it can be moved to that location without affecting the current route setup. Otherwise routes are adjusted by introducing new forwarders. Simulation results demonstrate the effectiveness of the proposed approach. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A goal-oriented self-tuning caching algorithm

    Page(s): 311 - 312
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (525 KB) |  | HTML iconHTML  

    The contribution of this paper is a novel approach to adaptivity that combines alternatives rather than selecting one among alternatives. Using only three, homogenous, cache replacement algorithms, GD-GhOST were able to provide a cache replacement policy that requires no tuning or user-intervention beyond the initial selection of the performance criteria to be optimized. Overall, at its worst observed performance GD-GhOST was within approximately 1% of the best policy's miss ratio, and at its best, GD-GhOST reduced byte miss rates by well over 50%. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scale-up and performance studies of three agent platforms

    Page(s): 857 - 863
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (865 KB) |  | HTML iconHTML  

    With maturing technology agents are now a viable choice for distributed computing, also for systems with requirements on dependability and scalability. Agent platforms provide common services to applications developed as agents. Given the abundance of available platforms it is not easy to select an agent platform given a set of applications requirements. Evaluations of relevant properties of agent platforms are therefore needed, but unfortunately few up-to-date evaluations exist. In this paper we introduce and evaluate the three recent agent platforms JADE, Tryllian and SAP. Focus of the evaluation is the important properties of performance, security and scalability. We conclude that all platforms perform very well, but that platform architecture heavily influences the performance. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SPECSA: a scalable, policy-driven, extensible, and customizable security architecture for wireless enterprise applications

    Page(s): 753 - 759
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (889 KB) |  | HTML iconHTML  

    This paper presents SPECSA, a new, optimized, policy-driven security architecture for wireless enterprise applications. SPECSA is scalable, extensible, flexible, and customizable. It supports end-to-end client authentication, data integrity and confidentiality between wireless clients and enterprise servers. The security services provided by SPECSA are customized and controlled by an easily configurable security policy that specifies several security-related attributes, classifies network data based on sensitivity and content, and provides an abstraction for the communication and messaging between the client and the server. In addition, SPECSA provides an application programming interface (API) that conceals to a great extent the complexity of security operations and programming from the application. SPECSA was designed in a platform-neutral manner and can be implemented on a wide range of wireless clients ranging from low-end platforms such as the Java 2 mobile edition/connected limited device configuration (J2ME/CLDC) on limited-memory mobile devices to Personal Java and the .Net compact framework on PDAs. On the server side, SPECSA can be implemented on any of the available enterprise server platforms. A sample implementation of SPECSA was developed for J2ME on the client-side and Java 2 enterprise edition (J2EE) on the server-side. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Position-based routing with a power-aware weighted forwarding function in MANETs

    Page(s): 347 - 355
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (902 KB) |  | HTML iconHTML  

    Power-aware routing is crucial for battery-finite mobile nodes in MANETs. Energy consumption optimization consists of not only energy saving, but also energy-balanced usage of nodes. In this paper, we present a new position-based routing protocol with a power-aware weighted forwarding function, named PAWF. With this forwarding function, the energy consumption and energy residual values of mobile nodes are asymmetrically combined with forwarding achievement and used to make decisions of hop by hop routing. PAWF routing requires only the local information of strict neighbors and the destination. With the power-awareness, the over-usage of mobile nodes is avoided and the lifetime of the network is increased due to energy consumption balance. Based on simulation results, PAWF is also shown to be able to provide global energy-sufficient near-optimal paths by making locally optimal choices, which offers the possibility to implement further QoS routing in MANETS. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An adaptive low power reservation based MAC protocol for wireless sensor networks

    Page(s): 731 - 736
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (742 KB) |  | HTML iconHTML  

    A sensor network is a collection of wireless sensor nodes, each equipped with embedded processor, memory, and a wireless transceiver, that may be designed to perform distributed sensing and tracking operations. The sensor nodes use ad hoc networking principles to communicate amongst themselves. However, limitations of battery power in the sensor nodes and the bursty and correlated nature of traffic in the network introduce additional constraints for designing the communication protocols for sensor networks over that of traditional ad hoc networks. This paper proposes a reservation based medium access control (MAC) protocol for sensor networks that provides a high probability of success in packet transmissions, low average energy consumption, and adaptability to the traffic requirements to maximize the data throughput. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mobile ad hoc multicasting to support distributed virtual environments

    Page(s): 653 - 659
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (729 KB) |  | HTML iconHTML  

    Distributed virtual environment (DVE) applications such as interactive gaming and tele-immersion are becoming increasingly popular to use within mobile ad hoc networks. However, existing ad hoc multicasting protocols do not provide adequate support for DVE applications. This paper presents a novel multicasting protocol that provides a high level of support for the DVE. Our protocol, which is independent of the underlying unicasting routing infrastructure, uses a combined mesh and core approach. Multiple cores are selected and migrated according to the current conditions in the physical network and the virtual environment. An extensive performance evaluation of this approach shows that our technique is capable of effectively supporting large-scale DVE applications. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Position-based QoS routing in mobile ad hoc networks: problem statement and a novel approach

    Page(s): 619 - 623
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (649 KB) |  | HTML iconHTML  

    In recent years many research on routing protocols for mobile ad-hoc networks has been conducted. However, despite some prior effort, an scheme to provide reliable end-to-end QoS has not been hitherto proposed. Therefore, it still remains one of the main open issues. In this paper we propose a novel reliable position-based network layer solution for quality of service (QoS) routing in mobile ad-hoc networks (MANETs). First results show that the proposed architecture affords stable behavior, which is an essential premise for QoS routing. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • QoS service routing in one-to-one and one-to-many scenarios in next-generation service-oriented networks

    Page(s): 503 - 510
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (851 KB) |  | HTML iconHTML  

    The QoS service routing problem has recently emerged as a consequence of the increasingly accepted distributed and composable services model. Different from the conventional QoS data routing, QoS service routing presents additional challenges caused by the service functionality, service dependency, resource requirement heterogeneity, and loop formation issues, that make solutions for QoS data routing inapplicable to QoS service routing. We study this problem both in one-to-one and one-to-many application scenarios, so that despite the fact that the component services are located distributively in multiple hosts, the system can still provide integrated services seamlessly and efficiently. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Settlement and capacity planning in multi-service provider infrastructures

    Page(s): 39 - 48
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (957 KB) |  | HTML iconHTML  

    Service providers are increasingly turning to federated approaches to meet customer demand while limiting the risk of large-scale computing infrastructure investments. In such models, service providers could meet the demands of peak processing periods or specialized application environments by offloading to a partner provider. While a number of distributed systems initiatives, including Grid computing, rely on such cooperatives, models for effective capacity planning and settlement in such environments has largely been ignored. In this paper, we develop a model for settlement and capacity planning in a multi-provider computing cooperative. We introduce two pricing tariffs - linear and burstable pricing - that are commonly used in the industry, and compare their relative merits. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Flow policies: specification and enforcement

    Page(s): 681 - 684
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (621 KB) |  | HTML iconHTML  

    This paper deals with the problem of secure cooperative updates for XML documents in distributed systems. In particular, we introduce the basic notions underlying a flow language by using which a user can specify the flow that a given XML document has to follow within a group of cooperating subjects. A key feature of the flow language is to be based on the notion of subject credentials. In addition, we describe a policy language to specify special-purpose authorizations allowing selected subjects to modify or extend a given document flow. Finally, we briefly describe the protocols for verifying that the path followed by a document in a collaborative group agrees with the specified flow and to verify that modifications on a given flow are in accordance with the specified authorizations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capacity provisioning in DiffServ/MPLS networks based on correlated traffic inputs

    Page(s): 187 - 193
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (833 KB) |  | HTML iconHTML  

    In this paper, we propose a dimensioning model that takes account of the new technologies that can provide QoS (i.e., DiffServ/MPLS) and allows for multiple delay constraints so that guaranteed performance can be achieved for each of the traffic classes. The proposed model incorporates procedures that allow correlations and burstiness of IP traffic to be effectively modelled. The accuracy of the model has been investigated by means of a simulation study over a range of test cases. The results demonstrate the capability of the model in guaranteeing the end-to-end delay requirements for the traffic classes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SONAR: a platform for flexible DiffServ/MPLS traffic engineering

    Page(s): 195 - 201
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (767 KB) |  | HTML iconHTML  

    A major opportunity for IP network operators to increase the revenue stream generated by their network is a closer and faster integration of services into the IP broadband network. However, with this integration come responsibilities concerning the quality, availability and continuity of these services, which are much harder to fulfil than the requirements for the current IP data traffic. SONAR (service-oriented networking using adaptive resource control) is a network management and operations platform designed to drive a DiffServ/MPLS network so that these responsibilities can be met. In this paper we discuss and evaluate the architecture and algorithms that are the basis for this platform. The architecture decomposes the network management problem in two components: a centralised path computation and a distributed tunnel management. Finally this hybrid on line/off line adaptive traffic engineering approach is evaluated in an modified NS-2 simulator environment. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coopeer: a peer-to-peer Web search engine towards collaboration, humanization and personalization

    Page(s): 313 - 314
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (491 KB) |  | HTML iconHTML  

    Most centralized Web search engines currently become harder to catch up with the growing step of people's information need. Here, we present a fully distributed, collaborative peer-to-peer Web search engine named Coopeer. The goal of the work is to complement centralized search engines to provide more humanized and personalized results by utilizing users' collaboration. Towards this goal, three main ideas are introduced: (a) PeerRank to use cooperation among users for evaluation, (b) query-based representation to obtain more humanized description about documents, and (c) semantic routing algorithm to obtain user-customized results. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.