发布求助
文献互助 智能选刊 最新文献

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

筛选
英文 中文
A new penalty based algorithm for multi-user Spectrum Balancing in xDSL networks 一种新的基于惩罚的xDSL多用户频谱均衡算法
Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium Pub Date : 2008-09-01 DOI: 10.1109/NETWKS.2008.4763665
Alastair McKinley, A. Marshall
{"title":"A new penalty based algorithm for multi-user Spectrum Balancing in xDSL networks","authors":"Alastair McKinley, A. Marshall","doi":"10.1109/NETWKS.2008.4763665","DOIUrl":"https://doi.org/10.1109/NETWKS.2008.4763665","url":null,"abstract":"This work presents a new algorithm for Dynamic Spectrum Management (DSM) in Digital Subscriber Lines. Previous approaches have achieved high performance by attempting to directly solve or approximate the multiuser spectrum optimisation problem. These methods suffer from a high or intractable computational complexity for even a moderate number of DSL lines. A new method is proposed which is a heuristic extension of the single user greedy algorithm applied to the multi-user case. The new algorithm incorporates a novel cost function that penalises crosstalk as well as considering the usefulness of a tone. Simulation results are presented and it is shown that the new method achieves results within a few percent of the optimal solution for a range of scenarios.","PeriodicalId":442274,"journal":{"name":"Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium","volume":"1 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":"123195834","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
PBoT: An analytical model of P2P traffic based on transactions PBoT:基于事务的P2P流量分析模型
Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium Pub Date : 2008-09-01 DOI: 10.1109/NETWKS.2008.6231372
Ramon Salguero, G. Bias, M., Garcia Osma, Maeso Martin-Carnerero, Enriquez
{"title":"PBoT: An analytical model of P2P traffic based on transactions","authors":"Ramon Salguero, G. Bias, M., Garcia Osma, Maeso Martin-Carnerero, Enriquez","doi":"10.1109/NETWKS.2008.6231372","DOIUrl":"https://doi.org/10.1109/NETWKS.2008.6231372","url":null,"abstract":"Nowadays Peer-to-Peer (P2P) file-sharing has not only become the dominant source of traffic in the Internet but also an increasingly common way of distributing contents commercially over IP networks, revealing the need of reaching a level of understanding of the behaviour and performance of the different P2P applications similar to that already achieved for other Internet services such as web browsing. This paper contributes to fulfil this task by introducing a simple analytical model that enables the study of P2P file-sharing systems in terms of performance, global behaviour, and the impact of their traffic on the networks. This paper also presents simulation results that will show the accuracy of the presented analytical model and will provide some practical insights on the behaviour of P2P systems, which can be of interest for P2P application designers and network engineers.","PeriodicalId":442274,"journal":{"name":"Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium","volume":"8 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":"123810924","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
Peer-to-peer and other service overlay networks on the Internet 点对点和其他服务覆盖互联网上的网络
Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium Pub Date : 2008-09-01 DOI: 10.1109/NETWKS.2008.4763760
G. Haßlinger
{"title":"Peer-to-peer and other service overlay networks on the Internet","authors":"G. Haßlinger","doi":"10.1109/NETWKS.2008.4763760","DOIUrl":"https://doi.org/10.1109/NETWKS.2008.4763760","url":null,"abstract":"","PeriodicalId":442274,"journal":{"name":"Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium","volume":"61 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":"126250035","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
Access network dimensioning with uncertain traffic forecasts 具有不确定流量预测的接入网尺寸
Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium Pub Date : 2008-09-01 DOI: 10.1109/NETWKS.2008.4763664
O. Klopfenstein
{"title":"Access network dimensioning with uncertain traffic forecasts","authors":"O. Klopfenstein","doi":"10.1109/NETWKS.2008.4763664","DOIUrl":"https://doi.org/10.1109/NETWKS.2008.4763664","url":null,"abstract":"Network planning remains a recurrent and critical task for telecommunication operators. One of the difficulties is to deal with traffic forecasts. Indeed, these data are often not reliable, in the sense that they do not fit well the occurring reality. The aim of the present paper is to provide mathematical models for access network planning, which take account of forecast uncertainty. Taking advantage of classical stochastic programming models, equations are derived to characterize a network dimensioning able to accommodate the traffic with a targeted probability. Several probabilistic frameworks are proposed. Finally, preliminary numerical results are given on a realistic instance. They illustrate the possible benefit of the proposed approach.","PeriodicalId":442274,"journal":{"name":"Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium","volume":"36 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":"124434932","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}
引用次数: 3
Practical steps in techno-economic evaluation of network deployment planning part 1: Methodology overview 网络部署计划技术经济评估的实际步骤。第1部分:方法概述
Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium Pub Date : 2008-09-01 DOI: 10.1109/NETWKS.2008.4763757
S. Verbrugge, K. Casier, J. Van Ooteghem, B. Lannoo
{"title":"Practical steps in techno-economic evaluation of network deployment planning part 1: Methodology overview","authors":"S. Verbrugge, K. Casier, J. Van Ooteghem, B. Lannoo","doi":"10.1109/NETWKS.2008.4763757","DOIUrl":"https://doi.org/10.1109/NETWKS.2008.4763757","url":null,"abstract":"Provides an abstract for each of the tutorial presentations and a brief professional biography of each presenter. The complete presentations were not made available for publication as part of the conference proceedings.","PeriodicalId":442274,"journal":{"name":"Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium","volume":"24 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":"130111067","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}
引用次数: 39
SRLG-disjoint multi-path protection: When LP meets ILP srsg -disjoint多路径保护:当LP遇到ILP时
Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium Pub Date : 2008-09-01 DOI: 10.1109/NETWKS.2008.4763716
L. Gyarmati, T. Cinkler, G. Sallai
{"title":"SRLG-disjoint multi-path protection: When LP meets ILP","authors":"L. Gyarmati, T. Cinkler, G. Sallai","doi":"10.1109/NETWKS.2008.4763716","DOIUrl":"https://doi.org/10.1109/NETWKS.2008.4763716","url":null,"abstract":"Multi-Path Routing routes the upcoming demand over multiple paths. This is feasible in networks where the demand can be split into multiple parallel flows, i.e., the network is capable to perform inverse multiplexing (e.g., ngSDH and OTN via VCat) and where the connectivity of the topology also allows it.","PeriodicalId":442274,"journal":{"name":"Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium","volume":"1 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":"130322789","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
Network resilience requirements and algorithms for multicasting and broadcasting digital TV 多播和广播数字电视的网络弹性要求和算法
Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium Pub Date : 2008-09-01 DOI: 10.1109/NETWKS.2008.4763711
J. Gimenez, R. Duque, P. Soproni, M. Perényi, János Tapolcai, P. Fodor, A. Gulyás, Jose Hernandez, J. A. Rico, R. Gruenzinger
{"title":"Network resilience requirements and algorithms for multicasting and broadcasting digital TV","authors":"J. Gimenez, R. Duque, P. Soproni, M. Perényi, János Tapolcai, P. Fodor, A. Gulyás, Jose Hernandez, J. A. Rico, R. Gruenzinger","doi":"10.1109/NETWKS.2008.4763711","DOIUrl":"https://doi.org/10.1109/NETWKS.2008.4763711","url":null,"abstract":"In this paper we give an overview of the network architecture and of the resilience requirements for both, metro and core networks.","PeriodicalId":442274,"journal":{"name":"Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium","volume":"36 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":"127753850","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
Flow optimization in IP networks with fast proactive recovery 具有快速主动恢复的IP网络流量优化
Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium Pub Date : 2008-09-01 DOI: 10.1109/NETWKS.2008.6231351
M. Dzida, M. Zagozdzon, M. Żotkiewicz, M. Pióro
{"title":"Flow optimization in IP networks with fast proactive recovery","authors":"M. Dzida, M. Zagozdzon, M. Żotkiewicz, M. Pióro","doi":"10.1109/NETWKS.2008.6231351","DOIUrl":"https://doi.org/10.1109/NETWKS.2008.6231351","url":null,"abstract":"The post-failure convergence of the shortest path routing (SPR) protocols used in IP networks can be too slow to meet the restrictive requirements (i.e., maximum allowable delay, jitter, etc.) of the multimedia services and therefore new restoration mechanisms combined with IP routing are of interest. The paper addresses optimization of three potential rerouting mechanisms based on the IP fast reroute mechanism proposed by Shand and Bryant [1]. The first mechanism takes advantage of equal-cost multiple (shortest) paths (ECMP) where two or more ECMP paths outgoing from one router can be used to protect one another in the IP fast reroute mechanism. Due to a limited number of the ECMP paths, the ECMP protection cannot be used as a stand-alone rerouting mechanism which assures protection against all link failures. Therefore, two other mechanisms, called loop-free alternate (LFA) and multi-hop repair path (MHRP) are considered. The LFA protection consists in determining an alternative next-hop address used in the case of a link failure. MHRP is a generalization of LFA which uses multi-hop tunnels to redirect packets from the failing link to a router that is able to send them to the destination based on a shortest path based forwarding. For each of the mechanisms we formulate an appropriate optimization problem as a mixed integer program (MIP). Moreover, we consider a combined approach where protection is assured through ECMP paths, LFA next-hop addresses, or MHRP paths. Thanks to the variety of protection mechanisms, the IP fast reroute technique is able to provide protection for any single link failure. The associated optimization problem (consisting in a simultaneous optimization of a weight system, LFA alternative next-hop addresses and MHRP paths) is difficult and is thus approached with a heuristic method. In our numerical experiments we evaluate effectiveness of this method.","PeriodicalId":442274,"journal":{"name":"Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium","volume":"59 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":"133754351","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}
引用次数: 7
Hierarchical routing on unstructured identifiers 基于非结构化标识符的分层路由
Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium Pub Date : 2008-09-01 DOI: 10.1109/NETWKS.2008.4763695
G. Németh, János Tapolcai, A. Császár
{"title":"Hierarchical routing on unstructured identifiers","authors":"G. Németh, János Tapolcai, A. Császár","doi":"10.1109/NETWKS.2008.4763695","DOIUrl":"https://doi.org/10.1109/NETWKS.2008.4763695","url":null,"abstract":"In this paper we follow the vision that the IP address hierarchy is going to collapse and propose a novel routing and addressing method based on non-structured addresses. The proposed concept, called HUId, clearly separates intra-domain routing (i.e., routing between hosts within a network domain) and inter-domain routing (i.e., routing between networks). The separation is based on two different routing mechanisms and having two different identifiers. The scope of these identifiers, however, are not disjunct. This simple framework helps eliminating the need for a protocol covering and managing the border links. This paper investigates the benefits of such an architecture and mechanisms like mapping and fail-over with site multi-homing. Finally, we elaborate on reusing existing technologies to give a simple implementation guideline.","PeriodicalId":442274,"journal":{"name":"Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium","volume":"80 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":"134563569","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
Convergence: Challenges in regulation 趋同:监管的挑战
Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium Pub Date : 2008-09-01 DOI: 10.1109/NETWKS.2008.6231375
Chris Fonteijn
{"title":"Convergence: Challenges in regulation","authors":"Chris Fonteijn","doi":"10.1109/NETWKS.2008.6231375","DOIUrl":"https://doi.org/10.1109/NETWKS.2008.6231375","url":null,"abstract":"A collection of slides from the author's PowerPoint presentation is provided.","PeriodicalId":442274,"journal":{"name":"Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium","volume":"1 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":"133906716","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信