{"title":"Competition Promoting Unbundling of PON","authors":"Kosuke Tomonaga, M. Ohta, Takashi Tsutsui","doi":"10.1109/INTERNET.2010.36","DOIUrl":"https://doi.org/10.1109/INTERNET.2010.36","url":null,"abstract":"In Japan, PON (Passive Optical Network) systems are deployed nation wide by NTT (Nippon Telegraph and Telephone) and optical fibers are regulated to be unbundled at reasonable price for PON service to promote the competition. However, the competition is not really promoted, because average cost of a fiber divided by the average number of subscribers for each fiber is greatly different between competitors with different shares. To really promote competition, two approaches are proposed: one is to vary fiber unbundling price proportional to the number of subscribers of each fiber; the other is to share PON equipments between competing network operators and to demultiplex in a station at L2 (layer 2).","PeriodicalId":155572,"journal":{"name":"2010 2nd International Conference on Evolving Internet","volume":"47 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125843332","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":"An Approach towards Resource Efficient Virtual Network Embedding","authors":"Adil Razzaq, M. S. Rathore","doi":"10.1109/INTERNET.2010.21","DOIUrl":"https://doi.org/10.1109/INTERNET.2010.21","url":null,"abstract":"Network virtualization is at the heart of efforts to end Internet ossification, and utilize network infrastructure efficiently. The key concept is to share the infrastructure resources among many users at the same time and in such a way to enable them to deploy the required architectures. This leads to virtual networks (VNs), demanding different resources that have to be embedded on the underlying shared infrastructure network. The requirements of a VN can be based on factors such as, the type of traffic it needs to carry. Some portion of the same resources (substrate resources) needs to be assigned to every VN and the substrate resources are also finite. Thus, a mechanism needs to be devised in order to schedule the resources. This embedding process with resource constraints on virtual nodes and links to be applied on the substrate, which also has limited resources, is challenging and corresponds to the category of NP-hard problems. In this paper, we propose an approach to solve this problem by mapping the vertices of the VN as closely as possible in the substrate network and then assigning virtual edges to the shortest paths which satisfy their demands. This could enable the substrate to accommodate more VNs in the same resource database and hence optimize the substrate’s bandwidth utilization. To the best of our knowledge closest node mapping proposed in this solution is a novel approach and is evaluated and compared to the existing approach of greedy node mapping in different scenarios. The sensitivity analysis by varying the different parameters and their effect on mapping VNs is also presented.","PeriodicalId":155572,"journal":{"name":"2010 2nd International Conference on Evolving Internet","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124418293","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":"Enhancing Broadband Penetration in a Competitive Market","authors":"Erika Pigliapoco, A. Bogliolo","doi":"10.1109/INTERNET.2010.35","DOIUrl":"https://doi.org/10.1109/INTERNET.2010.35","url":null,"abstract":"In spite of the exponential growth of IP traffic, broadband market is suffering from a stagnation which limits Internet penetration and discourages investors/operators from deploying access infrastructures in sparsely populated areas because of low (or negative) rate of return and unsustainable operation costs. Although perfect competition is not a suitable model to describe Internet access market, the economic equilibrium between supply and demand curves in a competitive market can be used to discuss the issues of Internet penetration and infrastructure sustainability and to envisage new business models that could be applied to enhance them. This is the purpose of this paper.","PeriodicalId":155572,"journal":{"name":"2010 2nd International Conference on Evolving Internet","volume":"187 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124148854","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. Cavendish, K. Kumazoe, M. Tsuru, Y. Oie, M. Gerla
{"title":"Capacity and Congestion Probing: TCP Congestion Avoidance via Path Capacity and Storage Estimation","authors":"D. Cavendish, K. Kumazoe, M. Tsuru, Y. Oie, M. Gerla","doi":"10.1109/INTERNET.2010.17","DOIUrl":"https://doi.org/10.1109/INTERNET.2010.17","url":null,"abstract":"We introduce a transmission control protocol with a delay based congestion avoidance. The protocol design follows a control theoretical approach, uses session path estimators, and is adaptive and stable to a wide range of path characteristics and network conditions. We demonstrate the competitive performance of the protocol via open source based network experiments over a research network and the Internet.","PeriodicalId":155572,"journal":{"name":"2010 2nd International Conference on Evolving Internet","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126308992","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":"Prototype Genomics-Based Keyed-Hash Message Authentication Code Protocol","authors":"Harry C. Shaw, S. Hussein, H. Helgert","doi":"10.1109/INTERNET.2010.31","DOIUrl":"https://doi.org/10.1109/INTERNET.2010.31","url":null,"abstract":"The evolving nature of the internet will require continual advances in authentication and confidentiality protocols. Nature provides some clues as to how this can be accomplished in a distributed manner through molecular biology. Cryptography and molecular biology share certain aspects and operations that allow for a set of unified principles to be applied to problems in either venue. A DNA (Deoxyribonucleic acid) inspired hash code system is presented that utilizes concepts from molecular biology. It is a keyed-Hash Message Authentication Code (HMAC) capable of being used in secure mobile Ad hoc networks. It is targeted for applications without an available public key infrastructure. Ad hoc does not mean the users are completely unknown to each other. They could be part of a military unit, police, emergency workers, mobile vendors, or any collection of users in a common geographical area that wish communicate in a region lacking a Public Key Infrastructure (PKI). Mechanics of creating the HMAC are presented as well as a prototype HMAC protocol architecture.","PeriodicalId":155572,"journal":{"name":"2010 2nd International Conference on Evolving Internet","volume":"41 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131808933","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":"Femtocell SINR Performance Evaluation","authors":"Yoram Haddad, D. Porrat","doi":"10.1109/INTERNET.2010.46","DOIUrl":"https://doi.org/10.1109/INTERNET.2010.46","url":null,"abstract":"Indoor use of mobile phones is growing. Signal penetration into buildings induces severe attenuation which leads to poor indoor mobile coverage. Thus achieving adequate indoor signal to noise and interference ratio is challenging. If operators want to stimulate 3G usage as an alternative to the competitive WIFI solution, they will have to offer better data rates when users are at home or at work. The emerging femtocell solution may be the last step toward broadband mobile internet. Radio planning is not obvious for a plug-and-play femtocell device, which will inherently have an unpredictable deployment. In this paper we evaluate the performance that a femtocell system can achieve when coexisting with an overlaying macrocell system. We propose a double reuse frequency scheme for the assessment of the SINR at the femtocell level. We show that femtocells can definitely provide a meaningful improvement in the data rates experienced by the femtocell user equipment.","PeriodicalId":155572,"journal":{"name":"2010 2nd International Conference on Evolving Internet","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131327980","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. Minami, S. Arakawa, Y. Koizumi, T. Miyamura, K. Shiomoto, M. Murata
{"title":"Adaptive Virtual Network Topology Control in WDM-Based Optical Networks","authors":"Y. Minami, S. Arakawa, Y. Koizumi, T. Miyamura, K. Shiomoto, M. Murata","doi":"10.1109/INTERNET.2010.18","DOIUrl":"https://doi.org/10.1109/INTERNET.2010.18","url":null,"abstract":"Virtual Network Topology (VNT) is one efficient way to transfer the IP packet over the wavelength-routed optical networks. In resent years various new services have emerged, and IP traffic has been highly fluctuated. Therefore, adaptability against changes of traffic is one of the most important characteristics to accommodate the IP traffic efficiently. To achieve the adaptability, we have proposed a method for virtual topology controls using an attractor selection model. In this paper, we investigate the adaptability of our virtual topology control via computer simulations. Simulation results indicate that our virtual topology control can successfully adapt to changes of traffic around twice higher variance comparing with conventional virtual topology controls. We also demonstrate that our virtual topology control achieves one-tenth of control duration.","PeriodicalId":155572,"journal":{"name":"2010 2nd International Conference on Evolving Internet","volume":"443 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129237569","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}
Pedro Sousa, Artur Machado, Miguel Rocha, P. Cortez, M. Rio
{"title":"A Collaborative Approach for Spam Detection","authors":"Pedro Sousa, Artur Machado, Miguel Rocha, P. Cortez, M. Rio","doi":"10.1109/INTERNET.2010.25","DOIUrl":"https://doi.org/10.1109/INTERNET.2010.25","url":null,"abstract":"Electronic mail is nowadays one of the most important Internet networking services. However, there are still many challenges that should be faced in order to provide a better e-mail service quality, such as the growing dissemination of unsolicited e-mail (spam) over the Internet. This work aims to foster new research efforts giving ground to the development of novel collaborative approaches to deal with spam proliferation. Using the proposed system, which is able to complement other anti-spam solutions, end-users are allowed to share and combine spam filters in a flexible way, increasing the accuracy and resilience levels of anti-spam techniques.","PeriodicalId":155572,"journal":{"name":"2010 2nd International Conference on Evolving Internet","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114458906","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":"CAPEX Model for PON Technology","authors":"J. P. Davim, A. Pinto","doi":"10.1109/INTERNET.2010.41","DOIUrl":"https://doi.org/10.1109/INTERNET.2010.41","url":null,"abstract":"We present a model to estimate the CAPEX for PON technology. We begin by identifying the key components of the PON technology and from that a CAPEX model is obtained. Using the present model the CAPEX can be estimated without complete information of the network.","PeriodicalId":155572,"journal":{"name":"2010 2nd International Conference on Evolving Internet","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123594146","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":"Building Trust in Virtualized Networks","authors":"Mohammed Achemlal, J. Paillès, Chrystel Gaber","doi":"10.1109/INTERNET.2010.28","DOIUrl":"https://doi.org/10.1109/INTERNET.2010.28","url":null,"abstract":"In this paper, we propose a new approach, derived from the Trusted Computing Group specifications, to bring trust within Virtualized Networks defined in the European project 4WARD. Many players are involved in this type of networks. Some of the actors may compete with each other while they share the same physical networking resources. This paper focuses on the trust deployment in a physical node. A chain of trust is established from the root of trust to high level applications. The root of trust is based on a small piece of software stored on a hardware chip.","PeriodicalId":155572,"journal":{"name":"2010 2nd International Conference on Evolving Internet","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116552481","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}