Permutation Communication in All-Optical Rings.

Parallel Processing Letters(2011)

引用 9|浏览16
暂无评分
摘要
We study the wavelength problem and arc (edge) congestion problem for communicatingpermutation instances on a ring. We prove that the numbers of wavelengthsin the directed case\Gamma!w , in the undirected case w, and the arc congestion\Gamma!? and theedge congestion ? for a permutation instance I 1 on an n-vertex ring C n satisfy:\Gamma!w (C n ; I 1 ) ?n3?;\Gamma!? (C n ; I 1 ) ?n4?;w(C n ; I 1 ) ?n2?; ?(C n ; I 1 ) ?¥n2:All bounds...
更多
查看译文
关键词
wavelength,permutation
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要