Dynamic bandwidth allocation in multi-class IP networks using utility functions.

PhDAbstact not availableFujitsu Telecommunications Europe Lt

Reification of network resource control in multi-agent systems

In multi-agent systems [1], coordinated resource sharing is indispensable for a set of autonomous agents, which are running in the same execution space, to accomplish their computational objectives. This research presents a new approach to network resource control in multi-agent systems, based on the CyberOrgs [2] model. This approach aims to offer a mechanism to reify network resource control in multi-agent systems and to realize this mechanism in a prototype system. In order to achieve these objectives, a uniform abstraction vLink (Virtual Link) is introduced to represent network resource, and based on this abstraction, a coherent mechanism of vLink creation, allocation and consumption is developed. This mechanism is enforced in the network by applying a fine-grained flow-based scheduling scheme. In addition, concerns of computations are separated from those of resources required to complete them, which simplifies engineering of network resource control. Thus, application programmers are enabled to focus on their application development and separately declaring resource request and defining resource control policies for their applications in a simplified way. Furthermore, network resource is bounded to computations and controlled in a hierarchy to coordinate network resource usage. A computation and its sub-computations are not allowed to consume resources beyond their resource boundary. However, resources can be traded between different boundaries. In this thesis, the design and implementation of a prototype system is described as well. The prototype system is a middleware system architecture, which can be used to build systems supporting network resource control. This architecture has a layered structure and aims to achieve three goals: (1) providing an interface for programmers to express resource requests for applications and define their resource control policies; (2) specializing the CyberOrgs model to control network resource; and (3) providing carefully designed mechanisms for routing, link sharing and packet scheduling to enforce required resource allocation in the network

Mixed-Criticality Systems on Commercial-Off-the-Shelf Multi-Processor Systems-on-Chip

Avionics and space industries are struggling with the adoption of technologies like multi-processor system-on-chips (MPSoCs) due to strict safety requirements. This thesis propose a new reference architecture for MPSoC-based mixed-criticality systems (MCS) - i.e., systems integrating applications with different level of criticality - which are a common use case for aforementioned industries. This thesis proposes a system architecture capable of granting partitioning - which is, for short, the property of fault containment. It is based on the detection of spatial and temporal interference, and has been named the online detection of interference (ODIn) architecture. Spatial partitioning requires that an application is not able to corrupt resources used by a different application. In the architecture proposed in this thesis, spatial partitioning is implemented using type-1 hypervisors, which allow definition of resource partitions. An application running in a partition can only access resources granted to that partition, therefore it cannot corrupt resources used by applications running in other partitions. Temporal partitioning requires that an application is not able to unexpectedly change the execution time of other applications. In the proposed architecture, temporal partitioning has been solved using a bounded interference approach, composed of an offline analysis phase and an online safety net. The offline phase is based on a statistical profiling of a metric sensitive to temporal interference’s, performed in nominal conditions, which allows definition of a set of three thresholds: 1. the detection threshold TD; 2. the warning threshold TW ; 3. the α threshold. Two rules of detection are defined using such thresholds: Alarm rule When the value of the metric is above TD. Warning rule When the value of the metric is in the warning region [TW ;TD] for more than α consecutive times. ODIn’s online safety-net exploits performance counters, available in many MPSoC architectures; such counters are configured at bootstrap to monitor the selected metric(s), and to raise an interrupt request (IRQ) in case the metric value goes above TD, implementing the alarm rule. The warning rule is implemented in a software detection module, which reads the value of performance counters when the monitored task yields control to the scheduler and reset them if there is no detection. ODIn also uses two additional detection mechanisms: 1. a control flow check technique, based on compile-time defined block signatures, is implemented through a set of watchdog processors, each monitoring one partition. 2. a timeout is implemented through a system watchdog timer (SWDT), which is able to send an external signal when the timeout is violated. The recovery actions implemented in ODIn are: • graceful degradation, to react to IRQs of WDPs monitoring non-critical applications or to warning rule violations; it temporarily stops non-critical applications to grant resources to the critical application; • hard recovery, to react to the SWDT, to the WDP of the critical application, or to alarm rule violations; it causes a switch to a hot stand-by spare computer. Experimental validation of ODIn was performed on two hardware platforms: the ZedBoard - dual-core - and the Inventami board - quad-core. A space benchmark and an avionic benchmark were implemented on both platforms, composed by different modules as showed in Table 1 Each version of the final application was evaluated through fault injection (FI) campaigns, performed using a specifically designed FI system. There were three types of FI campaigns: 1. HW FI, to emulate single event effects; 2. SW FI, to emulate bugs in non-critical applications; 3. artificial bug FI, to emulate a bug in non-critical applications introducing unexpected interference on the critical application. Experimental results show that ODIn is resilient to all considered types of faul

