{"title":"基于in架构的动态路由系统","authors":"G. Fischer, J. Rammer, K. Hofmann","doi":"10.1109/INW.1994.723281","DOIUrl":null,"url":null,"abstract":"A DR (Dynamic Routine) system based on the IN architecture - named IN/DR - is presented. It is well suited for large nonhierarchical meshed networks. An RSF (Route Switching Function) is implemented in a switch called RSP (Route Switching Point), which may be physically identical with an SSP. If the primary route to the destination RSP is blocked, the RSP starts a query via the CCS7 to an external processor called RCP (Routine Control Point), which may be physically identical with an SCP. For each link within its domain, the RCP determines the link occupancy from the time intervals between previous overflowing calls. For a given call attempt, the RCP computes path costs for all allowed routes. The cost is defined in terms of the expectancy of the number of lost calls in the future under the assumption of a certain traffic distribution. The response of the RCP is either an extended \"Connect\"-message containing the optimised routine instruction or a conventional \"Reject\"-messagge. If the DR system contains several RCPs, each RCP shall broadcast its current link occupancy data to all other RCPs in update intervals of 10 sec. For this distribution, a satellite based transmission scheme is recommended. There is one central processor within the DR system named RMS (Routine Management System). The RMS uses destination specific traffic data and network configuration data to compute the tables used by the RCPs during call processing.","PeriodicalId":156912,"journal":{"name":"Workshop on Intelligent Network","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Dynamic Routing System Based on the IN-Architecture\",\"authors\":\"G. Fischer, J. Rammer, K. Hofmann\",\"doi\":\"10.1109/INW.1994.723281\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A DR (Dynamic Routine) system based on the IN architecture - named IN/DR - is presented. It is well suited for large nonhierarchical meshed networks. An RSF (Route Switching Function) is implemented in a switch called RSP (Route Switching Point), which may be physically identical with an SSP. If the primary route to the destination RSP is blocked, the RSP starts a query via the CCS7 to an external processor called RCP (Routine Control Point), which may be physically identical with an SCP. For each link within its domain, the RCP determines the link occupancy from the time intervals between previous overflowing calls. For a given call attempt, the RCP computes path costs for all allowed routes. The cost is defined in terms of the expectancy of the number of lost calls in the future under the assumption of a certain traffic distribution. The response of the RCP is either an extended \\\"Connect\\\"-message containing the optimised routine instruction or a conventional \\\"Reject\\\"-messagge. If the DR system contains several RCPs, each RCP shall broadcast its current link occupancy data to all other RCPs in update intervals of 10 sec. For this distribution, a satellite based transmission scheme is recommended. There is one central processor within the DR system named RMS (Routine Management System). The RMS uses destination specific traffic data and network configuration data to compute the tables used by the RCPs during call processing.\",\"PeriodicalId\":156912,\"journal\":{\"name\":\"Workshop on Intelligent Network\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-05-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Workshop on Intelligent Network\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INW.1994.723281\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Workshop on Intelligent Network","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INW.1994.723281","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
摘要
提出了一种基于IN体系结构的动态例程(DR)系统,命名为IN/DR。它非常适合于大型非分层网状网络。RSF (Route Switching Function)是在一个叫做RSP (Route Switching Point)的交换机中实现的,RSP在物理上可能与SSP相同。如果到达目的RSP的主路由被阻塞,RSP就会通过CCS7向外部处理器RCP (Routine Control Point,例行控制点)发起查询,RCP在物理上可能与SCP相同。对于其域中的每个链路,RCP根据先前溢出调用之间的时间间隔确定链路占用情况。对于给定的呼叫尝试,RCP计算所有允许的路由的路径开销。成本的定义是在一定流量分布的假设下,对未来丢失呼叫数的期望。RCP的响应要么是包含优化例程指令的扩展“连接”消息,要么是常规的“拒绝”消息。如果DR系统包含多个RCP,每个RCP应以10秒的更新间隔向所有其他RCP广播其当前链路占用数据。对于这种分发,建议采用基于卫星的传输方案。DR系统中有一个名为RMS(例行管理系统)的中央处理器。RMS使用特定于目的地的流量数据和网络配置数据来计算rcp在呼叫处理期间使用的表。
A Dynamic Routing System Based on the IN-Architecture
A DR (Dynamic Routine) system based on the IN architecture - named IN/DR - is presented. It is well suited for large nonhierarchical meshed networks. An RSF (Route Switching Function) is implemented in a switch called RSP (Route Switching Point), which may be physically identical with an SSP. If the primary route to the destination RSP is blocked, the RSP starts a query via the CCS7 to an external processor called RCP (Routine Control Point), which may be physically identical with an SCP. For each link within its domain, the RCP determines the link occupancy from the time intervals between previous overflowing calls. For a given call attempt, the RCP computes path costs for all allowed routes. The cost is defined in terms of the expectancy of the number of lost calls in the future under the assumption of a certain traffic distribution. The response of the RCP is either an extended "Connect"-message containing the optimised routine instruction or a conventional "Reject"-messagge. If the DR system contains several RCPs, each RCP shall broadcast its current link occupancy data to all other RCPs in update intervals of 10 sec. For this distribution, a satellite based transmission scheme is recommended. There is one central processor within the DR system named RMS (Routine Management System). The RMS uses destination specific traffic data and network configuration data to compute the tables used by the RCPs during call processing.