{"title":"Differentiated crosslayer network mapping in multilayered network architectures","authors":"Peera Pacharintanakul, D. Tipper","doi":"10.1109/NETWKS.2010.5624908","DOIUrl":"https://doi.org/10.1109/NETWKS.2010.5624908","url":null,"abstract":"The unifying network architecture has contributed to a wave of work on layered network evolution. The undertaking of this paper is twofold: This paper's first-of-its-kind examination of the problems of logical link mapping and traffic flow routing unveils that backhaul traffic, a flow loop that occurs at any lower link layer below the traffic layer except its own, could happen in the traffic flow routing even when no backhaul occurs in the link mapping, prompting our discussion on the investigation of crosslayer survivable link mapping when traffic layers are explicitly considered and survivability is required. In addition to the theoretical treatment on the connection among and between link and traffic layers, a forbidden link matrix is also identified masking part of the network for use in situations where some physical links are reserved exclusively for a designated service, mainly for the context of providing multiple levels of differentiation on the network use. The masking effect is then evaluated on two metrics using two practical approaches in a sample real-world network, showing that both efficiency and practicality can be achieved.","PeriodicalId":202408,"journal":{"name":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","volume":"9 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":"121976437","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":"Analysis and monitoring of end-user perceived QoS in mobile networks","authors":"A. Kajackas, A. Vindašius","doi":"10.1109/NETWKS.2010.5624952","DOIUrl":"https://doi.org/10.1109/NETWKS.2010.5624952","url":null,"abstract":"In realistic mobile heterogeneous environment, the quality perceived by user is variable and dependant on following major factors: available bit rate variation, packet loss and latency. Even though QoS management is enabled in most modern telecommunication systems, it does not ensure the actual end-user perceived quality of service level. Therefore, to make sure that operator follows SLA provisions, QoS level has to be tracked continuously by software QoS agents, residing in user devices. Such tracking tools still do not exist. To fill the gap, in this paper we review quality management processes and analyze the possibilities to evaluate end-user perceived quality of multimedia services. Also, the principles of QoS evaluation instruments and algorithm models are presented. We intend to call attention of academic circle, telecommunication service providers and regulators to this problem.","PeriodicalId":202408,"journal":{"name":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","volume":"43 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":"131462692","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":"Support mobility for future Internet","authors":"Jie Hou, Yaping Liu, Z. Gong","doi":"10.1109/NETWKS.2010.5624938","DOIUrl":"https://doi.org/10.1109/NETWKS.2010.5624938","url":null,"abstract":"Seamless mobility is a serious challenge facing the Internet. The IP semantic overload issue presents the technical barriers to the development of mobility. However, the existing mobility support schemes may hardly meet the application requirements. In this paper, we propose SMOS, a seamless mobility support scheme in the Locator/Identifier Split network using techniques including route optimization, dynamic mapping updating based on the mobile node state. Our scheme provides lower handoff latency, packet loss-free and lower packet transferring overhead. Moreover, the self-verifying identifier enhances the security of SMOS. The whole handoff process is transparent to users and completed in the network.","PeriodicalId":202408,"journal":{"name":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","volume":"38 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":"131020314","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":"Investigating the interoperability between packet and optical transport platforms: “Black Link” (ITU-T G.698.2) and alternatives","authors":"M. Fricke, Josef Rose, R. Herber, R. Ries","doi":"10.1109/NETWKS.2010.5624948","DOIUrl":"https://doi.org/10.1109/NETWKS.2010.5624948","url":null,"abstract":"Standard optical fiber has potential capacity of multiple Tbit/s. Efficient utilization of the already installed fiber infrastructure is of outmost importance. Starting with passive wavelength division multiplexing (pWDM) this paper discusses the potential solutions for a managed optical lambda or a complete optical transmission layer independent of the transceivers themselves. The problems from the operational point of view are tackled as well.","PeriodicalId":202408,"journal":{"name":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","volume":"68 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":"114991466","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":"Towards interdomain transit traffic reduction in peer-assisted content delivery networks","authors":"H. Asai, H. Esaki","doi":"10.1109/NETWKS.2010.5624902","DOIUrl":"https://doi.org/10.1109/NETWKS.2010.5624902","url":null,"abstract":"Transit traffic exchanged with transit providers costs more for network providers compared to intra-domain traffic or traffic exchanged over peering links. We have measured and analyzed the peer distribution in BitTorrent, which is one of peer-assisted content delivery networks (CDNs). From the peer distribution, we show the potential of the high-cost transit traffic reduction. We then propose a peer selection preference which takes into account the economical relationships among Autonomous Systems (ASes) in peer-assisted CDNs to reduce the high-cost transit traffic. Since most commercial Internet service providers cannot disclose the relationships due to their commercial contract, we employ degree-based heuristics for inferring the relationships; degree can be approximated from publicly available BGP routing tables. We show that the peer selection method utilizing the proposed preference can reduce interdomain transit traffic exchanged with provider ASes by trace-driven computer simulation. The significance of this paper are 1) we show the potential of the transit traffic reduction from peer distribution analysis, and 2) the peer selection method with the proposed preference appropriately reduces the high-cost transit traffic with degree-based AS relationships inference heuristics even though there is no public AS relationships information.","PeriodicalId":202408,"journal":{"name":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","volume":"8 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":"115183533","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 basic study of the flow admission control of mixed loss and delay system based on equality of heterogeneous traffic","authors":"S. Miyata, K. Yamaoka","doi":"10.1109/NETWKS.2010.5624955","DOIUrl":"https://doi.org/10.1109/NETWKS.2010.5624955","url":null,"abstract":"We have proposed a novel Call Admission Control (CAC) to maximize total user satisfaction in a heterogeneous traffic network and showed the effectiveness of our CAC by using optimal-threshold from numerical analysis[1]. In our previous CAC, when a new broadband flow arrived and if total accommodated bandwidth was more than or equal to the threshold, the arriving new broadband flow was rejected. In actual networks, however, users may accept to wait for a certain period until the broadband flow, such as video, begins to play. In this paper, when total accommodated bandwidth was more than or equal to the threshold, arriving broadband flows wait instead being rejected. As a result, we can greatly improve total user satisfaction.","PeriodicalId":202408,"journal":{"name":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","volume":"17 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":"115345162","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}
P. Kacprzak, M. Kaleta, K. Koltys, P. Pałka, K. Pieńkosz, E. Toczyłowski, I. Zóltowska
{"title":"Multicommodity exchange model for trading bandwidth in undirected networks","authors":"P. Kacprzak, M. Kaleta, K. Koltys, P. Pałka, K. Pieńkosz, E. Toczyłowski, I. Zóltowska","doi":"10.1109/NETWKS.2010.5624916","DOIUrl":"https://doi.org/10.1109/NETWKS.2010.5624916","url":null,"abstract":"The multicommodity exchange for trading bandwidth commodities in undirected networks, in the form of the BUCBT bandwidth exchange model, is presented. The BUCBT model allows for the most efficient allocations of undirected resources. An associated allocation model is formulated as a multicommodity network flow problem with directed flows. The equivalence of the associated model to the undirected bandwidth problem is shown.","PeriodicalId":202408,"journal":{"name":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","volume":"61 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":"122903714","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":"Dynamic Unattended Measurement Based Routing Algorithm for DiffServ architecture","authors":"M. Czarkowski, S. Kaczmarek","doi":"10.1109/NETWKS.2010.5624909","DOIUrl":"https://doi.org/10.1109/NETWKS.2010.5624909","url":null,"abstract":"Dynamic routing is very important in terms of assuring QoS in today's packet networks especially for streaming and elastic services. Existing solutions dedicated to dynamic routing are often too complicated and seem to be not usable in real time traffic scenarios where transferred traffic may vary significantly. This was the main reason for research and new routing mechanism proposal which should apply to today's packet networks. Presented algorithm DUMBRA, Dynamic Unattended Measurement Based Routing Algorithm allows using k-shortest path mechanism for streaming and elastic traffic classes. It has been verified many different traffic scenarios in many different network topologies by simulation that has been realized using Omnet++ simulation environment. It has been confirmed that for most of analyzed network topologies the algorithm gave the significant gain in the amount of serviced traffic via existing network resources.","PeriodicalId":202408,"journal":{"name":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","volume":"75 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":"121092847","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}
Y. Katsuyama, Raja Zahilah, Yuta Ogino, S. Nishiuma, M. Nooruzzaman, O. Koyama
{"title":"Lightpath design & management tool for IP-over-CWDM networks with ROADMs","authors":"Y. Katsuyama, Raja Zahilah, Yuta Ogino, S. Nishiuma, M. Nooruzzaman, O. Koyama","doi":"10.1109/NETWKS.2010.5624950","DOIUrl":"https://doi.org/10.1109/NETWKS.2010.5624950","url":null,"abstract":"A lightpath design and management tool with parallel processing capabilities and a flexible upgradability, allowing new functions to be added to the system without any system program changes, has been designed and implemented for IP-over-CWDM networks with ROADMs. The tool can process applications composed of some sub applications in parallel in multi machines for high-speed performance. In addition, the tool was designed to have a flexible upgradability, i.e. no changes of the system programs are required when adding the new functions. The system functions are to design lightpaths and wavelengths allocated to ROADMs for the lightpaths required to groom given traffic. The tool also can search possible lightpath routes made by ROADMs with specified switch states, and output the total optical losses of the routes. By the tool implemented in one management and 3 calculation machines for the parallel processing, the total time to obtain the results for a 5-node IP-over-CWDM network was reduced down to 65 % of the total time by the tool with a single machine without parallel processing. The tool enables the network administrators to design and manage the lightpath reconfigurations effectively without errors by avoiding making unlinked lightpaths through routes with higher losses to connect nodes, before the reconfiguration.","PeriodicalId":202408,"journal":{"name":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","volume":"9 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":"114174202","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":"IMS management based eTOM framework for multimedia service","authors":"B. Raouyane, M. Bellafkih, M. Errais, M. Ramdani","doi":"10.1109/NETWKS.2010.5624913","DOIUrl":"https://doi.org/10.1109/NETWKS.2010.5624913","url":null,"abstract":"Managing service level delivery is challenging, typical case in IMS network with multiple service and users. The IMS as control layer must perform end-to-end services with a guarantee to secure and manage anomalies due to the network diversity, however the network performance is dynamic and the amount of useful information is limited so it's difficult to detect problems after supply before they surface. The IMS to fulfill service monitoring must use the eTOM (enhanced Telecom Operations Map) Framework, That tool can simplify integration, supervision and monitoring over a new telecommunications network. IMS have to provide a guaranteed Quality of Service (QoS) to the users in the case of VoD service, the providing procedure respect QoS standards and enter into fulfillment processes although remains assurance and billing, for that we propose a monitoring system-based eTOM that retrieve supply information in real-time and simulate the business operation with distributed WSOA concept. Furthermore, set of information retrieved will be used in SLA (Service Level Agreement) verification, take corrective actions, and predicate service-level impact.","PeriodicalId":202408,"journal":{"name":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","volume":"66 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":"123486428","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}