{"title":"A Stochastic Clustering Algorithm for Swarm Compact Routing","authors":"Huaiyuan Ma, O. Wittner, B. Helvik","doi":"10.1109/NGI.2009.5175753","DOIUrl":"https://doi.org/10.1109/NGI.2009.5175753","url":null,"abstract":"The Internet community is still looking for a long term solution for their interdomain routing scalability issues. Compact routing based Algorithms are promising candidates. Cowen's compact routing scheme is the first stretch-3 scheme found. This paper presents a new swarm-based stochastic clustering algorithm based on Cowen's scheme. By simulation and analysis, the stretch distribution of all paths generated by the clustering algorithm is derived. The algorithm is applied as an compact routing scheme on an Internet-like inter-domain topology with 3000 autonomous systems. Conservative analysis (ignoring potential \"short cut\" paths) output an average stretch of 1.04 and an maximum stretch of 3. Further investigations show that more than 90% of all paths have stretch-1. By manual check of all stretch-3 paths, it is found that the source nodes of these paths have more immediate neighbors than they may include in their neighborhood due to Cowen's neighborhood size limit. The simulation results show that each node has around 240 routing entries in total, which is indeed comparable to the Cowen's original scheme.","PeriodicalId":162766,"journal":{"name":"2009 Next Generation Internet Networks","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125284785","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":"A Single Channel Signalling Mechanism for Power/Rate Control in WLANs","authors":"Ali Ibrahim, L. Muscariello, James W. Roberts","doi":"10.1109/NGI.2009.5175752","DOIUrl":"https://doi.org/10.1109/NGI.2009.5175752","url":null,"abstract":"We propose to use joint power and rate control to increase spatial reuse in multi-AP WLANs. An original solution to the problem of learning the necessary characteristics of on-going transmissions is proposed. This consists of an in-channel signalling scheme that identifies the transmitter and conveys its power and rate without the addition of any capacity overhead. We demonstrate by simulation that the potential for capacity gain in the considered context is significant.","PeriodicalId":162766,"journal":{"name":"2009 Next Generation Internet Networks","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125508862","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}
R. Pries, Florian Wamser, D. Staehle, K. Heck, P. Tran-Gia
{"title":"On Traffic Characteristics of a Broadband Wireless Internet Access","authors":"R. Pries, Florian Wamser, D. Staehle, K. Heck, P. Tran-Gia","doi":"10.1109/NGI.2009.5175772","DOIUrl":"https://doi.org/10.1109/NGI.2009.5175772","url":null,"abstract":"Internet traffic measurements and traffic characterization are essential for managing and optimizing network infrastructures. The increasing number of wireless Internet users and the changing application demands require consecutive traffic measurements. Therefore, we have performed measurements of home users at a broadband wireless access service provider in order to reflect the current traffic characteristics. In this paper, we present the results of these measurements like application distributions as well as changing traffic characteristics caused by user demands and new services. The results could be used by a network service provider to optimize its network performance in order to give Quality of Service (QoS) guarantees for home users in its fixed wireless network.","PeriodicalId":162766,"journal":{"name":"2009 Next Generation Internet Networks","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126847730","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}
Konstantinos V. Katsaros, Nikolaos Bartsotas, G. Xylomenos
{"title":"Router Assisted Overlay Multicast","authors":"Konstantinos V. Katsaros, Nikolaos Bartsotas, G. Xylomenos","doi":"10.1109/NGI.2009.5175782","DOIUrl":"https://doi.org/10.1109/NGI.2009.5175782","url":null,"abstract":"While multicasting is considered valuable for content distribution, it is not widely supported on the Internet. Content providers have instead turned to peer assisted content distribution in order to efficiently serve large numbers of clients via unicast, thus removing the bandwidth bottleneck from their side. The redundant unicast transmissions of the same packet are not avoided however, they are just distributed between the peers. Since peer assisted content distribution represents a major fraction of total Internet traffic, a more efficient distribution scheme would be of great interest to users and network operators alike. For this reason, we reconsider overlay multicast as a potential solution for mass content distribution. We present an overlay multicast scheme inspired by Scribe that exploits cooperative access routers so as to improve the multicast content distribution trees produced. We investigate the properties of our scheme compared to both regular Scribe and IP multicast over Internet-like network topologies, via a full fledged simulation platform that can be used as a basis for the realistic evaluation of multicast based content distribution applications.","PeriodicalId":162766,"journal":{"name":"2009 Next Generation Internet Networks","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134056389","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":"Improving Vehicular Delay-Tolerant Network Performance with Relay Nodes","authors":"V. Soares, F. Farahmand, J. Rodrigues","doi":"10.1109/NGI.2009.5175762","DOIUrl":"https://doi.org/10.1109/NGI.2009.5175762","url":null,"abstract":"Vehicular Delay-Tolerant Networking (VDTN) is an extension of the Delay-Tolerant Network (DTN) architecture concept to transit networks. VDTN architecture handles non-real time applications, exploiting vehicles to enable connectivity under unreliable scenarios with unstable links and where an end-to-end path may not exist. Intuitively, the use of stationary store-and-forward devices (relay nodes) located at crossroads where vehicles meet them and should improve the message delivery probability. In this paper, we analyze the influence of the number of relay nodes, in urban scenarios with different numbers of vehicles. It was shown that relay nodes significantly improve the message delivery probability on studied DTN routing protocols.","PeriodicalId":162766,"journal":{"name":"2009 Next Generation Internet Networks","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115425403","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":"Quantifying the Restoration Capacity in Optical Mesh Networks","authors":"C. Pavan, R. Morais, A. Pinto","doi":"10.1109/NGI.2009.5175779","DOIUrl":"https://doi.org/10.1109/NGI.2009.5175779","url":null,"abstract":"The amount of spare capacity for restoration is usually calculated using network design tools. This task depends on the detailed information about the network topology and traffic model. In order to allow a preliminary evaluation of the networks, we propose an approximation to estimate the spare capacity required to a mesh network recover from any single link failure. The expression is based on statistical methods and does not requires knowledge of the network topology. We also provide experimental results evaluating the performance of the proposed approximation against a previous published one and a network design tool.","PeriodicalId":162766,"journal":{"name":"2009 Next Generation Internet Networks","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123194710","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}
D. Remondo, M. Nunes, S. Sargento, M. Cesana, I. Filippini, J. Triay, A. Agusti-Torra, M. D. Andrade, L. Gutierrez, S. Sallent, C. Cervelló-Pastor
{"title":"Integration of Optical and Wireless Technologies in the Metro-Access: QoS Support and Mobility Aspects","authors":"D. Remondo, M. Nunes, S. Sargento, M. Cesana, I. Filippini, J. Triay, A. Agusti-Torra, M. D. Andrade, L. Gutierrez, S. Sallent, C. Cervelló-Pastor","doi":"10.1109/NGI.2009.5175764","DOIUrl":"https://doi.org/10.1109/NGI.2009.5175764","url":null,"abstract":"Future metropolitan and access networks are expected to comprise heterogeneous optical and broadband wireless technologies. The growing demand of users for transparent, ubiquitous access to diverse communication services poses several challenges. We envision a future metro-access architecture that comprises Optical Burst Switching networks that feed Ethernet Passive Optical Networks (PON) or upcoming Wavelength-Division Multiplexing PON, which in turn feed IEEE 802.16 and IEEE 802.11 nodes. Nodes in the wireless realm may communicate in a multihop fashion, forming mesh networks. To maintain cost and resource efficiency, we propose the introduction of Quality of Service (QoS) proxies at the border between different link technologies. These entities handle QoS requirements and aid to the support of mobility. The architecture requires no modification of the Medium Access Control mechanisms of the different technologies.","PeriodicalId":162766,"journal":{"name":"2009 Next Generation Internet Networks","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122697578","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":"Introducing Neutral Access Networks","authors":"A. Bogliolo","doi":"10.1109/NGI.2009.5175765","DOIUrl":"https://doi.org/10.1109/NGI.2009.5175765","url":null,"abstract":"Open access networks (OANs) have been recently proposed as a mean for bridging digital divide and enhance Internet penetration by enabling a fair competition among Internet service providers on a shared access infrastructure. \u0000 \u0000This paper introduces the concept of neutral access networks (NANs), which are a special class of OANs conceived to grant positive externality to the shared infrastructure. Externality creates a positive feedback loop among users, service providers, and network operators which increases market penetration, motivates the development of new services, and promotes the deployment of new access networks. \u0000 \u0000NANs are presented and discussed in terms of business models, market penetration, usage patterns, external benefits, technical feasibility, and legal issues.","PeriodicalId":162766,"journal":{"name":"2009 Next Generation Internet Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130234402","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}
Gilles Bertrand, S. Lahoud, Géraldine Texier, M. Molnár
{"title":"Computation of Multi-Constrained Paths in Multi-Domain MPLS-TE Networks","authors":"Gilles Bertrand, S. Lahoud, Géraldine Texier, M. Molnár","doi":"10.1109/NGI.2009.5175757","DOIUrl":"https://doi.org/10.1109/NGI.2009.5175757","url":null,"abstract":"The present paper proposes a novel method for computing inter-domain paths subject to multiple independent additive constraints in MPLS-TE networks. An efficient solution to this problem is a key element for providing services with guaranteed performance across domain boundaries. However, the inherent hardness of the multi-constrained path computation as well as inter-domain scalability and security constraints complicate the computation problem. We propose a novel algorithm named kID-MCP that tackles the computational complexity of the problem by reducing the number of paths included in the computation process. kID-MCP is compatible with existing techniques and fulfills the security requirements. We undergo a complexity analysis that shows that kID-MCP scales well. Moreover, a simulation study reveals that kID-MCP finds a solution in most situations. These results indicate that the computation of inter-domain multi-constrained paths is tractable in practice, which opens interesting perspectives for QoS routing and traffic engineering among multiple operators.","PeriodicalId":162766,"journal":{"name":"2009 Next Generation Internet Networks","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122273221","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":"Mobility of Sources and Listeners in IP Multicast-enabled Networks","authors":"João Mateiro, S. Sargento, A. Neto, N. Ferreira","doi":"10.1109/NGI.2009.5175766","DOIUrl":"https://doi.org/10.1109/NGI.2009.5175766","url":null,"abstract":"In today's Internet, it can be noticed the increasing demand for group-based multimedia sessions, such as video/audio conferencing, IPTV, push media. Moreover, there is an increasing trend for mobile communications, with large network dynamic events, which require fast resilience to keep, as much as possible, sessions alive over time. In this sense, the bandwidth-constrained data transport scheme of IP multicast allows traffic optimization throughout the network. However, current IP multicast support over mobile communications is not efficient, mainly due to the IP addressing scheme and mobility. If multicast sources mobility is taken into account, then the performance of IP multicast is significantly degraded, due to the requirement for constantly changing the overall multicast tree. \u0000 \u0000In this paper we propose a new solution for agent-based multicast in both sources and listeners mobile environments, called Multicast Teleport (MUTE), which considers the existence of anchor points in the network that provide proxy features, assuming the view of multicast data source inside the network, and establishing independence between listeners and sources movements. MUTE was evaluated in NS-2, and the results show that it is able to provide both multicast sources and listeners mobility with decreased disruption time and increased network performance.","PeriodicalId":162766,"journal":{"name":"2009 Next Generation Internet Networks","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124267703","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}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
