Loss-free architectures in optical burst switched networks for a reliable and dynamic optical layer

摘要: For the last three decades, optical fiber has been a quite systematic response to dimensioning issues in Internet. Originally restricted long haul networks, network gradually descended hierarchy discard bottlenecks. In 90's, metropolitan networks became optical. Today, fibers are deployed access and reach users. near future, besides wireless local area all may be made of fibers, order support current services (HDTV) emergence new applications (3D-TV newly commercialized USA). The deployment such greedy will initiate an upward upgrade. first step Metropolitan Area Networks (MANs), not only because traffic growth, but also variety served applications, each with specific profile. layer is mitigated efficiency, dealing unforeseen events. lack reactivity mainly due slow switching devices: any on-line decision delayed by configuration the. devices. When extended MANs, lot efforts improve layer. Optical Circuit Switching paradigm (OCS) improved it ultimately relies on off-line Burst (OBS) can viewed as highly flexible evolution OCS, that operates five magnitude faster. Within this 'architecture, loss-free guaranty abandoned Indeed, reliability appear antagonists properties getting closer either them mitigates other. This thesis aims at proposing solution achieve reliable transmission over dynamic Focusing OBS our objective solve contention issue without mitigating reactivity. After consideration avoidance mechanisms routing constraints similar OCS we investigate reactive solutions intend contentions. None available resolution scheme ensure 100% efficiency leads transmission. An attractive recourse electrical buffering, notoriously disregarded (1) impact delays (2) loss occur buffer overflows. translucent architectures thus depends availability, reducing time spent buffers rate. We show grooming reduce emission delay, consequently occupancy. architecture, enabled core node capable re-aggregate incoming bursts. re-aggregation mandatory "de-groom" bursts (i.e., demultiplex content burst). On one hand, reduces probability, other absorbs benefits grooming. Finally, for resolution, despite significant reduction rate, dramatically impacts end-to-end delay memory requirement. propose second called CAROBS, exploits domain. framework fully used jointly architecture performs re-aggregation. As (de)grooming operations do involve re-aggregation, module resolution. result, volume data submitted drastically reduced reached same reactivity, requirement native