{"title":"网络直径与平均节点间距离之比的紧边界","authors":"B. Parhami","doi":"10.1109/IEMCON.2018.8614796","DOIUrl":null,"url":null,"abstract":"The average internode distance for a network is fairly difficult to derive. There is often no closed-form formula for this parameter, leading to the need for simulation-based derivation methods. Network diameter, by contrast, is relatively easier to determine and, for many networks of common interest, we have closed-form formulas for it. The bounds established in this paper show that the two parameters are usually not totally independent and that, from a practical standpoint, network diameter can be used in lieu of average internode distance for the evaluation of message-routing algorithms and assessment or comparison of communication performance, particularly for symmetric networks that are prevalent in many parallel systems.","PeriodicalId":368939,"journal":{"name":"2018 IEEE 9th Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Tight Bounds on the Ratio of Network Diameter to Average Internode Distance\",\"authors\":\"B. Parhami\",\"doi\":\"10.1109/IEMCON.2018.8614796\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The average internode distance for a network is fairly difficult to derive. There is often no closed-form formula for this parameter, leading to the need for simulation-based derivation methods. Network diameter, by contrast, is relatively easier to determine and, for many networks of common interest, we have closed-form formulas for it. The bounds established in this paper show that the two parameters are usually not totally independent and that, from a practical standpoint, network diameter can be used in lieu of average internode distance for the evaluation of message-routing algorithms and assessment or comparison of communication performance, particularly for symmetric networks that are prevalent in many parallel systems.\",\"PeriodicalId\":368939,\"journal\":{\"name\":\"2018 IEEE 9th Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON)\",\"volume\":\"80 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE 9th Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IEMCON.2018.8614796\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 9th Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IEMCON.2018.8614796","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Tight Bounds on the Ratio of Network Diameter to Average Internode Distance
The average internode distance for a network is fairly difficult to derive. There is often no closed-form formula for this parameter, leading to the need for simulation-based derivation methods. Network diameter, by contrast, is relatively easier to determine and, for many networks of common interest, we have closed-form formulas for it. The bounds established in this paper show that the two parameters are usually not totally independent and that, from a practical standpoint, network diameter can be used in lieu of average internode distance for the evaluation of message-routing algorithms and assessment or comparison of communication performance, particularly for symmetric networks that are prevalent in many parallel systems.