{"title":"A plausible approach for further decentralization of IPv6 address distribution","authors":"R. Murugesan, S. Ramadass","doi":"10.1145/1930286.1930287","DOIUrl":"https://doi.org/10.1145/1930286.1930287","url":null,"abstract":"In recent years, proposals made to introduce competition to the existing system of IPv6 address allocation, has invited greater attention and discussion on IPv6 address management. The above proposition has raised qualms among the advocates of the present system of IPv6 address distribution. They have disapproved the above proposal fearing that further decentralization of IPv6 address distribution would affect the scalability, and stability of the Internet routing system. The increase in the Internet core routing table size beyond its capabilities due to address deaggregation is the reason attributed to it. This paper defines a plausible approach, called the expansionary approach for further decentralization of IPv6 address distribution as if it needs implementation. This new approach maximizes address aggregation by defining proper address allocation and management scheme. It would facilitate users, who wish to have a choice from which Internet Registry they wish to obtain their IPv6 addresses. In addition, a competitive environment, provided by further decentralization, would be an impetus for the address supplier to be more innovative and responsive to users and market needs.","PeriodicalId":321730,"journal":{"name":"Proceedings of the 6th Asian Internet Engineering Conference","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125564928","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}
Pei-chun Cheng, Jong Han Park, K. Patel, Lixia Zhang
{"title":"Route flap damping with assured reachability","authors":"Pei-chun Cheng, Jong Han Park, K. Patel, Lixia Zhang","doi":"10.1145/1930286.1930290","DOIUrl":"https://doi.org/10.1145/1930286.1930290","url":null,"abstract":"It is well known that a relatively small percentage of unstable routes exists in the global routing system which contributes an out of proportion number of routing updates. The route flap damping (RFD) was once considered an effective means to curtail such instability. However, both measurement studies and operational observations show that BGP path exploration can trigger false route damping which leads to prolonged periods of lost network reachability. As a result, many networks turned off RFD. In this paper we propose a simple solution, RFD+RG, dubbed RFD with Reachability Guard, to address the reachability problem in the RFD deployment. RFD+RG performs route flap damping without losing reachability, and the +RG enhancement component works independently from specific damping algorithms and can be integrated into any existing RFD scheme. We use collected BGP data to evaluate RFD+RG performance and our results show that RFD+RG can suppress up to 27% of route instabilities while faithfully preserving reachability.","PeriodicalId":321730,"journal":{"name":"Proceedings of the 6th Asian Internet Engineering Conference","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132384902","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}
Jiangzhe Wang, E. Osterweil, Chunyi Peng, R. Wakikawa, Lixia Zhang, Chi-Yu Li, Pei-chun Cheng
{"title":"Implementing instant messaging using named data","authors":"Jiangzhe Wang, E. Osterweil, Chunyi Peng, R. Wakikawa, Lixia Zhang, Chi-Yu Li, Pei-chun Cheng","doi":"10.1145/1930286.1930292","DOIUrl":"https://doi.org/10.1145/1930286.1930292","url":null,"abstract":"The Internet has been a huge success, but it is showing signs of age. Among multiple proposed directions for the Internet's future design is a promising architecture called Named Data Networking (NDN). NDN casts data as a first class element of the network's architecture in an effort to greatly facilitate new application development. However, as with any new architecture, one important deployment issues is being able to evolve existing applications. In this paper, we use a library for Instant Messaging (IM) applications called libpurple as a case study to demonstrate both the advantages of implementing IM as a serverless application in NDN and to explore promising approaches to porting applications to NDN. Our new serverless design enables IM clients to chat with each other without infrastructure support. Since libpurple is widely used as the transport layer of several IM applications (including Pidgin, Adium, and Apolio IM) our new library NDN Purple is able to seamlessly support these applications without modification to higher-layer code. In this work, we propose that our serverless design serves as a template for porting applications, and using it requires only trivial changes existing applications' state machines in order to facilitate interactions with NDN through. We do this by embedding a local pseudo-proxy in the application itself, and we are therefore able to leave the legacy code's state machine alone.","PeriodicalId":321730,"journal":{"name":"Proceedings of the 6th Asian Internet Engineering Conference","volume":"183 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129652197","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":"Hybrid link-state, path-vector routing","authors":"M. Abdul Alim, Timothy G. Griffin","doi":"10.1145/1930286.1930291","DOIUrl":"https://doi.org/10.1145/1930286.1930291","url":null,"abstract":"Traffic engineering in Internet backbones can be improved by off-line optimization algorithms that automatically configure link weights used by routing protocols. However, with existing protocols large networks often require some type of partitioning in order to scale the routing protocol, and these partitions actually complicate the metrics to the extent that link-weight optimization is no longer practical. In this paper we study how an algebraic specification of a path problem can be naturally decomposed into simpler subproblems where each sub-problem can then be solved independently without changing the global metric being used network-wide. In addition, we go on to study four possible combinations of link-state and distance-vector mechanisms in this setting. In particular, we attempt to clarify the tradeoffs between fast convergence of link-state and low space requirements of distance-vector. The results provide a framework for analyzing existing mechanisms and for designing more reliable and robust routing protocols.","PeriodicalId":321730,"journal":{"name":"Proceedings of the 6th Asian Internet Engineering Conference","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129285561","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":"Proceedings of the 6th Asian Internet Engineering Conference","authors":"","doi":"10.1145/1930286","DOIUrl":"https://doi.org/10.1145/1930286","url":null,"abstract":"Welcome to the sixth Asian Internet Engineering Conference (AINTEC 2010). Following the tradition, AINTEC is held in Thailand and it provides an international technical forum for experts from industry and academia, especially aiming at addressing issues pertinent to the Asia and Pacific region with vast diversities of socio-economic and networking conditions while inviting high quality and recent research results from the global Internet research community. \u0000 \u0000The conference is single-track and features a technical program with significant opportunities for individual and small-group discussions among a diverse set of participants. This year's program features 3 invited talks, 14 paper presentations, and for the first time it features a very exciting poster section, hosting 5 posters. It also offers on the 13 and 14 of November the 21st Asian School on Computer Science, a preconference school that receives a lot of interest from attendees from industry and academia. This year we have received paper submissions from Asia, Europe and the United States. Each paper was gone though a detailed review process. Based on the reviews, 14 papers were accepted that cover the various topics that include Network Management, Routing and New Architecture, Future Internet, Wireless & Mobility and Software designs. We are also featuring for the first time a poster section with 5 very interesting posters that present emerging research in the areas of networking and future internet.","PeriodicalId":321730,"journal":{"name":"Proceedings of the 6th Asian Internet Engineering Conference","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122563031","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}