Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium最新文献_第4页

IPv6 tutorial

Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium Pub Date : 2008-09-01 DOI: 10.1109/eit.2010.5612092

Janos Mohacsi

引用次数: 2

Carrier Ethernet transport in metro and core networks 城域网和核心网中的载波以太网传输

Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium Pub Date : 2008-09-01 DOI: 10.1109/NETWKS.2008.4763766

C. Gruber, A. Autenrieth

引用次数: 6

Modeling and simulation techniques to optimize costs of migrating to NGNs 建模和仿真技术优化迁移到ngn的成本

Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium Pub Date : 2008-09-01 DOI: 10.1109/NETWKS.2008.6231319

D. Mongeau, J. W. McKnight, J. Schaefer, P. P. Wu

{"title":"Modeling and simulation techniques to optimize costs of migrating to NGNs","authors":"D. Mongeau, J. W. McKnight, J. Schaefer, P. P. Wu","doi":"10.1109/NETWKS.2008.6231319","DOIUrl":"https://doi.org/10.1109/NETWKS.2008.6231319","url":null,"abstract":"Migrating to next-generation networks (NGNs) presents challenges that are quite distinct from those to designing and deploying the networks. The challenges are distinguished first and foremost by touching subscribers and second by being highly resource-intensive. The first attribute drives a need for precise, reliable migration planning, so that the actual subscriber moves will be executed flawlessly. The second attribute drives a need for a detailed understanding of cost-bearing activities in the scope of migration. Together they create a high level of execution complexity. Just think of the large number of complex interdependencies related to migrating thousands of switch centers, night after night, moving millions of subscribers over a period of two to three years. This paper addresses the problems of how to understand and manage these complexities and to optimize the associated costs, when migrating to NGN and mobile broadband. It promotes the use of advanced process engineering, modeling and simulation techniques as sources of solutions to these problems. Four modeling and simulation techniques are presented. Each is the result of a decision or trade-off a network operator has faced in undertaking a migration program. These techniques have helped to accelerate decision-making and reduce risks to operators' businesses and customers.","PeriodicalId":442274,"journal":{"name":"Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126569758","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}

引用次数: 0

Traffic Engineering in case of interconnected and integrated layers 层互联、层集成情况下的流量工程

Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium Pub Date : 2008-09-01 DOI: 10.1109/NETWKS.2008.4763708

P. Hegyi, T. Cinkler, N. Sengezer, Ezhan Karasan

引用次数: 4

Analysis and improvement of transport protocol fairness 传输协议公平性的分析与改进

Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium Pub Date : 2008-09-01 DOI: 10.1109/NETWKS.2008.4763739

D. Tegze, C. Horváth, G. Hosszú, F. Kovács

{"title":"Analysis and improvement of transport protocol fairness","authors":"D. Tegze, C. Horváth, G. Hosszú, F. Kovács","doi":"10.1109/NETWKS.2008.4763739","DOIUrl":"https://doi.org/10.1109/NETWKS.2008.4763739","url":null,"abstract":"Fundamental congestion control methods of Internet are based on reactive methods. The principle of these algorithms is the closed loop control of control theory, namely they measure parameters of the network and feed some information back to the sender. This feedback determinates the sending rate of competing flows. Currently most methods make use of per-flow feedback. This type of feedback cannot give strict guarantees on fair allocation of network resources inherently. One of the most important design and operational objective of transport protocols is the fair and efficient utilization of network resources. This is the main motivation for performance analysis of transport protocols. This paper presents the newly developed control method called Balancer that is designed to provide fair bandwidth allocation for transport layer data flows. The mechanism is implemented in the SimCast simulation environment. The method is based on the global knowledge of outgoing sending rate of controlled flows. The paper demonstrates the basics of this endpoint based congestion control. We prove the efficiency of the developed method through simulation results.","PeriodicalId":442274,"journal":{"name":"Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126463360","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}

引用次数: 0

Modeling and simulation of the performance of distributed video services 分布式视频业务性能的建模与仿真

Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium Pub Date : 2008-09-01 DOI: 10.1109/NETWKS.2008.5496392

P. Kárpáti, Tibor Szkaliczki, Laszlo Boszirmenyi

引用次数: 0

Precise location prediction algorithms using improved random walk-based and generalized Markovian mobility models 基于改进随机行走和广义马尔可夫移动模型的精确位置预测算法

Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium Pub Date : 2008-09-01 DOI: 10.1109/NETWKS.2008.4763675

Károly Lendvai, P. Fulop, S. Szabó, T. Szálka

引用次数: 2

A practical approach to network planning using both operational and optimization tools 使用操作和优化工具进行网络规划的实用方法

Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium Pub Date : 2008-09-01 DOI: 10.1109/NETWKS.2008.4763734

N. Perrot, V. Chandrakumar, L. Burity, S. Nicaisse

引用次数: 0

An advanced timing attack scheme on RSA 一种针对RSA的高级定时攻击方案

Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium Pub Date : 2008-09-01 DOI: 10.1109/NETWKS.2008.4763727

Rudolf Tóth, Z. Faigl, M. Szalay, S. Imre

{"title":"An advanced timing attack scheme on RSA","authors":"Rudolf Tóth, Z. Faigl, M. Szalay, S. Imre","doi":"10.1109/NETWKS.2008.4763727","DOIUrl":"https://doi.org/10.1109/NETWKS.2008.4763727","url":null,"abstract":"This paper describes an advanced timing attack scheme on cryptographic algorithms. An attacker can use our method to break a cryptographic algorithm by reconstructing the secret key. The paper contains a detailed explanation of our novel algorithm, furthermore, a practical example for its use. As a proof-of-concept, the method is shown on a specific implementation of the RSA algorithm revealing a 128-bit secret key. Timing attacks assume that the attacker has partial or full knowledge of the internal structure of the attacked algorithm and have gathered time-specific information on a number of known messages, that were encrypted or decrypted with the specific key. In our simplified proof-of-concept example, the attacker knows the total number of extra-reduction steps of the Montgomery multiplication in the RSA for a number of known messages. We demonstrate in practice how this information can be used to achieve complete and fast key recovery with statistical tools, i.e. analysis of variance (ANOVA) and t-test. Similar timing attacks have already been presented by others, however to our knowledge, none of them applied these statistical tools in their methods with such efficiency, and showed the complete recovery in practice by attacking the Montgomery multiplication. However, this is not the main contribution of the paper. The main contribution is, that we have introduced the new concept of key trees and goodness values, which lets the recovery algorithm examine only a very small key space, even if the decision criteria for guessing the key bits are highly biased. This concept can be extended to any other timing attack.","PeriodicalId":442274,"journal":{"name":"Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133314594","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}

引用次数: 12

Understanding the impacts of short-term dynamics on long-term fairness of competing high speed TCP flows: A root-cause analysis 理解短期动态对竞争的高速TCP流的长期公平性的影响:根本原因分析

Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium Pub Date : 2008-09-01 DOI: 10.1109/NETWKS.2008.4763740

Balázs Sonkoly, T. Trinh, S. Molnár

{"title":"Understanding the impacts of short-term dynamics on long-term fairness of competing high speed TCP flows: A root-cause analysis","authors":"Balázs Sonkoly, T. Trinh, S. Molnár","doi":"10.1109/NETWKS.2008.4763740","DOIUrl":"https://doi.org/10.1109/NETWKS.2008.4763740","url":null,"abstract":"The short-term dynamics of competing high speed TCP flows can have strong impacts on their long-term fairness. This leads to severe problems for both the co-existence and the deployment feasibility of different proposals for the next generation networks. However, to our best knowledge, no root-cause analysis of the observation is available. In this paper, we try to fill this gap by providing an in-depth root-cause analysis of this phenomenon. We demonstrate that the widely used Jain's index as a fairness metric can not provide sufficient characterization of the phenomena. More precisely, Jain's index does not reflect the dynamic flow behaviors, e.g., starting time of the flows. We provide an analytical and simulation study to show the importance of the flow dynamics on fairness. We also propose a new metric called saturation time for fairness characterization. Both AIMD-based (HighSpeed TCP, BIC TCP) and MIMD-based (Scalable TCP) TCP versions are investigated in different topologies, namely dumb-bell and parking-lot topologies. In extreme cases, we also analyze and explain the “starving” effect of competing high speed TCP flows, when a flow forces other flows to deviate from their proper operation.","PeriodicalId":442274,"journal":{"name":"Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133376325","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}

引用次数: 2