2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)最新文献_第3页

Packing problems in the dimensioning of GMPLS-controlled SDH networks gmpls控制的SDH网络尺寸中的填充问题

2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS) Pub Date : 2010-11-09 DOI: 10.1109/NETWKS.2010.5624945

T. Kárász, L. Bajzik, Z. Lakatos, T. Jakab

引用次数: 1

Shared protection of demands with Physical Impairment Constrained Routing 基于物理损伤约束路由的需求共享保护

2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS) Pub Date : 2010-11-09 DOI: 10.1109/NETWKS.2010.5624951

T. Cinkler, P. Soproni, G. Sallai

引用次数: 7

Optimized IP-based vs. explicit paths for one-to-one backup in MPLS fast reroute 在MPLS快速路由中，优化了基于ip和显式的一对一备份路径

2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS) Pub Date : 2010-11-09 DOI: 10.1109/NETWKS.2010.5624923

M. Pióro, A. Tomaszewski, C. Zukowski, D. Hock, Matthias Hartmann, M. Menth

引用次数: 17

Kalman filter based capacity adaptation for network profit maximization 基于卡尔曼滤波的容量自适应网络利润最大化

2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS) Pub Date : 2010-11-09 DOI: 10.1109/NETWKS.2010.5624942

C. Tran, Z. Dziong

引用次数: 2

Use of cross layer interactions for detecting denial of service attacks in WMN 使用跨层交互检测WMN中的拒绝服务攻击

2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS) Pub Date : 2010-11-09 DOI: 10.1109/NETWKS.2010.5624900

D. Bansal, S. Sofat

引用次数: 6

Performance evaluation of a method to reduce inter-ISP transit cost caused by overlay routing 一种降低覆盖路由引起的isp间传输成本方法的性能评估

2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS) Pub Date : 2010-11-09 DOI: 10.1109/NETWKS.2010.5624928

Kazuhito Matsuda, G. Hasegawa, S. Kamei, M. Murata

{"title":"Performance evaluation of a method to reduce inter-ISP transit cost caused by overlay routing","authors":"Kazuhito Matsuda, G. Hasegawa, S. Kamei, M. Murata","doi":"10.1109/NETWKS.2010.5624928","DOIUrl":"https://doi.org/10.1109/NETWKS.2010.5624928","url":null,"abstract":"Overlay routing is an application-level routing mechanism and existing research has revealed that overlay routing can improve user-perceived performance. On the other hand, overlay routing may harm the ISPs' cost structure because of the policy mismatch between IP routing and overlay routing. In a previous study, we proposed a method to reduce inter-ISP transit cost caused by overlay routing while maintaining the effectiveness of the overlay routing. However, we evaluated the proposed method only in the PlanetLab environment, the node location of which is biased to North America. In addition, the previous evaluation focused only on limiting the degree of increase in the inter-ISP transit cost and did not explicitly consider the performance of the overlay routing. In the present paper, we evaluate the proposed method in more general network environments, which are the generalized PlanetLab environment and the Japanese commercial ISPs network environment. We also evaluate the performance of the proposed method in terms of the trade-off relationships between the overlay routing performance and the inter-ISP transit cost over the entire network. In addition, we discuss the differences in the network properties in both environments, which affect the performance of the proposed method.","PeriodicalId":202408,"journal":{"name":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126836203","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 5

FPGA implementation of the MMRRS scheduling algorithm for VOQ switches 用FPGA实现VOQ交换机的MMRRS调度算法

2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS) Pub Date : 2010-11-09 DOI: 10.1109/NETWKS.2010.5624954

W. Kabaciński, A. Baranowska, Lukasz Rubik

引用次数: 2

LCR solution for performance and cost-efficient inter-domain traffic distribution LCR解决方案的性能和成本效益的跨域流量分配

2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS) Pub Date : 2010-11-09 DOI: 10.1109/NETWKS.2010.5624939

M. Kantor, P. Chołda, A. Jajszczyk

{"title":"LCR solution for performance and cost-efficient inter-domain traffic distribution","authors":"M. Kantor, P. Chołda, A. Jajszczyk","doi":"10.1109/NETWKS.2010.5624939","DOIUrl":"https://doi.org/10.1109/NETWKS.2010.5624939","url":null,"abstract":"In the highly connected Internet most of domains have more than one interconnection link to different providers. In such a multi-homed scenario destinations for inter-domain traffic may be reachable through multiple egress routers with different offered cost and path performance. In this paper, we address the problem of route selection in a multi-homed stub network to optimize transit costs and paths performance offered by operator to its customers. As the indicators of quality of service (QoS) related to interconnections and routes offered by interconnected partners we consider a length of AS-path (Autonomous System) and latency experienced on that path as measured by round-trip-time (RTT). We present some QoS optimization models together with heuristic algorithms to solve the problem. To evaluate the performance of the proposed optimization models a Least Cost Routing (LCR) solution supporting optimal routing decisions has been used. The results indicate that taking into account both cost and performance is crucial for assuring the satisfied level of service for end-users with optimized cost for the operator.","PeriodicalId":202408,"journal":{"name":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114211201","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Link load balancing optimization of telecommunication networks: A column generation based heuristic approach 电信网络链路负载均衡优化:基于列生成的启发式方法

2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS) Pub Date : 2010-11-09 DOI: 10.1109/NETWKS.2010.5624911

Dorabella Santos, Amaro F. de Sousa, F. Alvelos, M. Pióro

{"title":"Link load balancing optimization of telecommunication networks: A column generation based heuristic approach","authors":"Dorabella Santos, Amaro F. de Sousa, F. Alvelos, M. Pióro","doi":"10.1109/NETWKS.2010.5624911","DOIUrl":"https://doi.org/10.1109/NETWKS.2010.5624911","url":null,"abstract":"This paper deals with optimal load balancing in telecommunication networks. For a capacitated telecommunications network with single path routing and an estimated traffic demand matrix, we wish to determine the routing paths aiming at min-max optimization of link loads. To solve this problem, we propose a column (path) generation based heuristic. In the first step, we use column generation to solve a linear programming relaxation of the basic problem (obtaining a lower bound and a set of paths). In the second step, we apply a multi-start local search heuristic with path-relinking to the search space defined by the paths found in the first step. In order to assess the merits of this approach, we also implemented a search heuristic which is equivalent to the second step of the proposed one but with no constraints on the set of paths that can be used. Through a set of computational results, we show that the proposed heuristic is efficient in obtaining near optimal routing solutions within short running times. Moreover, the comparison of the two heuristics show that constraining the search space to the columns given by column generation gives better results since this solution space contains good quality solutions and, due to its size, enables to find them in short running times.","PeriodicalId":202408,"journal":{"name":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115415324","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 9

Design of optical WDM networks 光WDM网络的设计

2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS) Pub Date : 2010-11-09 DOI: 10.1109/NETWKS.2010.5624956

Amal Benhamiche, A. Mahjoub, N. Perrot

引用次数: 3