A computational grid is a hardware and software infrastructure that provides dependable, consistent, pervasive, and inexpensive access to high-end computational capabilities. This talk is divided into three parts. Firstly, we give an overview of the main issues in grid computing. Next, we introduce ALiCE (Adaptive and Scalable Internet-based Computing Engine), a platform independent and lightweight grid. ALiCE exploits object-level parallelism using our Object Network Transport Architecture (ONTA). Grid applications are written using ALiCE Object Programming Template that hides the complexities of the underlying grid fabric. Lastly, we present some performance results of ALiCE applications including the geo-rectification of satellite images and the progressive multiple sequence alignments problem. / Singapore-MIT Alliance (SMA)

With the advances in video compression and networking techniques, the last ten years have witnessed an explosive growth of video applications over the Internet. However, the service model of the current best-effort network was never engineered to handle video traffic and, as a result, video applications still suffer from varying and unpredictable network conditions, in terms of bandwidth, packet loss and delay. To address these problems, a lot of innovative techniques have been proposed and researched. Among them, scalable video coding is a promising one to cope with the dynamics of the available bandwidth and heterogeneous terminals. This work aims at improving the efficacy of scalable video transport over IP networks. In this work, we first propose an optimal interleaving scheme combined with motion-compensated fine granularity scalability video source coding and unequal loss protection schemes, under an imposed delay constraint. The network is modeled as a packet-loss channel with random delays. The motion compensation prediction, ULP allocation and the depth of the interleaver are jointly optimized based on the network status and the delay constraint. We then proceed to investigate the multiple path transport technique. A unified approach which incorporates adaptive motion compensation prediction, multiple description coding and unequal multiple path allocation, is proposed to improve both the robustness and error resilience property of the video coding and transmission system, while the delivered video quality is improved simultaneously. To analytically investigate the efficacy of error resilient transport schemes for progressively encoded sources, including unequal loss protection, best-effort and FEC transport schemes, we develop evaluation and optimization approaches for these transport schemes. In this part of the work, the network is modeled as an M/D/1/K queue, and then a comprehensive queueing analysis is provided. Armed with these results, the efficacy of these transport schemes for progressively encoded sources are investigated and compared.

<p>Denna undersökning påvisar möjligheten att gradera verkan med stridsvagn 122 vid en insats i Sveriges insatsområde i Afghanistan. Hotbilden som råder gör att personalen måste ha ett gott skydd och möjlighet till verkan vilket stridsvagnen erbjuder. Tyngdpunkten i undersökningen ligger på modern 120 mm ammunition där Försvarsmaktens övningsammunition kan användas för att minska effekten i målet och på så sätt gradera verkan. På marknaden finns det ammunition som skulle komplettera redan befintlig ammunitionsportfölj framförallt på korta avstånd och då även med möjligheten att skjuta varningseld. Sekundärbeväpning (kulsprutor) på vagnen kan även den användas för att gradera verkan. Vidare finns det möjlighet att med rökkastarna verka med icke dödliga medel som tårgas och chockgranater då eskaleringen i en situation är låg. De olika vapensystem som undersökningen tar upp har värderats och placerats in i en eskaleringsmodell där lägsta nivån är att visa närvaro och högsta är verkanseld med flertalet vagnar.</p> / <p>The study indicates the possibility of obtaining scalable effects with Leopard 2A5 (S) in a mission in Sweden’s area of responsibility in Afghanistan. The threat that exists against the soldiers makes the ability to have good protection and possibility to obtain effect, which the Leopard 2A5 (S) offers, amust. The main part of the study stresses on modern 120 mm munitions in which the Swedish Armed Forces’ training munitions can be used to reduce the effect in a target and thus makes it a scalable effect. In the market there are munitions that would complement the existing portfolio of munitions, particularly at short distances, and with the ability to shoot warning shots. Secondary Armament (machine guns) on the tank can also be used to obtain a scalable effect. Furthermore, there is an opportunity to use the smoke launchers with non lethal means such as teargas and stun grenades when the level of escalation in a situation is low. The different weapon systems that is discussed in the study has been valued and placed into aescalation model where the lowest level is to show presence and the highest is fire for effect withmultiple tanks.</p>

