{"title":"基于dinloop的基于MPLS的域间组播","authors":"Huaqun Guo, L. Ngoh, L. Wong","doi":"10.1109/ISCC.2005.8","DOIUrl":null,"url":null,"abstract":"To overcome scalability and control overhead problems existing in inter-domain multicast, DINloop (data-in-network loop) based multicast with MPLS is proposed. DINloop is a special logical path formed using MPLS label switched paths and it consists of multiple DIN nodes which are core routers that connect to each intra-domain. We use DINloop to manage inter-domain multicast group membership. Facilitated by the DINloop, multiple DIN nodes in the core network easily form a Steiner tree for multicast traffic. Furthermore, traffic for different multicast groups sharing the same path are aggregated through a label stack. Simulations demonstrate that DINloop-based multicast results in less message load needed to form the multicast structure. In addition, the routing table size in other core routers does not increase as the number of multicast group increases, and therefore routing scalability is improved. Finally, the inter-domain multicast delay in DINloop-based multicast is lower than that of a unidirectional tree.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A DINloop-based inter-domain multicast using MPLS\",\"authors\":\"Huaqun Guo, L. Ngoh, L. Wong\",\"doi\":\"10.1109/ISCC.2005.8\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To overcome scalability and control overhead problems existing in inter-domain multicast, DINloop (data-in-network loop) based multicast with MPLS is proposed. DINloop is a special logical path formed using MPLS label switched paths and it consists of multiple DIN nodes which are core routers that connect to each intra-domain. We use DINloop to manage inter-domain multicast group membership. Facilitated by the DINloop, multiple DIN nodes in the core network easily form a Steiner tree for multicast traffic. Furthermore, traffic for different multicast groups sharing the same path are aggregated through a label stack. Simulations demonstrate that DINloop-based multicast results in less message load needed to form the multicast structure. In addition, the routing table size in other core routers does not increase as the number of multicast group increases, and therefore routing scalability is improved. Finally, the inter-domain multicast delay in DINloop-based multicast is lower than that of a unidirectional tree.\",\"PeriodicalId\":315855,\"journal\":{\"name\":\"10th IEEE Symposium on Computers and Communications (ISCC'05)\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"10th IEEE Symposium on Computers and Communications (ISCC'05)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCC.2005.8\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"10th IEEE Symposium on Computers and Communications (ISCC'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCC.2005.8","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
To overcome scalability and control overhead problems existing in inter-domain multicast, DINloop (data-in-network loop) based multicast with MPLS is proposed. DINloop is a special logical path formed using MPLS label switched paths and it consists of multiple DIN nodes which are core routers that connect to each intra-domain. We use DINloop to manage inter-domain multicast group membership. Facilitated by the DINloop, multiple DIN nodes in the core network easily form a Steiner tree for multicast traffic. Furthermore, traffic for different multicast groups sharing the same path are aggregated through a label stack. Simulations demonstrate that DINloop-based multicast results in less message load needed to form the multicast structure. In addition, the routing table size in other core routers does not increase as the number of multicast group increases, and therefore routing scalability is improved. Finally, the inter-domain multicast delay in DINloop-based multicast is lower than that of a unidirectional tree.