Smart Grid Relay Protection and Network Resource Management for Real-Time Communications.

Ph.D. Thesis. University of Hawaiʻi at Mānoa 2017

Quality of service and resource management in IP and wireless networks

A common theme in the publications included in this thesis is the quality of service and resource management in IP and wireless networks. This thesis presents novel algorithms and implementations for admission control in IP and IEEE 802.16e networks, active queue management in EGPRS, WCDMA, and IEEE 802.16e networks, and scheduling in IEEE 802.16e networks. The performance of different algorithms and mechanisms is compared with the prior art through extensive ns-2 simulations. We show that similar active queue management mechanisms, such as TTLRED, can be successfully used to reduce the downlink delay (and in some cases even improve the TCP goodput) in different bottlenecks of IP, EGPRS, WCDMA, and IEEE 802.16e access networks. Moreover, almost identical connection admission control algorithms can be applied both in IP access networks and at IEEE 802.16e base stations. In the former case, one just has to first gather the link load information from the IP routers. We also note that DiffServ can be used to avoid costly overprovisioning of the backhaul in IEEE 802.16e networks. We present a simple mapping between IEEE 802.16e data delivery services and DiffServ traffic classes, and we propose that IEEE 802.16e base stations should take the backhaul traffic load into account in their admission control decisions. Moreover, different IEEE 802.16e base station scheduling algorithms and uplink channel access mechanisms are studied. In the former study, we show that proportional fair scheduling offers superior spectral efficiency when compared to deficit round-robin, though in some cases at the cost of increased delay. Additionally, we introduce a variant of deficit round-robin (WDRR), where the quantum value depends on the modulation and coding scheme. We also show that there are several ways to implement ertPS in an efficient manner, so that during the silence periods of a VoIP call no uplink slots are granted. The problem here, however, is how to implement the resumption after the silence period while introducing as little delay as possible

A VOICE PRIORITY QUEUE (VPQ) SCHEDULER FOR VOIP OVER WLANs

The Voice over Internet Protocol (VoIP) application has observed the fastest growth in the world of telecommunication. The Wireless Local Area Network (WLAN) is the most assuring of technologies among the wireless networks, which has facilitated high-rate voice services at low cost and good flexibility. In a voice conversation, each client works as a sender and as a receiver depending on the direction of traffic flow over the network. A VoIP application requires a higher throughput, less packet loss and a higher fairness index over the network. The packets of VoIP streaming may experience drops because of the competition among the different kinds of traffic flow over the network. A VoIP application is also sensitive to delay and requires the voice packets to arrive on time from the sender to the receiver side without any delay over WLANs. The scheduling system model for VoIP traffic is still an unresolved problem. A new traffic scheduler is necessary to offer higher throughput and a higher fairness index for a VoIP application. The objectives of this thesis are to propose a new scheduler and algorithms that support the VoIP application and to evaluate, validate and verify the newly proposed scheduler and algorithms with the existing scheduling algorithms over WLANs through simulation and experimental environment. We proposed a new Voice Priority Queue (VPQ) scheduling system model and algorithms to solve scheduling issues. VPQ system model is implemented in three stages. The first stage of the model is to ensure efficiency by producing a higher throughput and fairness for VoIP packets. The second stage will be designed for bursty Virtual-VoIP Flow (Virtual-VF) while the third stage is a Switch Movement (SM) technique. Furthermore, we compared the VPQ scheduler with other well known schedulers and algorithms. We observed in our simulation and experimental environment that the VPQ provides better results for the VoIP over WLANs