{"title":"Volume oriented routing","authors":"M. Żotkiewicz, W. Ben-Ameur","doi":"10.1109/NETWKS.2010.5624920","DOIUrl":"https://doi.org/10.1109/NETWKS.2010.5624920","url":null,"abstract":"Assuming that the traffic matrix belongs to a polytope, we present a new routing paradigm where each traffic demand is routed independently of the other demands. The routing of each demand is a combination of two extreme routing depending on the current volume of the demand. This new routing paradigm is easy to implement in networks and quite efficient in terms of network cost.","PeriodicalId":202408,"journal":{"name":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","volume":"21 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":"131648132","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}
{"title":"Dynamic migration planning towards FTTH","authors":"R. Zhao, Liwei Zhou, C. Mas Machuca","doi":"10.1109/NETWKS.2010.5624904","DOIUrl":"https://doi.org/10.1109/NETWKS.2010.5624904","url":null,"abstract":"This paper addresses the dynamic migration strategy towards FTTH. A complete and generalized migration model is proposed, subject to intermediate steps, different migration paths and various time schedules. To find the best migration path, a techno-economic study is fulfilled in terms of technologies, time-dependent CAPEX, OPEX, revenue, and time period. For the migration to FTTH, several fixed access technologies are taken as multiple intermediate steps, which lead to a nonlinear optimization problem. Based on previous cost-revenue modelling, VBA is applied to implement this migration problem. Different scenarios have been studied and discussed, including optimal migration paths and key parameters. Furthermore, the proposed strategy for one-/multi-step migration process can be extended for other Next Generation Network (NGN) migration problems.","PeriodicalId":202408,"journal":{"name":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","volume":"123 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":"125366064","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}
{"title":"CAPEX savings of homing architectures considering OTN equipment","authors":"E. Palkopoulou, D. Schupke, T. Bauschert","doi":"10.1109/NETWKS.2010.5624918","DOIUrl":"https://doi.org/10.1109/NETWKS.2010.5624918","url":null,"abstract":"Alternative homing architectures can lead to significant cost reductions. These reductions are quantified using linear programming under a multi-layer consideration. In this paper we focus on the CAPEX savings achieved by transitioning to different homing architectures in an IP-over-OTN setting. The impact of traffic demand is examined for different reference networks. Additionally, it is shown that depending on the examined topology, the inclusion of regenerators in the cost optimization influences the break-even point between IP-over-WDM and IP-over-OTN network architecture considerations.","PeriodicalId":202408,"journal":{"name":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","volume":"37 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":"115153061","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}
{"title":"Information Hiding Using Improper frame padding","authors":"B. Jankowski, W. Mazurczyk, K. Szczypiorski","doi":"10.1109/NETWKS.2010.5624901","DOIUrl":"https://doi.org/10.1109/NETWKS.2010.5624901","url":null,"abstract":"Hiding information in network traffic may lead to leakage of confidential information. In this paper we introduce a new steganographic system: the PadSteg (Padding Steganography). To authors' best knowledge it is the first information hiding solution which represents inter-protocol steganography i.e. usage of relation between two or more protocols from the TCP/IP stack to enable secret communication. PadSteg utilizes ARP and TCP protocols together with an Etherleak vulnerability (improper Ethernet frame padding) to facilitate secret communication for hidden groups in LANs (Local Area Networks). Basing on real network traces we confirm that PadSteg is feasible in today's networks and we estimate what steganographic bandwidth is achievable while limiting the chance of disclosure. We also point at possible countermeasures against PadSteg.","PeriodicalId":202408,"journal":{"name":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124705539","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}