{"title":"分段路由中的报头大小和转发表优化混合方法","authors":"Anushree Roy;Tania Sarkar;Pranav Kumar Singh;Ranjan Maity","doi":"10.1109/LNET.2023.3305247","DOIUrl":null,"url":null,"abstract":"Segment Routing is a source routing paradigm that simplifies packet forwarding and management across networks. Two major challenges of segment routing are the limitation of header stack size and the size of the Forwarding Table specific to each node. It has been observed that there is a trade-off between these two factors. In this letter, we have addressed this trade-off and presented a mechanism to minimize the stack size as well as the forwarding table. Instead of individual Segment IDs used in traditional segment routing, unique Path IDs are considered. This reduces the size of the header stack to one irrespective of the number of segments in the path. To reduce the size of the forwarding table, a forwarding technique based on matrix operations is used. Our approach also works on the reliability issues in forwarding and guarantees 100% successful packet forwarding.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"5 4","pages":"275-278"},"PeriodicalIF":0.0000,"publicationDate":"2023-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Hybrid Approach to Header Size and Forwarding Table Optimization in Segment Routing\",\"authors\":\"Anushree Roy;Tania Sarkar;Pranav Kumar Singh;Ranjan Maity\",\"doi\":\"10.1109/LNET.2023.3305247\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Segment Routing is a source routing paradigm that simplifies packet forwarding and management across networks. Two major challenges of segment routing are the limitation of header stack size and the size of the Forwarding Table specific to each node. It has been observed that there is a trade-off between these two factors. In this letter, we have addressed this trade-off and presented a mechanism to minimize the stack size as well as the forwarding table. Instead of individual Segment IDs used in traditional segment routing, unique Path IDs are considered. This reduces the size of the header stack to one irrespective of the number of segments in the path. To reduce the size of the forwarding table, a forwarding technique based on matrix operations is used. Our approach also works on the reliability issues in forwarding and guarantees 100% successful packet forwarding.\",\"PeriodicalId\":100628,\"journal\":{\"name\":\"IEEE Networking Letters\",\"volume\":\"5 4\",\"pages\":\"275-278\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-08-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Networking Letters\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10217032/\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Networking Letters","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10217032/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
网段路由是一种源路由范例,可简化网络中的数据包转发和管理。段路由的两大挑战是报头堆栈大小的限制和每个节点特定的转发表的大小。据观察,这两个因素之间存在权衡。在这封信中,我们解决了这一权衡问题,并提出了一种将堆栈大小和转发表最小化的机制。我们考虑使用唯一的路径 ID 代替传统段路由中使用的单个段 ID。这样,无论路径上有多少网段,报头堆栈的大小都会减小到一个。为了减少转发表的大小,我们采用了基于矩阵运算的转发技术。我们的方法还能解决转发中的可靠性问题,并保证数据包 100% 成功转发。
A Hybrid Approach to Header Size and Forwarding Table Optimization in Segment Routing
Segment Routing is a source routing paradigm that simplifies packet forwarding and management across networks. Two major challenges of segment routing are the limitation of header stack size and the size of the Forwarding Table specific to each node. It has been observed that there is a trade-off between these two factors. In this letter, we have addressed this trade-off and presented a mechanism to minimize the stack size as well as the forwarding table. Instead of individual Segment IDs used in traditional segment routing, unique Path IDs are considered. This reduces the size of the header stack to one irrespective of the number of segments in the path. To reduce the size of the forwarding table, a forwarding technique based on matrix operations is used. Our approach also works on the reliability issues in forwarding and guarantees 100% successful packet forwarding.