工学 >>> 光学工程 >>> 光信息技术 >>> 光计算 >>>
搜索结果: 1-11 共查到光计算 Networks相关记录11条 . 查询时间(0.158 秒)
We analyze the blocking performance of spectrum efficient super-channels in dynamic flexible grid networks. Results demonstrate that increased spectral efficiency and flexible super-channel assignment...
Wavelength-selective spatial routing is proposed for photonic networks and demonstrated on an electro-optic microring switch. This technique yields greater path diversity in photonic networks, enablin...
Light-trail, a spatial sub-wavelength optical grooming solution for WDM networks, facilitates dynamic bandwidth provisioning and optical multicasting - essential for cloud computing services. We evalu...
A novel impairment-aware lightpath provisioning scheme, which leverages PMD tempo-ral correlation, is proposed for GMPLS-controlled transparent networks. Simulations show that the scheme reduces the b...
We propose a novel information-diffusion-based routing (IDBR) scheme in wavelength routed WDM mesh networks. The IDBR scheme has the fast convergence and the low bandwidth consumption of OSPF-TE while...
We design a cost efficient routing algorithm and prototype a network planning tool to cost-effectively provision high-speed connections over a large carrier’s heterogeneous core DWDM network with mult...
Inter-domain network information distribution becomes the bottleneck of constraint-based path computation in multi-domain optical networks. This article proposes scalable DHT-based path computation ap...
A weight-based heuristic algorithm was developed to efficiently aggregate UPSR demands into SONET rings over DWDM networks in order to minimize the total number of optical line cards for a given set o...
A parallel data-flow hardware based path computation engine that makes multilayer traffic engineering more scalable is proposed. The engine achieves 100 times faster than conventional path computation...
We propose a network segmentation and design algorithm based on traffic distribution information.Numerical experiments demonstrated that the proposed algorithm can greatly reduce network cost.
We proposes a Lagrangean Relaxation based algorithm that derives profoundly tight lower and upper bounds with low computational complexity, yielding a near-optimal solution to the advance lightpath re...

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

世界大学科研机构排行榜-

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...