Denna undersökning påvisar möjligheten att gradera verkan med stridsvagn 122 vid en insats i Sveriges insatsområde i Afghanistan. Hotbilden som råder gör att personalen måste ha ett gott skydd och möjlighet till verkan vilket stridsvagnen erbjuder. Tyngdpunkten i undersökningen ligger på modern 120 mm ammunition där Försvarsmaktens övningsammunition kan användas för att minska effekten i målet och på så sätt gradera verkan. På marknaden finns det ammunition som skulle komplettera redan befintlig ammunitionsportfölj framförallt på korta avstånd och då även med möjligheten att skjuta varningseld. Sekundärbeväpning (kulsprutor) på vagnen kan även den användas för att gradera verkan. Vidare finns det möjlighet att med rökkastarna verka med icke dödliga medel som tårgas och chockgranater då eskaleringen i en situation är låg. De olika vapensystem som undersökningen tar upp har värderats och placerats in i en eskaleringsmodell där lägsta nivån är att visa närvaro och högsta är verkanseld med flertalet vagnar. / The study indicates the possibility of obtaining scalable effects with Leopard 2A5 (S) in a mission in Sweden’s area of responsibility in Afghanistan. The threat that exists against the soldiers makes the ability to have good protection and possibility to obtain effect, which the Leopard 2A5 (S) offers, amust. The main part of the study stresses on modern 120 mm munitions in which the Swedish Armed Forces’ training munitions can be used to reduce the effect in a target and thus makes it a scalable effect. In the market there are munitions that would complement the existing portfolio of munitions, particularly at short distances, and with the ability to shoot warning shots. Secondary Armament (machine guns) on the tank can also be used to obtain a scalable effect. Furthermore, there is an opportunity to use the smoke launchers with non lethal means such as teargas and stun grenades when the level of escalation in a situation is low. The different weapon systems that is discussed in the study has been valued and placed into aescalation model where the lowest level is to show presence and the highest is fire for effect withmultiple tanks.

Scalable on-demand content delivery systems, designed to effectively handle increasing request rates, typically use service aggregation or content replication techniques. Service aggregation relies on one-to-many communication techniques, such as multicast, to efficiently deliver content from a single sender to multiple receivers. With replication, multiple geographically distributed replicas of the service or content share the load of processing client requests and enable delivery from a nearby server.<p>Previous scalable protocols for downloading large, popular files from a single server include batching and cyclic multicast. Analytic lower bounds developed in this thesis show that neither of these protocols consistently yields performance close to optimal. New hybrid protocols are proposed that achieve within 20% of the optimal delay in homogeneous systems, as well as within 25% of the optimal maximum client delay in all heterogeneous scenarios considered.<p>In systems utilizing both service aggregation and replication, well-designed policies determining which replica serves each request must balance the objectives of achieving high locality of service, and high efficiency of service aggregation. By comparing classes of policies, using both analysis and simulations, this thesis shows that there are significant performance advantages in using current system state information (rather than only proximities and average loads) and in deferring selection decisions when possible. Most of these performance gains can be achieved using only local (rather than global) request information.<p>Finally, this thesis proposes adaptations of already proposed peer-assisted download techniques to support a streaming (rather than download) service, enabling playback to begin well before the entire media file is received. These protocols split each file into pieces, which can be downloaded from multiple sources, including other clients downloading the same file. Using simulations, a candidate protocol is presented and evaluated. The protocol includes both a piece selection technique that effectively mediates the conflict between achieving high piece diversity and the in-order requirements of media file playback, as well as a simple on-line rule for deciding when playback can safely commence.

With the proliferation of smart devices that require Internet connectivity anytime, anywhere, and the recent technological advances that make it possible, current networked systems will have to provide a various range of services, such as content distribution, in a wide range of settings, including wireless environments. Wireless links may experience temporary losses, however, TCP, the de facto protocol for robust unicast communications, reacts by reducing the congestion window drastically and injecting less traffic in the network. Consequently the wireless links are underutilized and the overall performance of the TCP protocol in wireless environments is poor. As content delivery (i.e. multicasting) services, such as BBC iPlayer, become popular, the network needs to support the reliable transport of the data at high rates, and with specific delay constraints. A typical approach to deliver content in a scalable way is to rely on peer-to-peer technology (used by BitTorrent, Spotify and PPLive), where users share their resources, including bandwidth, storage space, and processing power. Still, these systems suffer from the lack of incentives for resource sharing and cooperation, and this problem is exacerbated in the presence of heterogenous users, where a tit-for-tat scheme is difficult to implement. Due to the issues highlighted above, current network architectures need to be changed in order to accommodate the users¿ demands for reliable and quality communications. In other words, the emergent need for advanced modes of information transport requires revisiting and improving network components at various levels of the network stack. The innovative paradigm of network coding has been shown as a promising technique to change the design of networked systems, by providing a shift from how data flows traditionally move through the network. This shift implies that data flows are no longer kept separate, according to the ¿store-and-forward¿ model, but they are also processed and mixed in the network. By appropriately combining data by means of network coding, it is expected to obtain significant benefits in several areas of network design and architecture. In this thesis, we set out to show the benefits of including network coding into three communication paradigms, namely point-topoint communications (e.g. unicast), point-to-multipoint communications (e.g. multicast), and multipoint-to-multipoint communications (e.g. peer-to-peer networks). For the first direction, we propose a network coding-based multipath scheme and show that TCP unicast sessions are feasible in highly volatile wireless environments. For point-to-multipoint communications, we give an algorithm to optimally achieve all the rate pairs from the rate region in the case of degraded multicast over the combination network. We also propose a system for live streaming that ensures reliability and quality of service to heterogenous users, even if data transmissions occur over lossy wireless links. Finally, for multipoint-to-multipoint communications, we design a system to provide incentives for live streaming in a peer-to-peer setting, where users have subscribed to different levels of quality. Our work shows that network coding enables a reliable transport of data, even in highly volatile environments, or in delay sensitive scenarios such as live streaming, and facilitates the implementation of an efficient incentive system, even in the presence of heterogenous users. Thus, network coding can solve the challenges faced by next generation networks in order to support advanced information transport.

