{"title":"IPv4->IPv6 transition: Just to cut the gordian knot? (March 2008)","authors":"Geza Turchanyi, J. Mohácsi","doi":"10.1109/NETWKS.2008.6231312","DOIUrl":"https://doi.org/10.1109/NETWKS.2008.6231312","url":null,"abstract":"The Internet is reaching its limits: within two-four years there will be no previously unallocated IP address left. There is only one solution: new generation of Internet protocol (IPv6) must be massively deployed. Broadband digital subscriber line (DSL) dramatically increases the needs of IP addresses; however, there are even very few ideas how to support IPv6 in this environment. In fact the transition scenarios that had been developed and tested years ago are not exactly adequate in the home user environment, where dynamic IP(v4) addressing is still in use. IPv6 is a must for NGN solutions. The paper reviews the problems and suggests solutions.","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":"122167098","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":"End to end IPTV design and implementation, how to avoid pitfalls","authors":"Rajiv Chaudhuri","doi":"10.1109/NETWKS.2008.4763765","DOIUrl":"https://doi.org/10.1109/NETWKS.2008.4763765","url":null,"abstract":"A collection of slides from the author's seminar presentation is given. The specific areas/topics discussed include: 1. IPTV Business Models and Challenges. 2. Key IPTV Desig n Considerations. 3. Delivering IPTV Services and Quality of Experience. 4. Testing Considerations. 5. Future Directions. 6. Key Messages","PeriodicalId":442274,"journal":{"name":"Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium","volume":"Supplement 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":"130065321","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":"End-to-end delay constrained routing and admission control for MPLS networks","authors":"D. Oulai, S. Chamberland, S. Pierre","doi":"10.1109/NETWKS.2008.4763697","DOIUrl":"https://doi.org/10.1109/NETWKS.2008.4763697","url":null,"abstract":"Dynamic admission control is an important mechanism to guarantee end-to-end quality of service (QoS) for specific Internet protocol (IP) traffic flows in multiprotocol label switching (MPLS) networks. Most of the solutions proposed in the literature target to satisfy the QoS constraints for the new request without considering them for the already admitted flows in the network. In this paper, we propose a joint routing and admission control mechanism for the IP traffic flows in MPLS networks. This mechanism is based on solving exactly a mathematical programming model including end-to-end delay constraints for all traffic flows. Numerical results show that this proposed model can be solved rapidly even for real-size instances of the problem.","PeriodicalId":442274,"journal":{"name":"Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium","volume":"Supplement 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":"129548884","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}
T. Kurosawa, Takehiro Kawata, M. Iwashita, Masayuki Tsujino
{"title":"Traffic estimation with short-term fluctuating component","authors":"T. Kurosawa, Takehiro Kawata, M. Iwashita, Masayuki Tsujino","doi":"10.1109/NETWKS.2008.4763741","DOIUrl":"https://doi.org/10.1109/NETWKS.2008.4763741","url":null,"abstract":"In network design, predicting the fluctuation of the amount of traffic is important to determine the required bandwidth. Measuring traffic volume in a short time interval is one solution. However, the measurement imposes a load on the measurement equipment. This paper shows the methodology of estimation of a short-term fluctuating component by using information about the peak rate of each traffic source. We propose a statistical methodology of estimating the maximum traffic volume and maximum short-term fluctuating component by only using the peak rate of each traffic source and the average traffic volume. This method is very useful for management of a network because the maximum traffic volume is estimated without measuring traffic within a short time interval.","PeriodicalId":442274,"journal":{"name":"Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium","volume":"49 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":"117142196","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":"Driving network transformation: The trends and technologies behind the IP transformation of fixed and mobile networks","authors":"P. Tournassoud","doi":"10.1109/NETWKS.2008.4763747","DOIUrl":"https://doi.org/10.1109/NETWKS.2008.4763747","url":null,"abstract":"","PeriodicalId":442274,"journal":{"name":"Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium","volume":"48 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":"122741399","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}
Akihiro Okada, Akira A. Murashige, Daisuke Tazawa, S. Chaki
{"title":"Access network sharing between core networks with different QoS policies","authors":"Akihiro Okada, Akira A. Murashige, Daisuke Tazawa, S. Chaki","doi":"10.1109/NETWKS.2008.4763667","DOIUrl":"https://doi.org/10.1109/NETWKS.2008.4763667","url":null,"abstract":"This paper discusses the communication quality of a QoS-guaranteed network and a best-effort-based network with a shared access network and proposes guidelines for quality of service (QoS) policies based on some evaluation results. It is proved that the communication quality of the best-effort-based network is degraded in some cases and that the degradation can be reduced by adjusting the QoS class of a specific category of communication. These results will speed up the migration from a conventional best-effort-based network to a QoS-guaranteed network such as the Next Generation Network (NGN).","PeriodicalId":442274,"journal":{"name":"Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium","volume":"Supplement 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":"131106006","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":"Reducing total call-blocking rates by flow admission control based on equality of heterogeneous traffic","authors":"S. Shirata, K. Yamaoka","doi":"10.1109/NETWKS.2008.4763698","DOIUrl":"https://doi.org/10.1109/NETWKS.2008.4763698","url":null,"abstract":"Multimedia applications such as video and audio have recently come into wide use. Because this heterogeneous traffic occupies most networks, call admission control (CAC) is required to maintain high-quality service. User satisfaction depends on the CAC's success in accommodating application flows. However, conventional CACs do not consider user satisfaction because their main purpose is to improve resource utilization. In this paper, we propose a novel CAC to maximize total accommodated flows based on a new philosophy that heterogeneous traffic is fair in networks. Theoretical analysis was used to derive optimal parameters for various traffic configurations. We also carried out numerical analyses to show the effectiveness of our proposed CAC.","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":"131305319","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}
Emil Babics, Éva Csákány, T. Jakab, Rozalia Konkoly, Lajos Szandi
{"title":"Operational databases-related multi-layer network modeling to support network development at Magyar Telekom","authors":"Emil Babics, Éva Csákány, T. Jakab, Rozalia Konkoly, Lajos Szandi","doi":"10.1109/NETWKS.2008.4763709","DOIUrl":"https://doi.org/10.1109/NETWKS.2008.4763709","url":null,"abstract":"Emerging high speed access technologies create conditions for a mass market of broadband IP services. Video, voice and business data transmission need high availability and appropriate packet-level performance from the telecommunications network. To upgrade current IP core and aggregation networks in a cost-effective way to meet enhanced service availability and demanded quality requirements for the above services, a thorough knowledge about the currently available network capabilities provides the starting point. For this purpose an integrated layered model of the existing multi-technology network was developed covering the architecture, logical and physical topologies. In order to have up-to-date data of current operational networks, model attributes have been based practically on the information stored in operational databases. These data structures were originally developed for service and network deployment and for O&M purposes, and have not been adjusted to support planning processes. So the main issue was to derive a unified and consistent planning database, scalable and optimized for the arising planning tasks. By using this integrated model various planning and analysis tools - that were developed to operate on the model - can give considerable support for network development tasks to be performed quickly and efficiently. The paper presents the operational databases-related multi-layer network modeling framework what is used in the practice of Magyar Telekom to support network development.","PeriodicalId":442274,"journal":{"name":"Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium","volume":"25 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":"128919014","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":"Root Controlled Bridging: A scalable control protocol for Shortest Path Bridging","authors":"J. Farkas, Richárd Pallos","doi":"10.1109/NETWKS.2008.4763693","DOIUrl":"https://doi.org/10.1109/NETWKS.2008.4763693","url":null,"abstract":"Standardization bodies are working on the development of new Carrier Ethernet solutions to remove the current scaling limitations and improve network management. One of them is the IEEE 802.1aq Shortest Path Bridging (SPB), which provides the transmission of unicast and multicast frames on the shortest path in a bridged network. In this paper we propose a novel control protocol for link-state SPB, which can be implemented as an extension to Intermediate System to Intermediate System (IS-IS) routing protocol. We show that our proposal solves scalability problems that arise when a link-state control protocol is applied in SPB. Furthermore, the proposed control protocol assures loop free operation, which is essential for Ethernet networks. We also provide a performance analysis of our new control protocol.","PeriodicalId":442274,"journal":{"name":"Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium","volume":"Supplement 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":"128966533","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":"Optimisation methods for dynamic frequency planning in OFDMA networks","authors":"D. López-Pérez, A. Juttner, Jie Zhang","doi":"10.1109/NETWKS.2008.4763671","DOIUrl":"https://doi.org/10.1109/NETWKS.2008.4763671","url":null,"abstract":"To overcome interference, OFDMA networks support different but fixed frequency reuse schemes and subchannel allocation techniques. However, these fixed schemes and techniques are not the most suitable solutions in mobile scenarios, where the behaviour of the channel and the users are continuously changing during the day-time. This paper presents a new approach to the frequency assignment problem adapted to OFDMA networks, called Dynamic Frequency Planning, which in turn may decrease the interference and increase the capacity of the network by around 20%. DFP operates in a regular basis, adapting the network configuration to the time-dependent channel conditions and user requirements. On the other hand, DFP uses novel algorithms to estimate the inputs of the frequency assignment problem and tailored versions of meta-heuristic such as Simulated Annealing and Tabu Search, or Greedy Algorithms to solve it. Further discussion about the trade off between the quality of the solution and computing time when using meta-heuristic or greedy algorithm is provided. This paper also indicates, when running DFP, how to check the improvements in the network performance. Experimental evaluations carried out using system level simulations show the boost in the capacity when using DFP.","PeriodicalId":442274,"journal":{"name":"Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium","volume":"37 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":"124511978","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}