Statistical Analysis and Modeling of Jobs in a Grid Environment

The existence of good probabilistic models for the job arrival process and the delay components introduced at different stages of job processing in a Grid environment is important for the improved understanding of the Grid computing concept. In this study, we present a thorough analysis of the job arrival process in the EGEE infrastructure and of the time durations a job spends at different states in the EGEE environment. We define four delay components of the total job delay and model each component separately. We observe that the job inter-arrival times at the Grid level can be adequately modelled by a rounded exponential distribution, while the total job delay (from the time it is generated until the time it completes execution) is dominated by the computing element’s register and queuing times and the worker node’s execution times. Further, we evaluate the efficiency of the EGEE environment by comparing the job total delay performance with that of a hypothetical ideal super-cluster and conclude that we would obtain similar performance if we submitted the same workload to a super-cluster of size equal to 34% of the total average number of CPUs participating in the EGEE infrastructure. We also analyze the job inter-arrival times, the CE’s queuing times, the WN’s execution times, and the data sizes exchanged at the kallisto.hellasgrid.gr cluster, which is node in the EGEE infrastructure. In contrast to the Grid level, we find that at the cluster level the job arrival process exhibits self-similarity/long-range dependence. Finally, we propose simple and intuitive models for the job arrival process and the execution times at the cluster level.     

Context-based caching and routing for P2P web service discovery

In modern heterogeneous environments, such as mobile, pervasive and ad-hoc networks, architectures based on web services offer an attractive solution for effective communication and inter-operation. In such dynamic and rapidly evolving environments, efficient web service discovery is an important task. Usually this task is based on the input/output parameters or other functional attributes, however this does not guarantee the validity or successful utilization of retrieved web services. Instead, non-functional attributes, such as device power features, computational resources and connectivity status, that characterize the context of both service providers and consumers play an important role to the quality and usability of discovery results. In this paper we introduce context-awareness in web service discovery, enabling the provision of the most appropriate services at the right location and time. We focus on context-based caching and routing for improving web service discovery in a mobile peer-to-peer environment. We conducted a thorough experimental study, using our prototype implementation based on the JXTA framework, while simulations are employed for testing the scalability of the approach. We illustrate the advantages that this approach offers, both by evaluating the context-based cache performance and by comparing the efficiency of location-based routing to broadcast-based approaches. Recommended by: Zakaria Maamar     

The Design of an Allo-Optical Packet Switching Network

Recent advances in the all-optical signal processing domain report high-speed and nontrivial functionality directly implemented in the optical layer. These developments mean that the all- optical processing of packet headers has a future. In this article we address various important control plane issues that must be resolved when designing networks based on all-optical packet-switched nodes.     

The Greek School Network: A Paradigm of Successful Educational Services Based on the Dynamics of Open-Source Technology

The Greek school network (GSN) is a closed nationwide educational network that offers advanced telematic and networking services to all primary/secondary education schools and administration offices in Greece. The primary objective of GSN is the provisioning of a network infrastructure for the interconnection of school PC laboratories so that modern educational methods and pedagogical models can be applied to the school community. GSN has scaled in size, has reached maturity, and is currently delivering a wide range of network and telematic services to its users. The emerging power of open-source software provides a sound technological basis for building cutting-edge services, capable of meeting internal administrative and monitoring needs, and modern pedagogical requirements for tools and services. The current paper presents an overview of GSN and an evaluation of its services based on the opinions of its users, and on service utilization and traffic measurement statistics. The paper reaches the conclusion that open-source solutions provide a sound technological platform that can cover, to a great extent, the needs for advanced educational services of the school community.     

The λ-scheduler: A multiwavelength scheduling switch

We propose a new multiwavelength almost all-optical switch architecture called the λ-scheduler that uses wavelength division multiplexing (WDM) internally to fold the switch architecture in both the space and time domains to reduce the hardware complexity and to improve the signal characteristics through the switch. The λ-scheduler preserves the packet order for a given input-output pair, is consistent with virtual circuit switching, and when combined with appropriate connection and flow control protocols, provides lossless communication for bursty (or nonconstant rate) traffic, provided the traffic satisfies certain smoothness properties. The λ-scheduler uses novel scheduling and wavelength assignment algorithms, in conjunction with a series of feed-forward delay blocks, to avoid packet collisions within the switch or at the switch outputs. We present two implementations of the λ-scheduler when the number of internal wavelengths k equal the number of inputs (and outputs) N to the switch. In the compressed λ-scheduler, the N internal wavelengths are used to fold the architecture in the time domain, which reduces the total number of delay blocks for the switch by 2N log N. In the collapsed λ-scheduler, the N internal wavelengths are used to fold the architecture in the space domain, which reduces the number of delay blocks and total fiber length used for delays by a factor of N. We examine the insertion loss for both λ-scheduler implementations and discuss the trade-offs between the reduction in overall component count and the improvement in the signal characteristics     

