How Far Can We Go with Obs Networks

摘要: Optical Burst Switching (OBS) was proposed ten years ago as an alternative switching paradigm in order to overcome some of the drawbacks Circuit (OCS). While OBS is no more necessarily perceived a competitor OCS, but adapted for networks with bursty and highly dynamic traffic, there still debate around OBS, i.e., how far network can go terms throughput or limited burst losses. This thesis attempts answer this question by investigating devise upper bound on network, assuming recourse electrical buffering made at any intermediate node. We investigate both scheduling routing issues, larger focus three directions: (i) exploration weighted k -shortest paths, (ii) revisiting load balancing, (iii) examining tree decomposition. Simulations have been conducted compare evaluate each new ideas (with respect bounding) previously algorithms different traffic instances. A comparison best lower bounds obtained under various assumptions presented