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

2007 First International Symposium on Advanced Networks and Telecommunication Systems最新文献

筛选
英文 中文
Characterization of a new copper cable for next generation dsl systems 下一代dsl系统用新型铜缆的特性分析
2007 First International Symposium on Advanced Networks and Telecommunication Systems Pub Date : 2007-12-01 DOI: 10.1109/ANTS.2007.4655339
Kalpesh Patel, Sandrine Francois, M. Gagnaire
{"title":"Characterization of a new copper cable for next generation dsl systems","authors":"Kalpesh Patel, Sandrine Francois, M. Gagnaire","doi":"10.1109/ANTS.2007.4655339","DOIUrl":"https://doi.org/10.1109/ANTS.2007.4655339","url":null,"abstract":"The emergence of ADSL2+ and VDSL2 seems to have outlined the limits of xDSL access systems for bit rates greater than 10 Mbps over copper wires in the last mile. Meanwhile, very recent advances in the field of modulation techniques and line codes such as VDSL3 based on vectored transmission enable to surpass this limit [1]. In this paper, one investigates a different approach enabling to increase the capacity of ADSL2+ access systems by means of a new copper cable. In a first step, we describe the characteristics of the new generation Nexans copper cable. We then outline both theoretically and experimentally the performance provided by this innovation.","PeriodicalId":148616,"journal":{"name":"2007 First International Symposium on Advanced Networks and Telecommunication Systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115765668","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
Carrier ethernet - state of art and challenges ahead 载波以太网——技术现状和未来的挑战
2007 First International Symposium on Advanced Networks and Telecommunication Systems Pub Date : 2007-12-01 DOI: 10.1109/ANTS.2007.4655285
K. Kulkarni, G. Venkatesan
{"title":"Carrier ethernet - state of art and challenges ahead","authors":"K. Kulkarni, G. Venkatesan","doi":"10.1109/ANTS.2007.4655285","DOIUrl":"https://doi.org/10.1109/ANTS.2007.4655285","url":null,"abstract":"Many carriers are already offering Metro Ethernet services at a fraction of the cost of TDM services. Many are also in the midst of effecting major Network transformations involving Carrier Ethernet to gear up to NGN service and transport requirements. Carrier Ethernet improves operational efficiencies and provides ability to be a launch pad for newer services. As part of the various Industry forum and Standards body initiatives, Ethernet has got increasingly ¿sanitized¿ (¿Sonetized and ATMized¿) to acquire some of the proven carrier grade characteristics from SONET/SDH and ATM technologies. Still, Ethernet as a Carrier Transport technology has some outstanding challenges to be solved before it can be deployed as a singular technology to address all network and application service requirements","PeriodicalId":148616,"journal":{"name":"2007 First International Symposium on Advanced Networks and Telecommunication Systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117087730","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
An analysis of IP Multimedia Subsystems (IMS) IP多媒体子系统(IMS)分析
2007 First International Symposium on Advanced Networks and Telecommunication Systems Pub Date : 2007-12-01 DOI: 10.1109/ANTS.2007.4620219
L.N. Saleem, S. Mohan
{"title":"An analysis of IP Multimedia Subsystems (IMS)","authors":"L.N. Saleem, S. Mohan","doi":"10.1109/ANTS.2007.4620219","DOIUrl":"https://doi.org/10.1109/ANTS.2007.4620219","url":null,"abstract":"This paper analyzes the complexity of IP multimedia subsystems (IMS) proposed by 3GPP/3GPP2. Using two different mobility models, the paper provides a methodology to determine the number of accesses to the IMS servers. The analysis considers mobility of users across registration areas, which generates IMS registration requests as well as signaling to IMS servers due to service requests initiated by users. This analysis is intended to guide network architects and designers in sizing IMS deployments and to help them improve the utilization of IMS systems.","PeriodicalId":148616,"journal":{"name":"2007 First International Symposium on Advanced Networks and Telecommunication Systems","volume":"19 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129738984","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
Min-cost tree for multi-resource manycast in mesh networks 网状网络中多资源多播最小代价树
2007 First International Symposium on Advanced Networks and Telecommunication Systems Pub Date : 2007-12-01 DOI: 10.1109/ANTS.2007.4655341
Qingya She, J. Jue
{"title":"Min-cost tree for multi-resource manycast in mesh networks","authors":"Qingya She, J. Jue","doi":"10.1109/ANTS.2007.4655341","DOIUrl":"https://doi.org/10.1109/ANTS.2007.4655341","url":null,"abstract":"We present and investigate the problem of finding a min-cost tree for multi-resource manycast in mesh networks. In the traditional manycast problem, or the K-MST problem, the goal is to find a minimum cost tree that spans any k vertices; however, in the min-cost tree multi-resource manycast problem, the objective is to find a minimum cost tree that spans any k computing resources distributed throughout the network, where each node may have multiple computing resources. Simple polynomial-time heuristic algorithms are proposed for the problem of min-cost tree multi-resource manycast. The effectiveness of the proposed schemes is evaluated through simulation.","PeriodicalId":148616,"journal":{"name":"2007 First International Symposium on Advanced Networks and Telecommunication Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121401492","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
How to buy a network: Towards an economically sustainable interconnection of optical networks 如何购买网络:走向经济可持续的光网络互连
2007 First International Symposium on Advanced Networks and Telecommunication Systems Pub Date : 2007-12-01 DOI: 10.1109/ANTS.2007.4620195
A. Jukan, V. Prevelakis, J. Altmann
{"title":"How to buy a network: Towards an economically sustainable interconnection of optical networks","authors":"A. Jukan, V. Prevelakis, J. Altmann","doi":"10.1109/ANTS.2007.4620195","DOIUrl":"https://doi.org/10.1109/ANTS.2007.4620195","url":null,"abstract":"While the adoption of the Internet by businesses suggests that there are clear economic implications in provisioning of not just connectivity but also customized network services, the economic considerations have not yet found a way of driving the changes to the current optical architectures. The limiting factor is the missing technology. We propose a solution with resource exchange points (RXPs).","PeriodicalId":148616,"journal":{"name":"2007 First International Symposium on Advanced Networks and Telecommunication Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123969914","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
Performance of high-speed TCP applications in networks with very small buffers 高速TCP应用程序在缓冲区非常小的网络中的性能
2007 First International Symposium on Advanced Networks and Telecommunication Systems Pub Date : 2007-12-01 DOI: 10.1109/ANTS.2007.4620212
Ben Zhao, A. Vishwanath, V. Sivaraman
{"title":"Performance of high-speed TCP applications in networks with very small buffers","authors":"Ben Zhao, A. Vishwanath, V. Sivaraman","doi":"10.1109/ANTS.2007.4620212","DOIUrl":"https://doi.org/10.1109/ANTS.2007.4620212","url":null,"abstract":"In the on-going debate on how large Internet router buffers should be, of particular interest is a recent claim that 10-50 packets of buffering suffice, permitting all-optical buffering in the Internet core. It is argued that TCP traffic, when well-paced (typically by slow access links), can achieve acceptable link utilisation with very small buffers. In this paper we investigate if this result holds in the presence of high-performance scientific applications connecting over high-speed access links. Our results show that the presence of a significant proportion of high-speed access links necessitates larger buffers at the core link. However, we show that end-host TCP pacing by such applications can alleviate the problem effectively.","PeriodicalId":148616,"journal":{"name":"2007 First International Symposium on Advanced Networks and Telecommunication Systems","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124729117","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
An iterative greedy algorithm for scheduled traffic grooming in wdm optical networks wdm光网络中调度业务疏导的迭代贪心算法
2007 First International Symposium on Advanced Networks and Telecommunication Systems Pub Date : 2007-12-01 DOI: 10.1109/ANTS.2007.4655282
M. Gagnaire, E. Doumith
{"title":"An iterative greedy algorithm for scheduled traffic grooming in wdm optical networks","authors":"M. Gagnaire, E. Doumith","doi":"10.1109/ANTS.2007.4655282","DOIUrl":"https://doi.org/10.1109/ANTS.2007.4655282","url":null,"abstract":"Routing and wavelength allocation (RWA) in translucent WDM optical networks aims at optimizing network¿s resources utilization. Traffic grooming, traffic rerouting, wavelength conversion and regenerator placement are some of the key operations enabling such an optimization. Two types of traffic grooming are considered in WDM networks, either optical or electrical. In this paper, we propose an innovative greedy iterative algorithm enabling to aggregate in the electrical domain scheduled traffic demands in order to favors a better bandwidth utilization of the optical channels to be set-up in the network. For a same set of traffic scenarios, we compare the cost of the resources required in the network, either by means of our algorithm or by means of two other greedy iterative algorithms recently proposed in the literature. The optical fiber infrastructure being installed, we consider the network cost as proportional to the global number of required optical ports and electrical ports at the various switching nodes.","PeriodicalId":148616,"journal":{"name":"2007 First International Symposium on Advanced Networks and Telecommunication Systems","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122898879","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
ROADM-based restoration with bounded end hops 基于roadm的有界端跳恢复
2007 First International Symposium on Advanced Networks and Telecommunication Systems Pub Date : 2007-12-01 DOI: 10.1109/ANTS.2007.4655340
D. Schupke
{"title":"ROADM-based restoration with bounded end hops","authors":"D. Schupke","doi":"10.1109/ANTS.2007.4655340","DOIUrl":"https://doi.org/10.1109/ANTS.2007.4655340","url":null,"abstract":"Some Reconfigurable Optical Add/Drop Multiplexer (ROADM) types impose restrictions in switching a path. This paper considers restoration by ROADMs with the limitation of bounded path end hops. In particular unprotected connections can enhance availability by such restoration.","PeriodicalId":148616,"journal":{"name":"2007 First International Symposium on Advanced Networks and Telecommunication Systems","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133249554","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
Service-oriented communications in optical networks using virtual switching 使用虚拟交换的光网络中面向服务的通信
2007 First International Symposium on Advanced Networks and Telecommunication Systems Pub Date : 2007-12-01 DOI: 10.1109/ANTS.2007.4620196
S. Zheng, A. Gumaste, Jianping Wang
{"title":"Service-oriented communications in optical networks using virtual switching","authors":"S. Zheng, A. Gumaste, Jianping Wang","doi":"10.1109/ANTS.2007.4620196","DOIUrl":"https://doi.org/10.1109/ANTS.2007.4620196","url":null,"abstract":"In this paper, the authors focus on wide-area wired networks, especially the Internet. The performance of such a network is mainly determined by the capacity (bandwidth) of its links, and the latency of transmitted data encountered at intermediate nodes. These nodes are referred to as switching nodes, or simply switches.","PeriodicalId":148616,"journal":{"name":"2007 First International Symposium on Advanced Networks and Telecommunication Systems","volume":"12 38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124645461","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
Performance improvement using linecoding in a subcarrier multiplexed optical fiber link impaired by optical beat interference 在受光拍干扰的子载波多路光纤链路中使用线编码改进性能
2007 First International Symposium on Advanced Networks and Telecommunication Systems Pub Date : 2007-12-01 DOI: 10.1109/ANTS.2007.4655279
M. Alam, S. Majumder
{"title":"Performance improvement using linecoding in a subcarrier multiplexed optical fiber link impaired by optical beat interference","authors":"M. Alam, S. Majumder","doi":"10.1109/ANTS.2007.4655279","DOIUrl":"https://doi.org/10.1109/ANTS.2007.4655279","url":null,"abstract":"The performance analysis is presented for an optical direct detection link with RF subcarrier multiplexing (SCM) considering the effect of optical beat interference (OBI) with different linecoding. The results show that there is significant reduction in OBI induced power penalty by virtue of Miller coding","PeriodicalId":148616,"journal":{"name":"2007 First International Symposium on Advanced Networks and Telecommunication Systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123041498","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学术官方微信
小红书