Link capacity adjustment schemes based on virtual concatenation

HAI Zeng-qiang; MAO Qian

doi:10.13756/j.gtxyj.2005.02.003

您当前的位置：

首页 >

文章列表页 >

Link capacity adjustment schemes based on virtual concatenation

- Link capacity adjustment schemes based on virtual concatenation
- Study on Optical communication Issue 2, Pages: 8-10(2005)
- 作者机构：
  
  1. 武汉邮电科学研究院
  2. 武汉邮电科学研究院湖北武汉　430074
- 作者简介：
- 基金信息：
- DOI：10.13756/j.gtxyj.2005.02.003
  CLC： TN915
- Published：2005，
扫描看全文
[1]海增强,毛谦.基于虚级联的链路容量调整方案[J].光通信研究,2005(02):8-10.

HAI Zeng-qiang, 　MAO Qian. Link capacity adjustment schemes based on virtual concatenation. [J]. (2):8-10(2005)
[1]海增强,毛谦.基于虚级联的链路容量调整方案[J].光通信研究,2005(02):8-10. DOI： 10.13756/j.gtxyj.2005.02.003.

HAI Zeng-qiang, 　MAO Qian. Link capacity adjustment schemes based on virtual concatenation. [J]. (2):8-10(2005) DOI： 10.13756/j.gtxyj.2005.02.003.

摘要

智能化是当前光网络研究的一个热点问题

在同步数字系列（SDH）网络中使用基于虚级联的链路容量调整方案（LCAS）能有效地增强SDH的智能性

减少带宽的浪费

并能增加SDH网络的健壮性。文章讨论了链路容量调整方案的原理及带宽动态调整过程

分析了宿端回送成员状态的产生及传送方式。

Abstract

Intelligence is one of the key points in the study area of optical networks. LCAS can increase the intelligence of SDH network

reduce the waste of bandwidth and increase the robustness of SDH network. In this paper we discussed the principle of link capacity adjustment schemes and the dynamic bandwidth distribution process

and analyzed the generation and transfer mode of the sink member status.

关键词

链路容量调整方案虚级联带宽动态分配

Keywords

link capacity adjustment schemes（LCAS）virtual concatenation（VC）dynamic bandwidth allocation（DBA）

references

更多指标>

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

No data

Related Author

No data

Related Institution

No data

Postal code：430205
Technical support is provided by Beijing Founder electronics co., LTD 鄂ICP备2022010197 鄂公网安备 42011202002092号
It is recommended to read the content of this site in Chrome&IE9+. Please switch to extreme mode in browser 360.
Cookies We use cookies to help provide and enhance our service and tailor content. By continuing, you agree to the use of cookies.
Total Visits：75841 Visits Today：29

⁰