|
|
Cover Art |
|
Page: C1 |
|
doi>10.1109/NCA.2008.62 |
|
Available formats:
Publisher Site
|
|
|
|
|
Title Page i |
|
Page: i |
|
doi>10.1109/NCA.2008.1 |
|
Available formats:
Publisher Site
|
|
|
|
|
Title Page iii |
|
Page: iii |
|
doi>10.1109/NCA.2008.2 |
|
Available formats:
Publisher Site
|
|
|
|
|
Copyright Page |
|
Page: iv |
|
doi>10.1109/NCA.2008.3 |
|
Available formats:
Publisher Site
|
|
|
|
|
Message from the Program Committee |
|
Page: x |
|
doi>10.1109/NCA.2008.4 |
|
Available formats:
Publisher Site
|
|
|
|
|
External Reviewers |
|
Page: xv |
|
doi>10.1109/NCA.2008.7 |
|
Available formats:
Publisher Site
|
|
|
|
|
Sponsors |
|
Page: xvi |
|
doi>10.1109/NCA.2008.58 |
|
Available formats:
Publisher Site
|
|
|
|
|
Invited Keynotes |
|
Pages: xvii-xviii |
|
doi>10.1109/NCA.2008.59 |
|
Available formats:
Publisher Site
|
|
|
|
|
APART: Low Cost Active Replication for Multi-tier Data Acquisition Systems |
| |
Paolo Romano,
Diego Rughetti,
Francesco Quaglia,
Bruno Ciciani
|
|
Pages: 1-8 |
|
doi>10.1109/NCA.2008.52 |
|
Available formats:
Publisher Site
|
|
This paper proposes APART (A Posteriori Active ReplicaTion),a novel active replication protocol specifically tailored formulti-tier data acquisition systems.Unlike existing active replication solutions, APART does not rely ona-priori coordination schemes ...
This paper proposes APART (A Posteriori Active ReplicaTion),a novel active replication protocol specifically tailored formulti-tier data acquisition systems.Unlike existing active replication solutions, APART does not rely ona-priori coordination schemes determining a same schedule of eventsacross all the replicas, but it ensures replicas consistency by means ofan a-posteriori reconciliation phase. The latter istriggered only in case the replicated servers externalize theirstate by producing an output event towards a different tier.On one hand, this allows coping with non-deterministic replicas, unlikeexisting active replication approaches.%On the other hand, it allows attaining unparalled performance if replicas are often {\em silent}, i.e. if the average ratio between replicas' input and output messages is high.On the other hand, it allows attaining striking performance gainsin the case of silent replicated servers, which only sporadically, yetunpredictably, produce output events in response to the receipt of a(possibly large) volume of input messages. This is a common scenario indata acquisition systems, where sink processes, whichfilter and/or correlate incoming sensordata, produce output messages only if some application relevant event is detected.Further, the APART replica reconciliation scheme is extremely lightweight asit exploits the cross-tier communication pattern spontaneously induced bythe application logic to avoid explicit replicas coordination messages. expand
|
|
|
Quicksilver Scalable Multicast (QSM) |
| |
Krzysztof Ostrowski,
Ken Birman,
Danny Dolev
|
|
Pages: 9-18 |
|
doi>10.1109/NCA.2008.33 |
|
Available formats:
Publisher Site
|
|
QSM is a multicast engine designed to support a style of distributed programming in which application objects are replicated among clients and updated via multicast. The model requires platforms that scale in dimensions previously unexplored; in particular, ...
QSM is a multicast engine designed to support a style of distributed programming in which application objects are replicated among clients and updated via multicast. The model requires platforms that scale in dimensions previously unexplored; in particular, to large numbers of multicast groups. Prior systems we-ren’t optimized for such scenarios and can’t take ad-vantage of regular group overlap patterns, a key fea-ture of our application domain. Furthermore, little is known about performance and scalability of such sys-tems in modern managed environments. We shed light on these issues and offer architectural insights based on our experience building QSM. expand
|
|
|
FOSeL: Filtering by Helping an Overlay Security Layer to Mitigate DoS Attacks |
| |
Hakem Beitollahi,
Geert Deconinck
|
|
Pages: 19-28 |
|
doi>10.1109/NCA.2008.23 |
|
Available formats:
Publisher Site
|
|
Denial of service (DoS) attacks are major threat againstavailability in the Internet. A large number of countermea-sure techniques try to detect attack and then filter out DoSattack packets. Unfortunately these techniques that filterDoS traffic by looking ...
Denial of service (DoS) attacks are major threat againstavailability in the Internet. A large number of countermea-sure techniques try to detect attack and then filter out DoSattack packets. Unfortunately these techniques that filterDoS traffic by looking at known attack patterns or statisticalanomalies in the traffic patterns can be defeated by chang-ing the attack patterns and masking the anomalies that aresought by the filter. Hence, detecting DoS traffic is one ofthe main challenges for filtering techniques. Furthermoretechniques that drop any malicious packet need to processthe packet and processing is time-consuming.This paper addresses how an efficient and good filter canbe designed by helping an overlay network layer to mitigateDoS attacks. Fosel (Filtering by helping an Overlay Secu-rity Layer) filter is independent from DoS attack types, sowe do not worry about the changing attack patterns. Fur-thermore it reduces processing time noticeably.Through simulation this paper shows by employing Foselfilter, DoS attacks have a negligible chance to saturate thetarget by malicious packets. Our simulation demonstratesthat Fosel architecture reduces the probability of successfulattack to minuscule levels. Furthermore Fosel is between10% and 50% faster than SOS (Secure Overlay Services) architecture to drop malicious packets based on attackrate. expand
|
|
|
Execution Patterns in Automatic Malware and Human-Centric Attacks |
| |
Mohammed Gadelrab,
Anas Abou El Kalam,
Yves Deswarte
|
|
Pages: 29-36 |
|
doi>10.1109/NCA.2008.37 |
|
Available formats:
Publisher Site
|
|
With the massive surges of new malware, the intuitive detection techniques currently used in most security tools deem ineffective. Consequently, we urgently need better solutions that are established on solid theoretical basis. ...
With the massive surges of new malware, the intuitive detection techniques currently used in most security tools deem ineffective. Consequently, we urgently need better solutions that are established on solid theoretical basis. It becomes, thus, necessary to search for more efficient techniques and algorithms as well as taxonomies and models for attacks and malware. We present, in this paper, the analysis we made on both automatic malware and human-centric attacks, which allowed us to construct a model for attack process. The main objective of this work is to construct a model that can aide in the generation of real attack scenarios and use it in the evaluation of Intrusion Detection Systems. However, the model described here could have many other potential uses. For example, it can be used for writing “execution-based” signatures, event correlation, penetration testing, security simulations as well as security educations. expand
|
|
|
Finite Memory: A Vulnerability of Intrusion-Tolerant Systems |
| |
Giuliana Santos Veronese,
Miguel Correia,
Lau Cheuck Lung,
Paulo Verissimo
|
|
Pages: 37-44 |
|
doi>10.1109/NCA.2008.40 |
|
Available formats:
Publisher Site
|
|
In environments like the Internet, faults follow unusualpatterns, dictated by the combination of malicious attackswith accidental faults such as long communication delayscaused by temporary network partitions. In this scenario,attackers can force buffer ...
In environments like the Internet, faults follow unusualpatterns, dictated by the combination of malicious attackswith accidental faults such as long communication delayscaused by temporary network partitions. In this scenario,attackers can force buffer overflows in order to leave thesystem in an inconsistent state or to prevent it from doingprogress, causing a denial of service. This paper is about theeffects that finite memory has on intrusion-tolerant protocolsand systems. We present the problem and propose a genericmitigation technique based on repair nodes that reduces thebuffer space requirements. An experimental evaluation of thebuffer usage with and without this technique is presented, allowingto assess in practice the effects of finite memory in areal, albeit simple, intrusion-tolerant system. expand
|
|
|
FaSReD: Fast and Scalable Resource Discovery in Support of Multiple Resource Range Requirements for Computational Grids |
| |
Denvil Smith,
Nian-Feng Tzeng,
Milad M. Ghantous
|
|
Pages: 45-51 |
|
doi>10.1109/NCA.2008.14 |
|
Available formats:
Publisher Site
|
|
Distributed Grid resource discovery (ReD) systems lack the ability to adapt efficiently to an increase in the number of attributes. The main contribution of this paper is a fast and scalable ReD mechanism, dubbed FaSReD, which composes a resource key ...
Distributed Grid resource discovery (ReD) systems lack the ability to adapt efficiently to an increase in the number of attributes. The main contribution of this paper is a fast and scalable ReD mechanism, dubbed FaSReD, which composes a resource key via bit string encoding. We establish close-to-optimal FaSReD and a lower bound on the mean number of search hops under FaSReD. Through extensive simulation, our ReD is demonstrated to accommodate effectively an increase in the number of attributes with respect to such performance metrics as overlay hops, total messages, mean query response time, and throughput. FaSReD is further shown to outperform the leading prior distributed ReD range query schemes. expand
|
|
|
A Fast and Robust Content-based Publish/Subscribe Architecture |
| |
Hojjat Jafarpour,
Sharad Mehrotra,
Nalini Venkatasubramanian
|
|
Pages: 52-59 |
|
doi>10.1109/NCA.2008.51 |
|
Available formats:
Publisher Site
|
|
We present cluster-based publish/subscribe, a novel architecture that is not only resilient to event broker failures but also provides load balancing and fast event dissemination service. Our proposed approach achieves fault tolerance by organizing event ...
We present cluster-based publish/subscribe, a novel architecture that is not only resilient to event broker failures but also provides load balancing and fast event dissemination service. Our proposed approach achieves fault tolerance by organizing event brokers in clusters. Multiple inter-cluster links provide continuous availability of dissemination service in presence of broker failure without requiring subscription retransmission or reconstruction of broker overlay. Furthermore, the proposed architecture provides a fast event dissemination infrastructure that significantly reduces subscription and publication dissemination traffic and load on event brokers. Our experimental results show that even in the presence of failures in broker network, event dissemination is not interrupted and dissemination speed and load are significantly improved compared to the existing approached. expand
|
|
|
Network Planning Optimization for Multimedia Networks |
| |
Priscila Solis Barreto,
Paulo H. P. de Carvalho
|
|
Pages: 60-67 |
|
doi>10.1109/NCA.2008.30 |
|
Available formats:
Publisher Site
|
|
This work presents a planning methodology for multimedia networks based on a hybrid traffic model and an evolutionary optimization procedure. The methodology intends to optimize the sizing of network elements to comply with two QoS simultaneous network ...
This work presents a planning methodology for multimedia networks based on a hybrid traffic model and an evolutionary optimization procedure. The methodology intends to optimize the sizing of network elements to comply with two QoS simultaneous network parameters as well as to promote network stability and cost efficiency. The hybrid traffic model deals with the multimedia network traffic as a combination of fBm (fractional Brownian motion) and Markovian process. Also, the model considers the links loads and variance coefficients to produce more accurate Qos metrics values for network delay and packet loss probability. The traffic model characterization accuracy was evaluated with an optimization procedure that sizes network elements to fulfill performance and cost requirements. The simulation’s results show that the methodology may have a practical use for sizing network elements and promoting stability. expand
|
|
|
User Profile-Based Authorization Policies for Network QoS Services |
| |
Julio Cesar Royer,
Roberto Willrich,
Michel Diaz
|
|
Pages: 68-75 |
|
doi>10.1109/NCA.2008.39 |
|
Available formats:
Publisher Site
|
|
Recent papers propose QoS solutions allowing the users to explicitly specify the quality level they request during a so-called explicit QoS service invocation that includes dynamic QoS offering and new mechanisms for authentication, authorization and ...
Recent papers propose QoS solutions allowing the users to explicitly specify the quality level they request during a so-called explicit QoS service invocation that includes dynamic QoS offering and new mechanisms for authentication, authorization and accounting. In particular, organizations should be able to control their network services and authorize QoS services based on service parameters, as destination addresses, applications and employees’ roles. Therefore, user profile-based authorization policies for explicit QoS service invocations should be adopted. Each user profile indicates the services that the user is authorized to request, their consumption limits and scope. This paper deals with the authorization of explicit QoS services invocations and proposes a user profile model for profile-based authorization of QoS services. expand
|
|
|
Multicoordinated Agreement Protocols for Higher Availabilty |
| |
Lásaro Jonas Camargos,
Rodrigo Malta Schmidt,
Fernando Pedone
|
|
Pages: 76-84 |
|
doi>10.1109/NCA.2008.28 |
|
Available formats:
Publisher Site
|
|
Adaptability and graceful degradation are important features in distributed systems. Yet, consensus and other agreement protocols, basic building blocks of reliable distributed systems, lack these features and must perform expensive reconfiguration even ...
Adaptability and graceful degradation are important features in distributed systems. Yet, consensus and other agreement protocols, basic building blocks of reliable distributed systems, lack these features and must perform expensive reconfiguration even in face of single failures. In this paper we describe multicoordinated mode of execution for agreement protocols that has improved availability and tolerates failures in a graceful manner. We exemplify our approach by presenting a Generic Broadcast algorithm. Our protocol can adapt to environment changes by switching to different execution modes. Finally, we show how our algorithm can solve the Generalized Consensus and its many instances (e.g., consensus and atomic broadcast). expand
|
|
|
A New Minimum Density RAID-6 Code with a Word Size of Eight |
| |
James S. Plank
|
|
Pages: 85-92 |
|
doi>10.1109/NCA.2008.29 |
|
Available formats:
Publisher Site
|
|
RAID-6 storage systems protect k disks of data with twoparity disks so that the system of k+2 disks may toleratethe failure of any two disks. Coding techniques for RAID-6systems are varied, but an important class of techniquesare those with minimum density, ...
RAID-6 storage systems protect k disks of data with twoparity disks so that the system of k+2 disks may toleratethe failure of any two disks. Coding techniques for RAID-6systems are varied, but an important class of techniquesare those with minimum density, featuring an optimalcombination of encoding, decoding and modificationcomplexity. The word size of a code impacts both how thecode is laid out on each disk's sectors and how large k canbe. Word sizes which are powers of two are especiallyimportant, since they fit precisely into file systemblocks. Minimum density codes exist for many word sizeswith the notable exception of eight. This paper fills thatgap by describing new codes for this important word size.The description includes performance properties as well asdetails of the discovery process. expand
|
|
|
Generalizing RDP Codes Using the Combinatorial Method |
| |
Wang Gang,
Liu Xiaoguang,
Lin Sheng,
Xie Guangjun,
Liu Jing
|
|
Pages: 93-100 |
|
doi>10.1109/NCA.2008.27 |
|
Available formats:
Publisher Site
|
|
In this paper, we present PDHLatin - a new class of 2-erasure horizontal codes with dependent parity symbols based on column-hamiltonian Latin squares (CHLS). We prove that PDHLatin codes are MDS codes. We also present a new class of 2-erasure parity ...
In this paper, we present PDHLatin - a new class of 2-erasure horizontal codes with dependent parity symbols based on column-hamiltonian Latin squares (CHLS). We prove that PDHLatin codes are MDS codes. We also present a new class of 2-erasure parity independent mixed codes based on CHLS - PIMLatin. We show that the performance of the new codes is comparable to or better than other codes of this kind. They have perfect parameter flexibility and structure variety that benefit performance. We also discuss code shortening technologies that can improve parameter flexibility, structure variety and reliability. Borrowing ideas from vertical shortening, we develop a 2-erasure array code construction method using non-hamiltonian Latin squares. expand
|
|
|
Flexible Parameterization of XOR based Codes for Distributed Storage |
| |
Peter Sobe,
Kathrin Peter
|
|
Pages: 101-110 |
|
doi>10.1109/NCA.2008.45 |
|
Available formats:
Publisher Site
|
|
Distributed storage systems apply erasure-tolerant codes to guaranteereliable access to data despite failures of storage resources.While many codes can be mapped to XOR operations andefficiently implemented on common microprocessors, only a certainnumber ...
Distributed storage systems apply erasure-tolerant codes to guaranteereliable access to data despite failures of storage resources.While many codes can be mapped to XOR operations andefficiently implemented on common microprocessors, only a certainnumber of codes are usually implemented in a certain system(out of a wide variety of different codes).The ability to include new codes easily, to exchange codes and finally to select codesfor several types of data is desirable.To provide this flexibility, a parameterization is used which allows thedefinition of different XOR based codes, and beyond different styles of en- anddecoding. The parameters include (i) the assignment of data and redundancyelements to the storage resources and (ii) a description of en- and decodingalgorithms with XOR based equations.The parameters of a certain code can be changed and in additiona wide variety of codes can be described and included in a storage systemimplementation. The proposed parameterization adopts the ability of codeslike EVENODD, Cauchy-R/S and HoVer codes to map to distributed resources.Furthermore, en- and decoding algorithms can be described differently,either for minimal coding costor for minimal coding time on parallel systems. expand
|
|
|
Supporting Concurrent Task Deployment Wireless Sensor Networks |
| |
Song Guo,
Chunxia Fan,
T. D. C. Little
|
|
Pages: 111-118 |
|
doi>10.1109/NCA.2008.42 |
|
Available formats:
Publisher Site
|
|
Deploying large-scale sensor networks involves the programming of many devices based on a desired mission. Techniques for reprogramming devices in situ have been investigated to mitigate the effort required when program updates are required or when the ...
Deploying large-scale sensor networks involves the programming of many devices based on a desired mission. Techniques for reprogramming devices in situ have been investigated to mitigate the effort required when program updates are required or when the mission of the system changes. We consider a technique that is intended to support multiple concurrent missions by the system by exploiting available resources of the sensor network. In essence, our model is based on a tasking scheme, a common framework for the interchange and instantiation of tasks on multiple devices, and the use of attributes defining the resources in the system. A prototype system has been implemented to demonstrate and validate the concepts using the Imote2, a 32-bit mote architecture that has been configured with embedded Linux enabled with Java. Several applications have been rendered as tasks that are injected into a multi-node sensor network. Results demonstrate the support of concurrent overlaid applications in the system permitting task injection, maintenance, and termination. Performance evaluation of the scheme indicates benefits over an epidemic model of code dissemination. expand
|
|
|
Failure, Disconnection and Partition Detection in Mobile Environment |
| |
Denis Conan,
Pierre Sens,
Luciana Arantes,
Mathieu Bouillaguet
|
|
Pages: 119-127 |
|
doi>10.1109/NCA.2008.18 |
|
Available formats:
Publisher Site
|
|
In mobile environment, nodes can move around and voluntarily leave or join the network. Furthermore, they can crash or be disconnected from the network due to the absence of network signals. Therefore, failure, disconnection and mobility may create partitions ...
In mobile environment, nodes can move around and voluntarily leave or join the network. Furthermore, they can crash or be disconnected from the network due to the absence of network signals. Therefore, failure, disconnection and mobility may create partitions in wireless networks which should be detected for fault and disconnection tolerance reasons.We present in this article an architecture of local and distributed detectors for mobile networks that detect failures, disconnections, and partitions. It is basically composed of three unreliable detectors: a heartbeat failure detector, a vector-based disconnection detector, and an eventually perfect partition detector. expand
|
|
|
Cross-Layer Architecture for Differentiated Services in Ad Hoc Networks |
| |
Maria Fazio,
Maurizio Paone,
Dario Bruneo,
Antonio Puliafito
|
|
Pages: 128-135 |
|
doi>10.1109/NCA.2008.56 |
|
Available formats:
Publisher Site
|
|
In the last few years, wireless ad hoc networks experienced a great diffusion thanks to their simple deployment everywhere and whenever needed. Already used for entertainment applications (e.g., instant messaging) or for specific domains (e.g., military) ...
In the last few years, wireless ad hoc networks experienced a great diffusion thanks to their simple deployment everywhere and whenever needed. Already used for entertainment applications (e.g., instant messaging) or for specific domains (e.g., military) we think such technology is mature enough to support also real-time services provision.Real time applications pose several challenges, in particular issues such as limited bandwidth, unreliable channels, topology evolutions and power consumption make Quality of Service (QoS) management a mandatory task to be addressed. In this paper, we propose a general QoS systemthat makes use of Differentiated Services strategies by exploiting the concept of virtual backbones. Our key ideais to use an auto-configured virtual backbone to set up aDifferentiated Service area in order to opportunely manageQoS flows. Also, thanks to a new distributed Call Admission Control algorithm, it avoids the arise of overloading situations. Performance measurements, based on simulative techniques and carried out to test the feasibility of theproposed system, are finally presented. expand
|
|
|
Dynamic Routing Selection for Wireless Sensor Networks |
| |
Wang Ke,
Thomas D. C. Little
|
|
Pages: 136-143 |
|
doi>10.1109/NCA.2008.43 |
|
Available formats:
Publisher Site
|
|
With the decrease in the cost and in the size of computing devices, wireless sensor networks (WSNET) have the potential of being composed by an extremely large number of nodes offering multiple services. Such networks have the capability of executing ...
With the decrease in the cost and in the size of computing devices, wireless sensor networks (WSNET) have the potential of being composed by an extremely large number of nodes offering multiple services. Such networks have the capability of executing multiple tasks concurrently by allocating simply a fraction of their resources. Alternatively, many smaller wireless networks may collaborate to execute a larger, unforeseen application. In both cases a routing scheme other than the prevailing one may improve the efficiency of the task or the application being executed, reducing the energy consumption in the network.We posit that to fully tap into the potential of such networks a new routing infrastructure is needed, one that allows switching between different routing schemes dynamically as required by the applications being deployed, the conditions of the network as a whole and the existing locality information. We show in this paper how dynamic routing scheme selection can be achieved when sensor networks are overlaid with a virtual attribute based cluster hierarchy. We present analytical results for our scheme and show the expected improvement that can be achieved. expand
|
|
|
Comparing Error Detection Techniques for Web Applications: An Experimental Study |
| |
Luis Moura Silva
|
|
Pages: 144-151 |
|
doi>10.1109/NCA.2008.57 |
|
Available formats:
Publisher Site
|
|
Web applications are highly sensitive to the occurrence of user-visible failures. Despite the usage of system-level monitoring tools there are still some application-level errors that escape to those tools and end up to be seen in the web pages of the ...
Web applications are highly sensitive to the occurrence of user-visible failures. Despite the usage of system-level monitoring tools there are still some application-level errors that escape to those tools and end up to be seen in the web pages of the final users. Complementary error detection mechanisms should then be used to overcome this problem.In this paper, we present an experimental study where we measured the effectiveness of four different error-detection mechanisms under different fault-load. For the effect we used two benchmarks (JPetstore and TPC-W) and a software fault-injector. The results show that although system-level monitoring tools are very effective in most of the cases, there are other detection mechanisms that present a better latency and coverage when dealing with errors at the application-level. Particularly, the usage of external monitoring schemes seems to be of utmost importance. expand
|
|
|
Fair-Queued Ethernet for Medical Applications |
| |
Stephan Pöhlsen,
Frank Franz,
Kai Kück,
Jörg-Uwe Meyer,
Christian Werner
|
|
Pages: 152-159 |
|
doi>10.1109/NCA.2008.19 |
|
Available formats:
Publisher Site
|
|
Ethernet is becoming an accepted standard for more and more medical applications. It is a best-effort network standard without any transmission guarantees. However, in medical applications real-time transmission guarantees are getting more and more important.In ...
Ethernet is becoming an accepted standard for more and more medical applications. It is a best-effort network standard without any transmission guarantees. However, in medical applications real-time transmission guarantees are getting more and more important.In this paper we discuss typical performance bottlenecks in medical networks and present an easy to implement solution to this problem. A fair-queued Ethernet switch with max-min fair scheduling is used to achieve transmission guarantees even in the presence of ill-behaved sources. This approach only replaces the switch hardware and thus works with unmodified hard- and software in end nodes. expand
|
|
|
Impact of Social Networking Services on the Performance and Scalability of Web Server Infrastructures |
| |
Claudia Canali,
José Daniel Garcia,
Riccardo Lancellotti
|
|
Pages: 160-167 |
|
doi>10.1109/NCA.2008.34 |
|
Available formats:
Publisher Site
|
|
The last generation of Web is characterized by social networking services where users exchange a growing amount of multimedia content. The impact of these novel services on the underlying Web infrastructures is significantly different from traditional ...
The last generation of Web is characterized by social networking services where users exchange a growing amount of multimedia content. The impact of these novel services on the underlying Web infrastructures is significantly different from traditional Web-based services and has not yet been widely studied.This paper presents a scalability and bottleneck analysis of a Web system supporting social networking services for different scenarios of user interaction patterns, amount of multimedia content and network characteristics.Our study demonstrates that for some social networking services the user interaction patterns may play a fundamental role in the definition of the bottleneck resource and must be considered in the design of systems supporting novel services. expand
|
|
|
Is the Popular R*-tree Suited for Packet Classification? |
| |
Christine Maindorfer,
Thomas Ottmann
|
|
Pages: 168-176 |
|
doi>10.1109/NCA.2008.20 |
|
Available formats:
Publisher Site
|
|
Packet classification enables network routers to provide advanced network services including network security, quality of service (QoS) routing, and multimedia communications. In order to classify a packet, network nodes must perform a search over a ...
Packet classification enables network routers to provide advanced network services including network security, quality of service (QoS) routing, and multimedia communications. In order to classify a packet, network nodes must perform a search over a set of filters using multiple fields of the packet as the search key. Viewing the classification problem geometrically, classifying an arriving packet is equivalent to finding the highest priority hyperrectangle among all hyperrectangles that contain the point representing the packet. The R-tree and its variants, being among the most popular access methods for points and rectangles, have not been experimentally evaluated and benchmarked for their eligibility for the packet classification problem. In this paper we investigate how the R*-tree, a dynamic index structure for spatial data, is suited for packet classification. To this end we will benchmark R* with two representative classification algorithms using the ClassBench tools suite. expand
|
|
|
A Linear Inter-Session Network Coding Scheme for Multicast |
| |
Min Yang,
Yuanyuan Yang
|
|
Pages: 177-184 |
|
doi>10.1109/NCA.2008.36 |
|
Available formats:
Publisher Site
|
|
Network coding is a promising generalization of routing which allows a network node to generate output messages by encoding its received messages to reduce the bandwidth consumption in the network. An important application where network coding offers ...
Network coding is a promising generalization of routing which allows a network node to generate output messages by encoding its received messages to reduce the bandwidth consumption in the network. An important application where network coding offers unique advantages is the multicast network where a source node generates messages and multiple receivers collect the messages. Previous network coding schemes primarily considered encoding the messages in a single multicast session. In this paper, we considerthe linear inter-session network coding for multicast. The basic idea is to divide the sessions into different groups and construct a linear network coding scheme for each group. To maximize the performance, we introduce two metrics: overlap ratio and overlap width, to measure the benefit that a system can achieve by inter-session network coding. The overlap ratio mainly characterizes the network bandwidth while the overlap width characterizes the system throughput. Our simulation results show that the proposed inter-session network coding scheme can achieve about 30%$ higher throughput than intra-session network coding. expand
|
|
|
Application-Layer Packet Processing through Ethereal Memory |
| |
Fong Pong,
Nian-Feng Tzeng
|
|
Pages: 185-194 |
|
doi>10.1109/NCA.2008.32 |
|
Available formats:
Publisher Site
|
|
This work deals with an architectural framework to enable application-layer packet processing for lowered processing latency and enhanced throughput. Creating an “Ethereal memory” shared by application programs and network interface drivers, ...
This work deals with an architectural framework to enable application-layer packet processing for lowered processing latency and enhanced throughput. Creating an “Ethereal memory” shared by application programs and network interface drivers, the proposed framework realizes application-layer packet processing through Ethereal memory (APPEAL). Unlike earlier solutions based on network processors or field programmable gate arrays, APPEAL supports packet processing software execution in regular OS environments (like Linux) on general-purpose multi-core processors (like Intel® Core 2 Extreme and Broadcom BCM 1480 SoC products). It facilitates fast packet processing code development and lets applications have direct accesses to data contained in Ethereal memory, totally eliminating the need of packet copies between user space and kernel space and of system calls. Without kernel overhead during application layer packet processing, APPEAL is shown by our empirical results obtained from a hardware platform comprising three BCM 1480 SoC’s, to enjoy far smaller latency (dropped by as much as 58%) and to more than double throughput, when carrying out network address and port translation. expand
|
|
|
On the Application of Formal Methods for Specifying and Verifying Distributed Protocols |
| |
Marina Gelastou,
Chryssis Georgiou,
Anna Philippou
|
|
Pages: 195-204 |
|
doi>10.1109/NCA.2008.24 |
|
Available formats:
Publisher Site
|
|
In this paper we consider the frameworks of Process Algebra and I/O Automata and we apply both towards the verification of a distributed leader-election protocol. Based on the two experiences we evaluate the approaches and draw initial conclusions with ...
In this paper we consider the frameworks of Process Algebra and I/O Automata and we apply both towards the verification of a distributed leader-election protocol. Based on the two experiences we evaluate the approaches and draw initial conclusions with respect to their relativecapabilities, strengths and usability.To the best of our knowledge, this is the first hands-on evaluation of the two models, and we view it as the cornerstone for a wider investigation of the strengths and weaknesses of the two methodologies in specifying and verifying (distributed) protocols. expand
|
|
|
Approaching the Limits of FlexRay |
| |
Christoph Heller,
Josef Schalk,
Stefan Schneele,
Reinhard Reichel
|
|
Pages: 205-210 |
|
doi>10.1109/NCA.2008.25 |
|
Available formats:
Publisher Site
|
|
The aeronautic industry is strongly interested in utilizing the automotive FlexRay protocol. Economic benefits to be derived from the automotive mass market, and technological benefits arising from to the deterministic communication behavior are projected. ...
The aeronautic industry is strongly interested in utilizing the automotive FlexRay protocol. Economic benefits to be derived from the automotive mass market, and technological benefits arising from to the deterministic communication behavior are projected. The physical layer of the protocol is customized to suit automotive applications. The topology of aeronautic systems is more critical in terms of greater cable lengths and protection circuits. This paper therefore analyzes the suitability of topology implementations exceeding the recommendations defined in the FlexRay specification. This paper derives worstcase signal integrity criteria for FlexRay and applies them to an exemplary aeronautic topology with six nodes and an overall length of 90 m. The paper highlights the fact that reliable communication is conditionally possible on the topology at data rates up to 5 Mbit/s. expand
|
|
|
An Abstract Channel Specification and an Algorithm Implementing It Using Java Sockets |
| |
Chryssis Georgiou,
Peter M. Musial,
Alexander A. Shvartsman,
Elaine L. Sonderegger
|
|
Pages: 211-219 |
|
doi>10.1109/NCA.2008.12 |
|
Available formats:
Publisher Site
|
|
Abstract models and specifications can be used in the design of distributed applications to formally reason about their safety properties. However, the benefits of using formal methods are often negated by the ad hoc process of mapping the semantics ...
Abstract models and specifications can be used in the design of distributed applications to formally reason about their safety properties. However, the benefits of using formal methods are often negated by the ad hoc process of mapping the semantics of an abstract specification to algorithms designed to be executed on target distributed platforms. The challenge of formally specifying communication channels and correctly implementing them as algorithms that use realistic distributed system services is the focus of this paper. This work provides an original formal specification of an abstract asynchronous communication channel with support for dynamic creation and tear down of links between participating network nodes, and its implementation as an algorithm using Java sockets. The specification and the algorithm are expressed using the Input/Output Automata formalism, and it is proved that the algorithm correctly implements the specification, viz. that any externally observable behavior (trace) of the algorithm has a corresponding behavior of the specification. The approach presented here can be used to implement algorithms for dynamic systems, where communicating nodes may join, leave, and experience delays. The result is also of direct benefit to automated code generation, such as that implemented within the Input/Output Automata Toolkit at MIT. expand
|
|
|
Multilayered Video Multiple Trees Multicast Algorithms for Heterogeneous Wireless Ad Hoc Networks |
| |
Osamah Badarneh,
Michel Kadoch,
Ahmed ElHakeem
|
|
Pages: 220-223 |
|
doi>10.1109/NCA.2008.21 |
|
Available formats:
Publisher Site
|
|
In this paper, we address the issue of multilayered multicast routing in wireless ad hoc networks (WAHNs). Existing multilayered multicast protocols assume homogeneous ad hoc wireless networks; in which all nodes are of the same type (they have the same ...
In this paper, we address the issue of multilayered multicast routing in wireless ad hoc networks (WAHNs). Existing multilayered multicast protocols assume homogeneous ad hoc wireless networks; in which all nodes are of the same type (they have the same processing, data rate and communication capabilities and characteristics). A more realistic assumption is a heterogeneous network; in which nodes have different processing, communication capabilities and other characteristics. In this paper, we assume heterogeneous network; in which nodes have different capabilities. Two multilayered multicast routing algorithms are proposed, namely, Multiple Trees Based on Shortest Path Tree (MSPT) and Multiple Trees based on Steiner Minimum Tree (MSMT). We assume that each destination has a preference number of video layers; which is equal to its capacity. Moreover, we do not consider only the capacities of nodes in the network but also the bandwidth of each link. Simulations show that the proposed schemes greatly improve the QoS requirements (improve user satisfaction ratio (USR)) for a set of destinations. In addition, simulations show that multiple trees schemes achieve substantially higher satisfaction ratio than the single tree scheme. expand
|
|
|
An Improved Anti Collision Algorithm using Parity Bit in RFID System |
| |
SungSoo Kim,
YongHwan Kim,
SeongJoon Lee,
KwangSeon Ahn
|
|
Pages: 224-227 |
|
doi>10.1109/NCA.2008.9 |
|
Available formats:
Publisher Site
|
|
The RFID(Radio Frequency IDentification) is a technology that automatically identifies objects containing the electronic tags by using radio frequency. In RFID system, the reader needs the anti collision algorithm for fast identifying all of the tags ...
The RFID(Radio Frequency IDentification) is a technology that automatically identifies objects containing the electronic tags by using radio frequency. In RFID system, the reader needs the anti collision algorithm for fast identifying all of the tags in the interrogation zone. This paper proposes the tree based Anti Collision algorithm using Parity Bit(ACPB) to arbitrate the tag collision. The proposed algorithm identifies tags without checking all the bits in the tags. The reader uses the parity bit which is added to the tag IDs. If there are two collided bits in tags, then reader identify tags by the parity concept. The reader can identify two tags using ACPB algorithm. ACPB can reduce the number of the requests from the reader, thus it shortens the time of identifying all of the tags in the interrogation zone. expand
|
|
|
Feedback-controlled WLAN: Achieving Channel-Availability in Mesh Networks |
| |
Svilen Ivanov,
Edgar Nett,
André Herms,
Daniel Mahrenholz,
Stefan Schemmer
|
|
Pages: 228-231 |
|
doi>10.1109/NCA.2008.54 |
|
Available formats:
Publisher Site
|
|
Wireless mesh networks are a promising backbone-solution for applications in industrial automation. However, high availability of the communication channel is not inherently guaranteed because of environment-dynamics and unauthorized users congesting ...
Wireless mesh networks are a promising backbone-solution for applications in industrial automation. However, high availability of the communication channel is not inherently guaranteed because of environment-dynamics and unauthorized users congesting the medium. In this paper we propose a method to increase channel-availability. We use an automated coverage planning method with feedback from the environment to cope with environment-dynamics. Unauthorized users can be automatically localized: this eases their finding and elimination. Our experimental evaluation shows that the method estimates the actual network coverage with an accuracy of 10dB; users are located with 3.7m accuracy on average. The main improvement of the coverage planning and localization methods is the achieved autonomy in dynamic environments. Therefore channel-availability also increases. expand
|
|
|
Police Security Communication over Public Cellular Network Infrastructure |
| |
Rongyu He,
Chaowen Chang,
Guolei Zhao,
Zheng Qin,
Xi Qin
|
|
Pages: 232-235 |
|
doi>10.1109/NCA.2008.26 |
|
Available formats:
Publisher Site
|
|
The availability of a communication channel that could be everywhere accessible, possibly via wireless devices is a constant matter for the police force. The well-developed public cellular network infrastructure and widespread mobile device can provide ...
The availability of a communication channel that could be everywhere accessible, possibly via wireless devices is a constant matter for the police force. The well-developed public cellular network infrastructure and widespread mobile device can provide with such features, but the lack of security makes it unsuitable for transmitting confidential data. In this paper, we propose a security framework for mobile police information system to transmit sensitive information confidentially over the public cellular network, and describe the authentication and communication protocol in detail. The test on a physical GSM based cellular network reveals that it is suitable for actual needs both in speed and security. expand
|
|
|
Analysis of Delay Time Distributions in Multistage Interconnection Networks Considering Multicast Traffic |
| |
Marcus Brenner,
Armin Zimmermann
|
|
Pages: 236-239 |
|
doi>10.1109/NCA.2008.35 |
|
Available formats:
Publisher Site
|
|
Multistage interconnection networks (Banyan networks) are proposed as connections in multiprocessor systems and in high-bandwidth network switches. In order to achieve suitable solutions when designing such networks to fit a given task, performance evaluation ...
Multistage interconnection networks (Banyan networks) are proposed as connections in multiprocessor systems and in high-bandwidth network switches. In order to achieve suitable solutions when designing such networks to fit a given task, performance evaluation plays a crucial part. This paper presents an approximative analytical modeling approach that offers a performance measure (in addition to mean throughputs and delay times) that is considered important in real-time communications scenarios: distribution of delay times, for which no analytically tractable exact method exists. expand
|
|
|
Supporting Cache Coherence in Mobile Cooperative Systems |
| |
Carla Diacui Medeiros Berkenbrock,
Celso Massaki Hirata
|
|
Pages: 240-243 |
|
doi>10.1109/NCA.2008.11 |
|
Available formats:
Publisher Site
|
|
Efficient cache coherence strategies are critical to maintain data consistency and provide a reasonable performance of wireless applications with mobile devices. However, the majority of the current strategies for cache coherence in mobile environments ...
Efficient cache coherence strategies are critical to maintain data consistency and provide a reasonable performance of wireless applications with mobile devices. However, the majority of the current strategies for cache coherence in mobile environments have not been designed to be used in cooperative applications. In this paper we propose and describe an implementation of a cache coherence scheme for mobile cooperative work. The scheme is based on periodic broadcast of invalidation reports and provides some aspects of awareness information. The implementation is made through the development of a prototype cooperative application. expand
|
|
|
Experiments of Large File Caching and Comparisons of Caching Algorithms |
| |
Brad Whitehead,
Chung-Horng Lung,
Amogelang Tapela,
Gopinath Sivarajah
|
|
Pages: 244-248 |
|
doi>10.1109/NCA.2008.44 |
|
Available formats:
Publisher Site
|
|
File sizes have grown tremendously over the past years for music/video applications and the trend is still growing. As a result, large ISPs are facing increasing demand for bandwidth from the growth of file sizes. A main contribution to this bandwidth ...
File sizes have grown tremendously over the past years for music/video applications and the trend is still growing. As a result, large ISPs are facing increasing demand for bandwidth from the growth of file sizes. A main contribution to this bandwidth demand problem is inefficient use of bandwidth due to many ISP customers downloading the same large files multiple times. This paper first reports real experiments conducted on Carleton’s Internet backbone by using the large file caching technique. Various cache replacement algorithms are then simulated and compared using traces of large file transfers. The results reveal that least recently used (LRU) performs better than others. expand
|
|
|
Improving Efficiency and Performance of Distributed File-Systems |
| |
Micah Galizia,
Hanan Lutfiyya
|
|
Pages: 249-252 |
|
doi>10.1109/NCA.2008.55 |
|
Available formats:
Publisher Site
|
|
This paper presents a distributed file-system for the present day medium-sized network. Existing servers and workstations pool their unused storage resources to form a communal share. Erasure codes provide fault tolerance and eliminate the need for replication. ...
This paper presents a distributed file-system for the present day medium-sized network. Existing servers and workstations pool their unused storage resources to form a communal share. Erasure codes provide fault tolerance and eliminate the need for replication. Middleware libraries facilitate object routing on an overlay network. expand
|
|
|
Persistent Logical Synchrony |
| |
Francesc D. Muñoz-Escoí,
Rubén de Juan-Marín,
J. Enrique Armendáriz-Íñigo,
José Ramón González de Mendívil
|
|
Pages: 253-258 |
|
doi>10.1109/NCA.2008.15 |
|
Available formats:
Publisher Site
|
|
The virtually synchronous execution model provides anappropriate support for developing reliable applications when the crash failure model is being assumed. Using it, group broadcasts only need to be based on asynchronous communication. Synchronization ...
The virtually synchronous execution model provides anappropriate support for developing reliable applications when the crash failure model is being assumed. Using it, group broadcasts only need to be based on asynchronous communication. Synchronization points are set when a view change arises, guaranteeing an efficient execution of such reliable applications. But a crash failure model is not always appropriate for all applications. Indeed, those using persistent or large state, like replicated databases, need a recoverable model. In such cases, the virtual synchrony property needs to be partially extended for adequately supporting more intricate recovery protocols. Persistent logical synchrony is one variation of this kind, that extends the synchronization actions to be taken when aview change arises, allowing a good support for partial recovery when the primary component membership is being assumed. expand
|
|
|
EPH: An Efficient and Robust Group Membership Topology for Distributed Systems |
| |
Ravi Madipadaga,
Sabishaw Bhaskaran,
Saikat Mukherjee
|
|
Pages: 259-262 |
|
doi>10.1109/NCA.2008.53 |
|
Available formats:
Publisher Site
|
|
Group membership protocols in distributed systems enable entities in a group to be aware of all other entities in the group. This information is essential for the system to perform as a cohesive unit collaborating to achieve a common objective. In dynamic ...
Group membership protocols in distributed systems enable entities in a group to be aware of all other entities in the group. This information is essential for the system to perform as a cohesive unit collaborating to achieve a common objective. In dynamic environments where devices join and leave the group frequently and failures occur, maintaining consistent group membership information efficiently is a non-trivial problem. We evaluate different logical topologies used to represent distributed systems and propose a group membership topology, extended polygonal hubs (EPH) which provides, 1) faster view convergence times and 2) better robustness characteristics compared to traditional hierarchical trees. expand
|
|
|
Supporting Linearizable Semantics in Replicated Databases |
| |
Luis Rodrigues,
Nuno Carvalho,
Emili Miedes
|
|
Pages: 263-266 |
|
doi>10.1109/NCA.2008.22 |
|
Available formats:
Publisher Site
|
|
This paper proposes a novel database replication algorithm that offers strong consistency (linearizable semantics) and allows reads and non-conflicting writes to execute in parallel in multiple replicas. The proposed algorithm supports the use of quorums ...
This paper proposes a novel database replication algorithm that offers strong consistency (linearizable semantics) and allows reads and non-conflicting writes to execute in parallel in multiple replicas. The proposed algorithm supports the use of quorums to trade the availability/efficiency of read and write operations, making a bridge between consensus-based and quorum based solutions for database replication. Furthermore, the algorithm offers better performance for linearizable read-only transactions with a negligible impact on write transactions. expand
|
|
|
Randomized Work-Competitive Scheduling for Cooperative Computing on k-partite Task Graphs |
| |
Chadi Kari,
Alexander Russell,
Narasimha Shashidhar
|
|
Pages: 267-270 |
|
doi>10.1109/NCA.2008.46 |
|
Available formats:
Publisher Site
|
|
A fundamental problem in distributed computing is the task of cooperatively executing a given set of t tasks by pprocessors where the communication medium is dynamic and subject to failures. The dynamics of the communicationmedium lead to groups of processors ...
A fundamental problem in distributed computing is the task of cooperatively executing a given set of t tasks by pprocessors where the communication medium is dynamic and subject to failures. The dynamics of the communicationmedium lead to groups of processors being disconnected and possibly reconnected during the entire course of thecomputation. The primary objective in this scenario is for the group of p processors to compute all the t tasks whileminimizing the total work done. In the partitionable network paradigm, work is defined as the total numberof tasks performed (counting multiplicities) by all the processors during the course of the computation. In prior work (Work-competitive scheduling for cooperative computingwith dynamic groups. In SIAM Journal on Computing: Volume 34, Issue 4, pages 848–862, 2005.), the authors have studied such a partitionable network scenario and analyze a simple randomized scheduling algorithm for the case where the tasks to be completed are independent of each other. In this paper, we study a natural generalization of this problem where the tasks have dependencies among them defined by a task dependency graph. In particular, we consider task dependency graphs that are k-partite task graphs. Such task dependency graphs have been studied extensively in performing dependency analysis of PRAM algorithms. Specifically, we present a simple randomized algorithm for p processors cooperating to perform t known tasks where the dependencies between them are defined by a k-partite task dependency graph and additionally these processors are subject to a dynamic communication medium. By virtue of the problem setting, we pursue competitive analysis where the performance of our algorithm is measured against that of the omniscient offline algorithm which has complete knowledge of the dynamics of the communication medium. We present a randomized algorithm whose competitive ratio is dependent on the dynamics of the communication medium and also on the nature of the dependencies among the t tasks characterized by the task graph. expand
|
|
|
Learning Minimum Delay Paths in Service Overlay Networks |
| |
Hong Li,
Lorne Mason,
Michael Rabbat
|
|
Pages: 271-274 |
|
doi>10.1109/NCA.2008.48 |
|
Available formats:
Publisher Site
|
|
We propose a novel approach using active probingand learning techniques to track minimum delay pathsfor real-time applications in service overlay networks.Stochastic automata are used to probe paths in a decentralized,scalable manner. We propose four ...
We propose a novel approach using active probingand learning techniques to track minimum delay pathsfor real-time applications in service overlay networks.Stochastic automata are used to probe paths in a decentralized,scalable manner. We propose four variationson active probing and learning strategies. It canbe proved that our approach converges to the user equilibriumfor minimum delay routing. The performanceof these strategies is studied via fluid simulations of amodel of AT&Ts backbone network. The simulation resultsshow that the proposed strategies converge to theminimum delay paths rapidly. We also observe, via simulation,that our approach scales well in the size of theservice overlay network. expand
|
|
|
Discovering New Trends in Web Robot Traffic Through Functional Classification |
| |
Derek Doran,
Swapna S. Gokhale
|
|
Pages: 275-278 |
|
doi>10.1109/NCA.2008.47 |
|
Available formats:
Publisher Site
|
|
This paper proposes a novel functional classification scheme to understand and analyze web robot traffic. The scheme is rooted in the recognition that the crawling behavior of a robot on a site is primarily governed byits intended purpose or functionality. ...
This paper proposes a novel functional classification scheme to understand and analyze web robot traffic. The scheme is rooted in the recognition that the crawling behavior of a robot on a site is primarily governed byits intended purpose or functionality. We apply the classification rules to analyze web server access logs from the University of Connecticut School of Engineering domain. The analysis results indicate how the classification scheme can provide insights into the robot traffic based on their functionality. expand
|
|
|
Effect of Parallel TCP Stream Equalizer on Real Long Fat-pipe Network |
| |
Yutaka Sugawara,
Takeshi Yoshino,
Hiroshi Tezuka,
Mary Inaba,
Kei Hiraki
|
|
Pages: 279-282 |
|
doi>10.1109/NCA.2008.50 |
|
Available formats:
Publisher Site
|
|
With the rapid progress of high-performance cluster applications, data transfer between clusters in distant locations becomes more important.But, it is difficult to transfer data using parallel TCP streams on long distance high bandwidth network. In ...
With the rapid progress of high-performance cluster applications, data transfer between clusters in distant locations becomes more important.But, it is difficult to transfer data using parallel TCP streams on long distance high bandwidth network. In this paper, we microscopically observe parallel TCP streams on 10Gbps network using our network analyzer, propose, implement, and evaluate ``Stream Equalizer'' which relaxes self-congestion and balances throughput among streams.We evaluate it using a real wide-area network over the Pacific Ocean.The network analyzer and the Stream Equalizer are implemented on FPGA-based programmable high-speed network testbed TGNLE-1. expand
|
|
|
Sorting Based Data Centric Storage |
| |
Fenghui Zhang,
Anxiao (Andrew) Jiang,
Jianer Chen
|
|
Pages: 283-286 |
|
doi>10.1109/NCA.2008.16 |
|
Available formats:
Publisher Site
|
|
Data-centric storage, which supports efficient in-network data query and processing, is an important concept for sensor networks. Previous approaches mostly use hash functions to store data, where data with the same key valueare stored in sensors at ...
Data-centric storage, which supports efficient in-network data query and processing, is an important concept for sensor networks. Previous approaches mostly use hash functions to store data, where data with the same key valueare stored in sensors at or near the same geographic location.We propose a new data-centric storage method based on sorting. Our method is robust for different network models and works for unlocalized homogeneous sensor networks, i.e., it requires no location information. The idea is to sort the data in the network based on their key values, so that queries -- including range queries -- can be easily answered. The sorting method balances the storage load well. We present a sorting algorithm that is both decentralized and efficient. expand
|
|
|
A New Recovery Escalation Algorithm with Load Balancing and Backup Resources Sharing in Path Protected WDM Optical Networks |
| |
Xiaobing Zheng,
Lei Guo,
Xingwei Wang,
Yu Zhang,
Xuekui Wang
|
|
Pages: 287-290 |
|
doi>10.1109/NCA.2008.17 |
|
Available formats:
Publisher Site
|
|
This paper proposes a new survivable algorithm, Enhanced Shared-Path Protection (ESPP), to tolerate multi-link failures in WDM optical networks. In ESPP, we consider the load balancing to reduce the blocking probability, use resources sharing to save ...
This paper proposes a new survivable algorithm, Enhanced Shared-Path Protection (ESPP), to tolerate multi-link failures in WDM optical networks. In ESPP, we consider the load balancing to reduce the blocking probability, use resources sharing to save backup resources, and perform recovery escalation to carry the affected traffic. Compared with the conventional algorithm, ESPP has better resource utilization ratio, lower blocking probability and higher protection ability. Simulation results are shown to be promising. expand
|
|
|
Identifying Failures in Grids through Monitoring and Ranking |
| |
Demetrios Zeinalipour-Yazti,
Kyriacos Neocleous,
Chryssis Georgiou,
Marios D. Dikaiakos
|
|
Pages: 291-298 |
|
doi>10.1109/NCA.2008.10 |
|
Available formats:
Publisher Site
|
|
In this paper we present FailRank, a novel framework for integrating and ranking information sources that characterize failures in a grid system. After the failing sites have been ranked, these can be eliminated from the job scheduling resource pool ...
In this paper we present FailRank, a novel framework for integrating and ranking information sources that characterize failures in a grid system. After the failing sites have been ranked, these can be eliminated from the job scheduling resource pool yielding in that way a more predictable, dependable and adaptive infrastructure. We also present the tools we developed towards evaluating the FailRank framework. In particular, we present the FailBase Repository which is a 38GB corpus of state information that characterizes the EGEE Grid for one month in 2007. Such a corpus paves the way for the community to systematically uncover new, previously unknown patterns and rules between the multitudes of parameters that can contribute to failures in a Grid environment. Additionally, we present an experimental evaluation study of the FailRank system over 30 days which shows that our framework identifies failures in 93% of the cases. We believe that our work constitutes another important step towards realizing adaptive Grid computing systems. expand
|
|
|
Adaptive Checkpoint Replication for Supporting the Fault Tolerance of Applications in the Grid |
| |
Andre Luckow,
Bettina Schnor
|
|
Pages: 299-306 |
|
doi>10.1109/NCA.2008.38 |
|
Available formats:
Publisher Site
|
|
A major challenge in a dynamic Grid with thousands of machines connected toeach other is fault tolerance. The more resources and components involved, themore complicated and error-prone becomes the system. Migol is an adaptive Grid middleware,which addresses ...
A major challenge in a dynamic Grid with thousands of machines connected toeach other is fault tolerance. The more resources and components involved, themore complicated and error-prone becomes the system. Migol is an adaptive Grid middleware,which addresses the fault tolerance of Grid applications and services by providing the capability to recover applications from checkpoint files automatically. A critical aspect for an automatic recovery is the availability of checkpoint files: If a resource becomes unavailable, it is very likely that the associated storage is also unreachable, e. g. due to a network partition. A strategy to increase the availability of checkpoints isreplication.In this paper, we present the Checkpoint Replication Service. A key feature of this service is the ability to automatically replicate and monitor checkpoints in the Grid. expand
|
|
|
Autonomic Share Allocation and Bounded Prediction of Response Times in Parallel Job Scheduling for Grids |
| |
Angela Sodan
|
|
Pages: 307-314 |
|
doi>10.1109/NCA.2008.49 |
|
Available formats:
Publisher Site
|
|
Grid schedulers which need to decide on which sites the jobs are best allocated require controlled and predictable service. Fair-share scheduling has become widely used but lacks a formal model and depends on the current machine load. Existing approaches ...
Grid schedulers which need to decide on which sites the jobs are best allocated require controlled and predictable service. Fair-share scheduling has become widely used but lacks a formal model and depends on the current machine load. Existing approaches for response-time prediction still show significant prediction errors, mostly due to problems in dynamic arrival of jobs with potentially higher priority and hard-to-anticipate packing and backfilling effects. Thus, we propose a different job scheduler (Scojo-PECT) which provides a more suitable framework for predictability and service guarantees by employing preemption with coarse-grain time sharing. We formalize the approach via a queuing model to determine the resource shares necessary to meet target service levels. As further extension, Scojo-PECT can adapt resource shares within certain limits to variations in machine load, while maintaining predictability and service guarantees. We demonstrate the feasibility of service control, the tightness of the 95% prediction intervals (0-30% from average), and the high predictability obtained. expand
|
|
|
Designing Mechanisms for Reliable Internet-based Computing |
| |
Antonio Fernandez Anta,
Chryssis Georgiou,
Miguel A. Mosteiro
|
|
Pages: 315-324 |
|
doi>10.1109/NCA.2008.41 |
|
Available formats:
Publisher Site
|
|
In this work, using a game-theoretic approach, cost-sensitive mechanisms that lead to reliable Internet-based computing are designed. In particular, we consider Internet-based master-worker computations, where a master processor assigns, across the Internet, ...
In this work, using a game-theoretic approach, cost-sensitive mechanisms that lead to reliable Internet-based computing are designed. In particular, we consider Internet-based master-worker computations, where a master processor assigns, across the Internet, a computational task to a set of potentially untrusted worker processors and collects their responses. Several game-theoretic models that capture the nature of the problem are analyzed and mechanisms that, for each given set of cost and system parameters, achieve high reliability are designed. Additionally, two specific realistic system scenarios are studied. These scenarios are a system of volunteering computing like SETI, and a company that buys computing cycles from Internet computers and sells them to its customers in the form of a task-computation service. Notably, under certain conditions, non redundant allocation yields the best trade-off between cost and reliability. expand
|
|
|
Detecting Selective Forwarding Attacks in Wireless Sensor Networks Using Two-hops Neighbor Knowledge |
| |
Tran Hoang Hai,
Eui-Nam Huh
|
|
Pages: 325-331 |
|
doi>10.1109/NCA.2008.13 |
|
Available formats:
Publisher Site
|
|
Wireless sensor networks have many potential applications for both civil and military tasks. However, WSNs are susceptible to many types of attacks because they are deployed in open and unprotected environment. Selective forwarding attack is one of the ...
Wireless sensor networks have many potential applications for both civil and military tasks. However, WSNs are susceptible to many types of attacks because they are deployed in open and unprotected environment. Selective forwarding attack is one of the easiest implement and damaged attacks in multi-hop routing protocols. In this paper, we proposed a lightweight detection algorithm based only on the neighborhood information. Our detection algorithm can detect selective forwarding attack with high accuracy and little overhead imposed on detection modules than previous works. expand
|
|
|
Secure Data Collection Scheme in Wireless Sensor Network with Mobile Sink |
| |
Amar Rasheed,
Rabi Mahapatra
|
|
Pages: 332-340 |
|
doi>10.1109/NCA.2008.31 |
|
Available formats:
Publisher Site
|
|
Wireless sensor networks that use a mobile sink to collect sensor data along a predetermined path raise a new security challenge: without verifying the source of the data request message, the network will become vulnerable to attacks. We propose an efficient ...
Wireless sensor networks that use a mobile sink to collect sensor data along a predetermined path raise a new security challenge: without verifying the source of the data request message, the network will become vulnerable to attacks. We propose an efficient security scheme, which divides the sink’s data collection path into grids, sensors in each grid, uses secret keying in-formation and collision-resistant hash functions to authenticate the source of beacons. Through probabil-istic analysis and definitive simulation, the proposed scheme shows with 60% of the grids under wormhole attacks, the probability that a node reply to a malicious beacon is 0.1. expand
|
|
|
Author Index |
|
Pages: 341-343 |
|
doi>10.1109/NCA.2008.60 |
|
Available formats:
Publisher Site
|
|
|
|
|
Roster Page |
|
Page: 344 |
|
doi>10.1109/NCA.2008.61 |
|
Available formats:
Publisher Site
|
|
|