The undirected optical indices of complete m-ary trees

檔案

本條目沒有附加檔案。

至出版者網站查看(DOI) ›

日期

2020-10-15

類型

期刊名稱

DISCRETE APPLIED MATHEMATICS

卷期與頁次

第 285 卷,頁 173–181

ISSN

0166-218X

語言

英文

摘要

The routing and wavelength assignment problem arises from the investigation of optimal wavelength allocation in an optical network that employs Wavelength Division Multiplexing (WDM). Consider an optical network that is represented by a connected, simple graph G. An all-to-all routing R in G is a set of paths connecting all pairs of vertices of G. The undirected optical index of G is the minimum integer k to guarantee the existence of a mapping phi : R -> {1, 2, ..., k}, such that phi(P) not equal phi(P') if P and P' have common edge(s), over all possible routings R. A natural lower bound of the undirected optical index of G is the (undirected) edge-forwarding index, which is defined to be the minimum of the maximum edge-load over all possible all-to-all routings. In this paper, we first derive the exact value of the optical index of the complete m-ary trees, and then investigate the gap between undirected optical and edge-forwarding indices. (C) 2020 Elsevier B.V. All rights reserved.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Lo, Y.-H., Fu, H.-L., Zhang, Y., & Wong, W. S. (2020). The undirected optical indices of complete m-ary trees. DISCRETE APPLIED MATHEMATICS, 285, 173–181. https://doi.org/10.1016/j.dam.2020.05.006

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/155476