Dimensionerings- en werkverdelingsalgoritmen voor lambda grids

Grids bestaan uit een verzameling reken- en opslagelementen die geografisch verspreid kunnen zijn, maar waarvan men de gezamenlijke capaciteit wenst te benutten. Daartoe dienen deze elementen verbonden te worden met een netwerk. Vermits veel wetenschappelijke applicaties gebruik maken van een Grid, en deze applicaties doorgaans grote hoeveelheden data verwerken, is het noodzakelijk om een netwerk te voorzien dat dergelijke grote datastromen op betrouwbare wijze kan transporteren. Optische transportnetwerken lenen zich hier uitstekend toe. Grids die gebruik maken van dergelijk netwerk noemt men lambda Grids. Deze thesis beschrijft een kader waarin het ontwerp en dimensionering van optische netwerken voor lambda Grids kunnen beschreven worden. Ook wordt besproken hoe werklast kan verdeeld worden op een Grid eens die gedimensioneerd is. Een groot deel van de resultaten werd bekomen door simulatie, waarbij gebruik gemaakt wordt van een eigen Grid simulatiepakket dat precies focust op netwerk- en Gridelementen. Het ontwerp van deze simulator, en de daarbijhorende implementatiekeuzes worden dan ook uitvoerig toegelicht in dit werk

Suggested vector scheme with crankback mechanism in GMPLS-controlled optical networks

n/

Performance issues in optical burst/packet switching

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-01524-3_8This chapter summarises the activities on optical packet switching (OPS) and optical burst switching (OBS) carried out by the COST 291 partners in the last 4 years. It consists of an introduction, five sections with contributions on five different specific topics, and a final section dedicated to the conclusions. Each section contains an introductive state-of-the-art description of the specific topic and at least one contribution on that topic. The conclusions give some points on the current situation of the OPS/OBS paradigms

New contention resolution techniques for optical burst switching

Optical burst switching (OBS) is a technology positioned between wavelength routing and optical packet switching that does not require optical buffering or packet-level parsing, and it is more efficient than circuit switching when the sustained traffic volume does not consume a full wavelength. However, several critical issues still need to be solved such as contention resolution without optical buffering which is a key determinant of packet-loss with a significant impact on network performance. Deflection routing is an approach for resolving contention by routing a contending packet to an output port other than the intended output port. In OBS networks, when contention between two bursts cannot be resolved through deflection routing, one of the bursts will be dropped. However, this scheme doesn’t take advantage of all the available resources in resolving contentions. Due to this, the performance of existing deflection routing scheme is not satisfactory. In this thesis, we propose and evaluate three new strategies which aim at resolving contention. We propose a new approach called Backtrack on Deflection Failure, which provides a second chance to blocked bursts when deflection failure occurs. The bursts in this scheme, when blocked, will get an opportunity to backtrack to the previous node and may get routed through any deflection route available at the previous node. Two variants are proposed for handling the backtracking delay involved in this scheme namely: (a) Increase in Initial Offset and (b) Open-Loop Reservation. Furthermore, we propose a third scheme called Bidirectional Reservation on Burst Drop in which bandwidth reservation is made in both the forward and the backward directions simultaneously. This scheme comes into effect only when control bursts get dropped due to bandwidth unavailability. The retransmitted control bursts will have larger offset value and because of this, they will have lower blocking probability than the original bursts. The performance of our schemes and of those proposed in the literature is studied through simulation. The parameters considered in evaluating these schemes are blocking probability, average throughput, and overall link utilization. The results obtained show that our schemes perform significantly better than their standard counterparts

An hybrid prediction-based routing approach for reducing routing inaccuracy in optical transport networks

© 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.The advent of network technologies such as Automatically Switched Optical Networks (ASON) and Generalized Multiprotocol Label Switching (GMPLS) pave the way to the deployment of flexible optical transport networks (OTNs). The flexibility of OTNs is a feature highly demanded in dynamic scenarios where lightpaths are continuously set up and torn down on a short-term basis. Unfortunately, the availability and accuracy of network state information in dynamic scenarios are both limited, causing a severe impact on both performance and scalability of Routing and Wavelength Assignment (RWA) algorithms. In this paper we devise a promising routing scheme so-called Hybrid Prediction-based Routing (HPBR). HPBR combines prediction strategies with a novel method to select the most suitable routing metric, aiming at reducing both the dissemination of network state information and the blocking probability. Our findings validate that the proposed scheme significantly reduces the blocking probability compared with other routing schemes, while avoiding the need to periodically disseminate network state information.This work was supported by the Spanish Ministry of Economy under contract TEC2012-34682, and the Catalan Research Council (CIRIT) under contract 2009 SGR1508.Peer ReviewedPostprint (author's final draft

An ant-based algorithm for distributed routing and wavelength assignment in dynamic optical networks

Future optical communication networks are expected to change radically during the next decade. To meet the demanded bandwidth requirements, more dynamism, scalability and automatism will need to be provided. This will also require addressing issues such as the design of highly distributed control plane systems and their associated algorithms to respond to network changes very rapidly. In this work, we propose the use of an ant colony optimization (ACO) algorithm to solve the intrinsic problem of the routing and wavelength assignment (RWA) on wavelength continuity constraint optical networks. The main advantage of the protocol is its distributed nature, which provides higher survivability to network failures or traffic congestion. The protocol has been applied to a specific type of future optical network based on the optical switching of bursts. It has been evaluated through extensive simulations with very promising results, particularly on highly congested scenarios where the load balancing capabilities of the protocol become especially efficient. Results on a partially meshed network like NSFNET show that the ant-based protocol outperforms other RWA algorithms under test in terms of blocking probability without worsening other metrics such as mean route length.Peer ReviewedPostprint (published version

Exploiting Properties of CMP Cache Traffic in Designing Hybrid Packet/Circuit Switched NoCs

Chip multiprocessors with few to tens of processing cores are already commercially available. Increased scaling of technology is making it feasible to integrate even more cores on a single chip. Providing the cores with fast access to data is vital to overall system performance. When a core requires access to a piece of data, the core's private cache memory is searched first. If a miss occurs, the data is looked up in the next level(s) of the memory hierarchy, where often one or more levels of cache are shared between two or more cores. Communication between the cores and the slices of the on-chip shared cache is carried through the network-on-chip(NoC). Interestingly, the cache and NoC mutually affect the operation of each other; communication over the NoC affects the access latency of cache data, while the cache organization generates the coherence and data messages, thus affecting the communication patterns and latency over the NoC. This thesis considers hybrid packet/circuit switched NoCs, i.e., packet switched NoCs enhanced with the ability to configure circuits. The communication and performance benefit that come from using circuits is predicated on amortizing the time cost incurred for configuring the circuits. To address this challenge, NoC designs are proposed that take advantage of properties of the cache traffic, namely temporal locality and predictability, to amortize or hide the circuit configuration time cost. First, a coarse-grained circuit configuration policy is proposed that exploits the temporal locality in the cache traffic to periodically configure circuits for the heavily communicating nodes. This allows the design of a locality-aware cache that promotes temporal communication locality through data placement, while designing suitable data replacement and migration policies. Next, a fine-grained configuration policy, called Déjà Vu switching, is proposed for leveraging predictability of data messages by initiating a circuit configuration as soon as a cache hit is detected and before the data becomes available. Its benefit is demonstrated for saving interconnect energy in multi-plane NoCs. Finally, a more proactive configuration policy is proposed for fast caches, where circuit reservations are initiated by request messages, which can greatly improve communication latency and system performance