{"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}
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.