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

筛选
英文 中文
VIBox - Virtualized Internets-in-a-box: A tool for network planning experimentation VIBox——虚拟internet -in- A -box:用于网络规划实验的工具
B. Melander, Jan-Erik Mångs, Hareesh Puthalath, V. Souza, Martin Johansson, Daniel Oman
{"title":"VIBox - Virtualized Internets-in-a-box: A tool for network planning experimentation","authors":"B. Melander, Jan-Erik Mångs, Hareesh Puthalath, V. Souza, Martin Johansson, Daniel Oman","doi":"10.1109/NETWKS.2010.5624934","DOIUrl":"https://doi.org/10.1109/NETWKS.2010.5624934","url":null,"abstract":"The simplistic design of the original Internet is being slowly replaced by the presence of advanced middleboxes that are introduced in the network. While some of these middleboxes are transparent and passively monitor the network, others can directly affect the data traffic (e.g., content accelerators). Forecasting user and middlebox traffic patterns are usually done through oversimplified models and sometimes unrealistic assumptions. In this context, network planning and dimensioning has become a complicated and sophisticated task. Even though virtualization technology today allows one to build experimental networks that can aid the task of network planning, this is hindered by lack of adequate functions in existing virtualization platforms. Amongst those functions are the support for refined network configurations and modification of software and operating system configurations running inside a virtual machine. In this paper we present VIBox, a tool for network planning experimentation that aims at creating virtual networks in a simple and user-friendly way.","PeriodicalId":202408,"journal":{"name":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","volume":"1 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":"115946181","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
Economics of a convergent optical backbone transport with NG-OTN 具有NG-OTN的汇聚光骨干传输的经济性
M. Mezhoudi, Ying Hu
{"title":"Economics of a convergent optical backbone transport with NG-OTN","authors":"M. Mezhoudi, Ying Hu","doi":"10.1109/NETWKS.2010.5624917","DOIUrl":"https://doi.org/10.1109/NETWKS.2010.5624917","url":null,"abstract":"In planning the evolution and transformation of optical transport networks, operators are faced with multiple difficult choices in terms of the network design and optimization with emerging technologies and transition strategy to achieve higher flexibility, scalability and resiliency at minimum expenditures. We attempt to answer these critical questions by means of a practical methodology. We demonstrate that a converged transport network architecture with Next-Generation Optical Transport Network (NG-OTN) technologies meets the carrier's requirements at minimum capital investment. We support this network transformation solution with a comprehensive case study of the evolution of an actual service provider's optical backbone network with a realistic service mix, traffic growth and cost models. The network transformation introduces the convergence of multiple services and transport layers using NG-OTN technologies, and performs a network design optimization to meet the scalability, flexibility and resiliency requirements while minimizing the investment in infrastructure and network operations.","PeriodicalId":202408,"journal":{"name":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","volume":"23 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120930533","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}
引用次数: 4
The mobile data explosion and new approaches to network planning and monetization 移动数据爆炸以及网络规划和货币化的新方法
Rati C. Thanawala, M. El-Sayed, T. Morawski, Amit Mukhopadhyay, John Zhao, Carlos Urrutia-Valdés
{"title":"The mobile data explosion and new approaches to network planning and monetization","authors":"Rati C. Thanawala, M. El-Sayed, T. Morawski, Amit Mukhopadhyay, John Zhao, Carlos Urrutia-Valdés","doi":"10.1109/NETWKS.2010.5624926","DOIUrl":"https://doi.org/10.1109/NETWKS.2010.5624926","url":null,"abstract":"The rapid introduction of new mobile data services presents many challenges to wireless service providers. Unlike voice services, whose traffic characteristics are well understood, new data services are far more volatile and their demand on network resources is harder to predict. Data volumes are exploding and impacting not only the ability of the network to support such traffic but are also driving down operator's gross margins. Bell Labs has done analysis around some key solutions to deal with this situation. Insights gained through this work will be shared in this paper.","PeriodicalId":202408,"journal":{"name":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","volume":"39 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":"127916479","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}
引用次数: 4
A new clustering algorithm for MANETs 一种新的manet聚类算法
Kaouther Drira, H. Kheddouci
{"title":"A new clustering algorithm for MANETs","authors":"Kaouther Drira, H. Kheddouci","doi":"10.1109/NETWKS.2010.5624941","DOIUrl":"https://doi.org/10.1109/NETWKS.2010.5624941","url":null,"abstract":"Mobile Ad hoc Network (MANET) is the cooperative engagement of a collection of wireless mobile nodes without the support of any centralized access point or existing infrastructure. The use of virtual topologies is a good alternative to build wireless multi-hop networks. It aims to maintain a topology that optimizes broadcasting or network performances. The problem is to determine an appropriate topology for ad hoc networks. This paper proposes a methodology for building distributed and dynamic virtual topology in ad hoc networks based on the concept of dominating sets. Dominating nodes are used to form a tree structure inside the clusters where the root of the tree is the cluster-head. The idea is to form a clustered network over which communication protocol can be efficiently designed.","PeriodicalId":202408,"journal":{"name":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","volume":"31 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":"134303790","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
Routing tree construction in WiMAX mesh networks WiMAX网状网络中路由树的构建
Jerzy C. Nowinski, P. Gajowniczek
{"title":"Routing tree construction in WiMAX mesh networks","authors":"Jerzy C. Nowinski, P. Gajowniczek","doi":"10.1109/NETWKS.2010.5624930","DOIUrl":"https://doi.org/10.1109/NETWKS.2010.5624930","url":null,"abstract":"In the paper we investigate the methods of constructing the routing tree in WiMAX networks with mesh topology. The concept of network efficiency optimization by building the routing tree characterized by selected topological properties that are independent on network load is presented. As an important partial result, correlations between topological parameters of the tree and network efficiency have been estimated. The parameters exhibiting the strongest correlations allow creation of well performing routing trees by optimizing the tree topology only. In order to estimate the network performance under load a fast, modular WiMAX network simulator has been created.","PeriodicalId":202408,"journal":{"name":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","volume":"173 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":"131752513","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
COSTA: A model to analyze next generation broadband access platform competition COSTA:一个分析下一代宽带接入平台竞争的模型
A. Vergara, A. Moral, Jorge Pérez
{"title":"COSTA: A model to analyze next generation broadband access platform competition","authors":"A. Vergara, A. Moral, Jorge Pérez","doi":"10.1109/NETWKS.2010.5624919","DOIUrl":"https://doi.org/10.1109/NETWKS.2010.5624919","url":null,"abstract":"The roll-out of next generation access networks is a complex process which depends not only on technical or commercial factors, but also on market conditions and regulatory decisions. The path adopted by the different agents towards the new networks will not be homogeneous, neither about technologies and platforms, nor the commercial model or roll-out strategies. These elements will depend on expectations on investment recovery, competitive dynamics of different markets and specific issues confronted by the different agents.","PeriodicalId":202408,"journal":{"name":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","volume":"59 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":"127807199","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}
引用次数: 6
On the design problem of two-level IP networks 关于两级IP网络的设计问题
S. Chamberland
{"title":"On the design problem of two-level IP networks","authors":"S. Chamberland","doi":"10.1109/NETWKS.2010.5624943","DOIUrl":"https://doi.org/10.1109/NETWKS.2010.5624943","url":null,"abstract":"In this paper, we propose to tackle the design problem of two-level metropolitan Internet protocol (IP) networks with modular routers including the design of the points of presence. We first propose a model that deals with selecting the number of routers and their types to install in each point of presence, selecting the interface card types to install in each router, finding the access and the backbone networks, interconnecting the routers in each point of presence, selecting the link types and finally, routing the traffic. The objective is to find the minimum cost network. Moreover, we consider that a minimum information rate (in bps) is guaranteed between each pair of clients for the normal state of the network and for the failure scenarios of interest to the network planner. A tabu search metaheuristic algorithm is proposed to find near-optimal approximate solutions of the model. Finally, we present numerical results to assess the performance of the proposed algorithm.","PeriodicalId":202408,"journal":{"name":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","volume":"27 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":"125351478","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
Scheduling content multicast trees with minimal repetitions 以最小的重复调度内容组播树
S. Bessler, Lukas F. Lang, Nysret Musliu
{"title":"Scheduling content multicast trees with minimal repetitions","authors":"S. Bessler, Lukas F. Lang, Nysret Musliu","doi":"10.1109/NETWKS.2010.5624910","DOIUrl":"https://doi.org/10.1109/NETWKS.2010.5624910","url":null,"abstract":"This paper discusses an approach for distributing a large number of multimedia (video) titles to users located at the leaves of a tree network. The proposed approach is to build multicast trees, over which the content files are sent to user disks, followed by delayed local playback of the content. The work concentrates on exact and heuristic methods for an efficient tree packing in several download periods. In order to satisfy all the requests accumulated in a certain time period, we choose to minimize the number of times a multicast tree is split because of capacity constrains. We show that this objective provides lowest link utilization and good convergence both in the integer formulation and in the developed heuristics (of type tabu search, iterated local search, and variable neighborhood search). The model can be also used in a planning setting to answer the question on the maximum user request rate that can be supported by a certain network topology.","PeriodicalId":202408,"journal":{"name":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","volume":"23 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":"125420420","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
Multi-layer aspects in modeling bandwidth trading 带宽交易建模的多层方面
W. Stanczuk, J. Lubacz
{"title":"Multi-layer aspects in modeling bandwidth trading","authors":"W. Stanczuk, J. Lubacz","doi":"10.1109/NETWKS.2010.5624907","DOIUrl":"https://doi.org/10.1109/NETWKS.2010.5624907","url":null,"abstract":"The paper discusses alternative approaches to introduce multi-layer relations between network resources in balancing demand and supply in a bandwidth market. Two multi-commodity double auction models have been presented with illustrative examples.","PeriodicalId":202408,"journal":{"name":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","volume":"194 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":"114993050","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
Joint optimization of anycast and unicast flows in survivable optical networks 可生存光网络中任意播流和单播流的联合优化
K. Walkowiak, J. Rak
{"title":"Joint optimization of anycast and unicast flows in survivable optical networks","authors":"K. Walkowiak, J. Rak","doi":"10.1109/NETWKS.2010.5624959","DOIUrl":"https://doi.org/10.1109/NETWKS.2010.5624959","url":null,"abstract":"Most of previous research on survivable networks has been related to unicast communications. In this paper we propose a new approach to network survivability of anycast communications. To the best of our knowledge, anycast defined as one-to-one-of-many technique has not received much attention recently. To provide network survivability, we use the single backup path approach, i.e. each demand has two node-disjoint paths to provide protection against a single node failure. We formulate new ILP models to find the optimal paths for anycast and unicast connections. To test the proposed approach, we run extensive numerical experiments using CPLEX solver on four example network topologies with different scenarios of number of replica servers, and the proportion between unicast and anycast traffic. Obtained results show the efficiency of our solution in terms of various parameters including cost, path length, resource utilization, and time of computation.","PeriodicalId":202408,"journal":{"name":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","volume":"1 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":"116790847","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}
引用次数: 8
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信