无分组对齐全光变长分组交换的时隙模型

S. Liew, A. Tan, E. R. Tee
{"title":"无分组对齐全光变长分组交换的时隙模型","authors":"S. Liew, A. Tan, E. R. Tee","doi":"10.1109/AMS.2008.45","DOIUrl":null,"url":null,"abstract":"This paper studies an all-optical slot-switching model that is able to accommodate variable-length optical packets without the necessity for packet alignment. This is called the variable-length-packet fixed-length-slot (VPFS) switching scheme. In a VPFS network, all switches adopt the same slot size but slot boundaries are not synchronized from one switch to another. When a packet of any length arrives at a switch, a slot or multiple consecutive slots must be assigned to carry that packet from the input to the destined output, with the condition that the chain of slots carrying the packet cannot be broken up and routed separately in the switch. Given a selected slot size, s, and the average length of packet, x, we show that the expected arrival overhead of a packet due to asynchronous slot boundary is equal to s, thus the maximum throughput of the VPFS scheme is limited to x/(x +s). Although a small slot size is preferable in order to maximize the throughput, the challenge of switching is a compromise. The proposed model can be used for evaluating the performances of different variable-length optical packet switching scenarios.","PeriodicalId":122964,"journal":{"name":"2008 Second Asia International Conference on Modelling & Simulation (AMS)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Time Slotted Model for All-Optical Variable-Length Packet Switching without Packet Alignment\",\"authors\":\"S. Liew, A. Tan, E. R. Tee\",\"doi\":\"10.1109/AMS.2008.45\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper studies an all-optical slot-switching model that is able to accommodate variable-length optical packets without the necessity for packet alignment. This is called the variable-length-packet fixed-length-slot (VPFS) switching scheme. In a VPFS network, all switches adopt the same slot size but slot boundaries are not synchronized from one switch to another. When a packet of any length arrives at a switch, a slot or multiple consecutive slots must be assigned to carry that packet from the input to the destined output, with the condition that the chain of slots carrying the packet cannot be broken up and routed separately in the switch. Given a selected slot size, s, and the average length of packet, x, we show that the expected arrival overhead of a packet due to asynchronous slot boundary is equal to s, thus the maximum throughput of the VPFS scheme is limited to x/(x +s). Although a small slot size is preferable in order to maximize the throughput, the challenge of switching is a compromise. The proposed model can be used for evaluating the performances of different variable-length optical packet switching scenarios.\",\"PeriodicalId\":122964,\"journal\":{\"name\":\"2008 Second Asia International Conference on Modelling & Simulation (AMS)\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-05-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 Second Asia International Conference on Modelling & Simulation (AMS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AMS.2008.45\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Second Asia International Conference on Modelling & Simulation (AMS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AMS.2008.45","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文研究了一种能够适应变长光分组而不需要分组对齐的全光槽交换模型。这被称为可变长度分组固定长度槽(VPFS)交换方案。在VPFS网络中,所有交换机都采用相同的槽位大小,但槽位边界在交换机之间并不同步。当任何长度的数据包到达交换机时,必须分配一个或多个连续的插槽来将该数据包从输入端传送到目标输出端,条件是承载数据包的插槽链不能在交换机中被打破或单独路由。给定选定的槽大小s和数据包的平均长度x,我们表明由于异步槽边界导致的数据包的预期到达开销等于s,因此VPFS方案的最大吞吐量被限制为x/(x +s)。虽然为了最大限度地提高吞吐量,较小的插槽尺寸是可取的,但交换的挑战是一种妥协。该模型可用于评估不同变长光分组交换场景下的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Time Slotted Model for All-Optical Variable-Length Packet Switching without Packet Alignment
This paper studies an all-optical slot-switching model that is able to accommodate variable-length optical packets without the necessity for packet alignment. This is called the variable-length-packet fixed-length-slot (VPFS) switching scheme. In a VPFS network, all switches adopt the same slot size but slot boundaries are not synchronized from one switch to another. When a packet of any length arrives at a switch, a slot or multiple consecutive slots must be assigned to carry that packet from the input to the destined output, with the condition that the chain of slots carrying the packet cannot be broken up and routed separately in the switch. Given a selected slot size, s, and the average length of packet, x, we show that the expected arrival overhead of a packet due to asynchronous slot boundary is equal to s, thus the maximum throughput of the VPFS scheme is limited to x/(x +s). Although a small slot size is preferable in order to maximize the throughput, the challenge of switching is a compromise. The proposed model can be used for evaluating the performances of different variable-length optical packet switching scenarios.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信