Chun Zhang, J. Kurose, D. Towsley, Zihui Ge, Yong Liu
{"title":"具有多个流量矩阵的最优路由在平均和最差情况下的性能之间进行权衡","authors":"Chun Zhang, J. Kurose, D. Towsley, Zihui Ge, Yong Liu","doi":"10.1109/ICNP.2005.30","DOIUrl":null,"url":null,"abstract":"In this paper, we consider the problem of finding an \"efficient\" and \"robust\" set of routes in the face of changing/uncertain traffic. The changes/uncertainty in exogenous traffic is characterized by multiple traffic matrices. Our goal is to find a set of routes that result in good average case performance over the set of traffic matrices, while avoiding bad worst case performance for any single traffic matrix. With multiple traffic matrices, previous work aims solely to optimize the average case performance Chun Zhang, et al., (2005), or the worst case performance David Applegate, et al., (2003). For a given set of traffic matrices, different sets of routes offer a different tradeoff between the average case and the worst case performance. In this paper, we quantify the performance of a routing configuration at both network level and link level. We propose a simple metric-a weighted sum of the average case and the worst case performance-to control the tradeoff between these two considerations. Despite of its simple form, this metric is very effective. We prove that optimizing routing using this metric has desirable properties, such as the average case performance being a decreasing, convex and differentiable function to the worst case performance. By extending previous work Chun Zhang, et al., (2005) Bernard Fortz, et al., (2002), we derive methods to find the optimal routes with respect to the proposed metric for two classes of intra-domain routing protocols: MPLS and OSPF/IS-IS. We evaluate our approach with data collected from an operational tier-I ISP. For MPLS, we find that there exists significant tradeoff (e.g., 15%-23% difference) between optimizing solely on the average case performance and solely on the worst case performance. Our approach can identify solutions that can dramatically improve the worst case performance (13%-15%) while only slightly sacrificing the average case performance (2.2%-3%), in comparison to that by optimizing solely on the average case performance. For OSPF/IS-IS, we still find a significant difference between the two optimization objectives, however, a fine-grained tradeoff is difficult to achieve due to the limited control that OSPF/IS-IS provide.","PeriodicalId":191961,"journal":{"name":"13TH IEEE International Conference on Network Protocols (ICNP'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"51","resultStr":"{\"title\":\"Optimal routing with multiple traffic matrices tradeoff between average and worst case performance\",\"authors\":\"Chun Zhang, J. Kurose, D. Towsley, Zihui Ge, Yong Liu\",\"doi\":\"10.1109/ICNP.2005.30\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we consider the problem of finding an \\\"efficient\\\" and \\\"robust\\\" set of routes in the face of changing/uncertain traffic. The changes/uncertainty in exogenous traffic is characterized by multiple traffic matrices. Our goal is to find a set of routes that result in good average case performance over the set of traffic matrices, while avoiding bad worst case performance for any single traffic matrix. With multiple traffic matrices, previous work aims solely to optimize the average case performance Chun Zhang, et al., (2005), or the worst case performance David Applegate, et al., (2003). For a given set of traffic matrices, different sets of routes offer a different tradeoff between the average case and the worst case performance. In this paper, we quantify the performance of a routing configuration at both network level and link level. We propose a simple metric-a weighted sum of the average case and the worst case performance-to control the tradeoff between these two considerations. Despite of its simple form, this metric is very effective. We prove that optimizing routing using this metric has desirable properties, such as the average case performance being a decreasing, convex and differentiable function to the worst case performance. By extending previous work Chun Zhang, et al., (2005) Bernard Fortz, et al., (2002), we derive methods to find the optimal routes with respect to the proposed metric for two classes of intra-domain routing protocols: MPLS and OSPF/IS-IS. We evaluate our approach with data collected from an operational tier-I ISP. For MPLS, we find that there exists significant tradeoff (e.g., 15%-23% difference) between optimizing solely on the average case performance and solely on the worst case performance. Our approach can identify solutions that can dramatically improve the worst case performance (13%-15%) while only slightly sacrificing the average case performance (2.2%-3%), in comparison to that by optimizing solely on the average case performance. For OSPF/IS-IS, we still find a significant difference between the two optimization objectives, however, a fine-grained tradeoff is difficult to achieve due to the limited control that OSPF/IS-IS provide.\",\"PeriodicalId\":191961,\"journal\":{\"name\":\"13TH IEEE International Conference on Network Protocols (ICNP'05)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-11-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"51\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"13TH IEEE International Conference on Network Protocols (ICNP'05)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNP.2005.30\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"13TH IEEE International Conference on Network Protocols (ICNP'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNP.2005.30","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 51
摘要
在本文中,我们考虑了在面对变化/不确定的交通时寻找一组“高效”和“鲁棒”的路线的问题。外生流量的变化/不确定性由多个流量矩阵表征。我们的目标是找到一组路由,在一组流量矩阵上产生良好的平均情况性能,同时避免任何单个流量矩阵的最差情况性能。对于多个流量矩阵,以前的工作仅旨在优化平均情况下的性能Chun Zhang等人(2005),或最坏情况下的性能David Applegate等人(2003)。对于给定的一组流量矩阵,不同的路由集在平均情况和最差情况性能之间提供了不同的权衡。在本文中,我们量化了路由配置在网络级和链路级的性能。我们提出了一个简单的度量——平均情况和最差情况性能的加权和——来控制这两个考虑因素之间的权衡。尽管它的形式简单,但这个指标非常有效。我们证明了使用此度量优化路由具有理想的性质,例如平均情况性能是最坏情况性能的递减凸函数和可微函数。通过扩展以前的工作,Chun Zhang等人(2005)Bernard Fortz等人(2002),我们导出了针对两类域内路由协议(MPLS和OSPF/IS-IS)的建议度量找到最佳路由的方法。我们使用从运营的第一级ISP收集的数据来评估我们的方法。对于MPLS,我们发现在仅优化平均情况性能和仅优化最差情况性能之间存在显著的权衡(例如,15%-23%的差异)。我们的方法可以识别出可以显著提高最差情况下的性能(13%-15%),同时只略微牺牲平均情况下的性能(2.2%-3%)的解决方案,而不是仅仅优化平均情况下的性能。对于OSPF/ is - is,我们仍然发现两个优化目标之间存在显著差异,然而,由于OSPF/ is - is提供的有限控制,很难实现细粒度的权衡。
Optimal routing with multiple traffic matrices tradeoff between average and worst case performance
In this paper, we consider the problem of finding an "efficient" and "robust" set of routes in the face of changing/uncertain traffic. The changes/uncertainty in exogenous traffic is characterized by multiple traffic matrices. Our goal is to find a set of routes that result in good average case performance over the set of traffic matrices, while avoiding bad worst case performance for any single traffic matrix. With multiple traffic matrices, previous work aims solely to optimize the average case performance Chun Zhang, et al., (2005), or the worst case performance David Applegate, et al., (2003). For a given set of traffic matrices, different sets of routes offer a different tradeoff between the average case and the worst case performance. In this paper, we quantify the performance of a routing configuration at both network level and link level. We propose a simple metric-a weighted sum of the average case and the worst case performance-to control the tradeoff between these two considerations. Despite of its simple form, this metric is very effective. We prove that optimizing routing using this metric has desirable properties, such as the average case performance being a decreasing, convex and differentiable function to the worst case performance. By extending previous work Chun Zhang, et al., (2005) Bernard Fortz, et al., (2002), we derive methods to find the optimal routes with respect to the proposed metric for two classes of intra-domain routing protocols: MPLS and OSPF/IS-IS. We evaluate our approach with data collected from an operational tier-I ISP. For MPLS, we find that there exists significant tradeoff (e.g., 15%-23% difference) between optimizing solely on the average case performance and solely on the worst case performance. Our approach can identify solutions that can dramatically improve the worst case performance (13%-15%) while only slightly sacrificing the average case performance (2.2%-3%), in comparison to that by optimizing solely on the average case performance. For OSPF/IS-IS, we still find a significant difference between the two optimization objectives, however, a fine-grained tradeoff is difficult to achieve due to the limited control that OSPF/IS-IS provide.