Deploying LiveWN Grids in the Greek School Network

A determinant factor for the introduction of grid technologies in production domains of scale can be the design of easy, fast and, from an operational point of view, realizable deployment procedures. Remote system management technologies, typically used to monitor and manage IT environments, are designed to offer remote software installation functionality that exhibits the aforementioned characteristics; however, previous work has shown that even valuable systems can fail to perform in heterogeneous, geographically distributed environments, especially if they are maintained by organizations affiliated to the public sector. The deployment of grid technologies throughout the Greek School Network can be achieved by combining OpenRSM, a novel open source solution capable to support usable, configurable, infrastructure management use cases in heterogeneous environments and LiveWN, a grid scavenging solution that integrates live technologies with gLite grids.     

Circuit switching with input queuing: an analysis for thed-dimensional wraparound mesh and the hypercube

We analyze circuit switching in a multiprocessor network, where connection requests (or sessions) arrive at each node of the network according to a Poisson process with rate λ. Each session joins the appropriate input-queue at its source node, and, upon advancing to the head of the queue, transmits a setup packet to establish a connection. If the setup packet is successful, it reserves the links on the path for the duration of the session, and the session is served without interruptions. Otherwise, the connection request remains queued at the source, and subsequent attempts are made to establish the circuit. We analyze the queue of connection requests at the input-buffer of a network link, and obtain analytic expressions for the stability region, the average queuing delay, the average connection time, the average waiting time, and the average total delay, which show how these parameters depend on system variables, such as network dimension and session arrival rate. The queuing analysis focuses on the input-queue of a particular link, and accounts for the interactions with queues of other links through the retrial attempts and the associated probability of success. The queuing analysis is independent of the particular network topology under consideration, as long as the probability that a session arriving at a random time successfully establishes a connection can be calculated for that network. Simulations demonstrate the close agreement between the observed network behavior and that predicted by the analysis     

Miscibility behavior and formation mechanism of stabilized felodipine-polyvinylpyrrolidone amorphous solid dispersions

In the present study, solid dispersion systems of felodipine (FEL) with polyvinylpyrrolidone (PVP) were developed, in order to enhance solid state stability and release kinetics. The prepared systems were characterized by using Differential Scanning Calorimetry, X-Ray Diffraction, and Scanning Electron Microscopy techniques, while the interactions which take place were identified by using Fourier Transformation-Infrared Spectroscopy. Due to the formation of hydrogen bonds between the carbonyl group of PVP and the amino groups of FEL, transition of FEL from crystalline to amorphous state was achieved. The dispersion of FEL was found to be in nano-scale particle sizes and dependent on the FEL/PVP ratio. This modification leads to partial miscibility of the two components, as it was verified by DSC and optimal glass dispersion of FEL into the polymer matrix since no crystalline structure was detected with XRD. The above deformation has a significant effect on the dissolution enhancement and the release kinetics of FEL, as it causes the pattern to change from linear to logarithmic. An impressive optimization of the dissolution profile is observed corresponding to a rapid release of FEL in the system containing 10% w/w of FEL, releasing 100% in approximately 20 min. The particle size of dispersed FEL into PVP matrix could be classified as the main parameter affecting dissolution optimization. The mechanism of such enhancement consists of the lower energy required for the dissolution due to the amorphous transition and the fine dispersion, which leads to an optimal contact surface of the drug substance with the dissolution media. The prepared systems are stable during storage at 40 ± 1°C and relative humidity of 75 ± 5%. Addition of sodium docusate as surfactant does not affect the release kinetics, but only the initial burst due to its effect on the surface tension and wettability of the systems.     

The slow start power controlled MAC protocol for mobile ad hoc networks and its performance analysis

We propose and evaluate the performance of a new MAC-layer protocol for mobile ad hoc networks, called the Slow Start Power Controlled (abbreviated SSPC) protocol. SSPC improves on IEEE 802.11 by using power control for the RTS/CTS and DATA frame transmissions, so as to reduce energy consumption and increase network throughput and lifetime. In our scheme the transmission power used for the RTS frames is not constant, but follows a slow start principle. The CTS frames, which are sent at maximum transmission power, prevent the neighbouring nodes from transmitting their DATA frames at power levels higher than a computed threshold, while allowing them to transmit at power levels less than that threshold. Reduced energy consumption is achieved by adjusting the node transmission power to the minimum required value for reliable reception at the receiving node, while increase in network throughput is achieved by allowing more transmissions to take place simultaneously. The slow start principle used for calculating the appropriate DATA frames transmission power and the possibility of more simultaneous collision-free transmissions differentiate the SSPC protocol from the other MAC solutions proposed for IEEE 802.11. Simulation results indicate that the SSPC protocol achieves a significant reduction in power consumption, average packet delay and frequency of RTS frame collisions, and a significant increase in network throughput and received-to-sent packets ratio compared to IEEE 802.11 protocol.