Shape memory alloys (SMAs) provide exciting opportunities for miniature actuation systems. As SMA actuators are scaled down in size, cooling increases and bandwidth, improves. However, the inclusion of a bias element with which to cycle the SMA actuator becomes difficult at very small scales. One technique used to avoid the necessity of having to include a separate bias element is the use of local annealing to fabricate a monolithic device out of nickel titanium (NiTi). The actuator geometry is machined out of a single piece of non-annealed NiTi. After locally annealing a portion of the complete device, that section exhibits the shape memory effect while the remainder acts as structural support and provides the bias force required for cycling. This work proposes one such locally-annealed monolithic SMA actuator for future incorporation in a device that navigates the digestive tract. After detailing the derivation of lumped electro-mechanical models for the actuator, a description of the prototyping procedure, including fabrication and local annealing of the actuator, is provided. This thesis presents the experimental prototype actuator behaviour and compares it with simulations generated using the developed models.

Shape memory alloys (SMAs) provide exciting opportunities for miniature actuation systems. As SMA actuators are scaled down in size, cooling increases and bandwidth, improves. However, the inclusion of a bias element with which to cycle the SMA actuator becomes difficult at very small scales. One technique used to avoid the necessity of having to include a separate bias element is the use of local annealing to fabricate a monolithic device out of nickel titanium (NiTi). The actuator geometry is machined out of a single piece of non-annealed NiTi. After locally annealing a portion of the complete device, that section exhibits the shape memory effect while the remainder acts as structural support and provides the bias force required for cycling. This work proposes one such locally-annealed monolithic SMA actuator for future incorporation in a device that navigates the digestive tract. After detailing the derivation of lumped electro-mechanical models for the actuator, a description of the prototyping procedure, including fabrication and local annealing of the actuator, is provided. This thesis presents the experimental prototype actuator behaviour and compares it with simulations generated using the developed models.

Scalable on-demand content delivery systems, designed to effectively handle increasing request rates, typically use service aggregation or content replication techniques. Service aggregation relies on one-to-many communication techniques, such as multicast, to efficiently deliver content from a single sender to multiple receivers. With replication, multiple geographically distributed replicas of the service or content share the load of processing client requests and enable delivery from a nearby server.<p>Previous scalable protocols for downloading large, popular files from a single server include batching and cyclic multicast. Analytic lower bounds developed in this thesis show that neither of these protocols consistently yields performance close to optimal. New hybrid protocols are proposed that achieve within 20% of the optimal delay in homogeneous systems, as well as within 25% of the optimal maximum client delay in all heterogeneous scenarios considered.<p>In systems utilizing both service aggregation and replication, well-designed policies determining which replica serves each request must balance the objectives of achieving high locality of service, and high efficiency of service aggregation. By comparing classes of policies, using both analysis and simulations, this thesis shows that there are significant performance advantages in using current system state information (rather than only proximities and average loads) and in deferring selection decisions when possible. Most of these performance gains can be achieved using only local (rather than global) request information.<p>Finally, this thesis proposes adaptations of already proposed peer-assisted download techniques to support a streaming (rather than download) service, enabling playback to begin well before the entire media file is received. These protocols split each file into pieces, which can be downloaded from multiple sources, including other clients downloading the same file. Using simulations, a candidate protocol is presented and evaluated. The protocol includes both a piece selection technique that effectively mediates the conflict between achieving high piece diversity and the in-order requirements of media file playback, as well as a simple on-line rule for deciding when playback can safely commence.

Simulation has become an important way to observe and understand various networking phenomena under various conditions. As the demand to simulate larger and more complex networks increases, the limited computing capacity of a single workstation and the limited simulation capability of a single network simulator have become apparent obstacles to the simulationists. In this research we develop techniques that can scale a simulation to address the limited capacity of a single workstation, as well as techniques that can compose a simulation from different simulator components to address the limited capability of a single network simulator. We scale a simulation with two different approaches: 1) We reduce the resource requirement of a simulation substantially, so that larger simulations can fit into one single workstation. In this thesis, we develop three technqiues (Negative Forwarding Table, Multicast Routing Object Aggregation and NIx-Vector Unicast Routing) to aggregate and compress the large amount of superfluous or redundant routing state in large multicast simulations. 2) The other approach to scale network simulations is to partition a simulation model in a way that makes the best use of the resources of the available computer cluster, and distribute the simulation onto the different processors of the computer cluster to obtain the best parallel simulation performance. We develop a novel empirical methodology called BencHMAP (Benchmark-Based Hardware and Model Aware Partitioning) that runs small sets of benchmark simulations to derive the right formulas of calculating the weights that are used to partition the simulation on a given computer cluster. On the other hand, to address the problem of the limited capability of a network simulator, we develop techniques for building complex network simulations by composing from independent components. With different existing simulators good at different protocol layers/scenarios, we can make each simulator execute the layers where it excels, using a simulation backplane to be the interface between different simulators. In this thesis we demonstrate that these techniques enable us to not only scale up simulations by orders of magnitude with a good performance, but also compose complex simulations with high fidelity.