{"title":"An IPv6 Test-Bed Implementation for a Future Source Address Validation Architecture","authors":"J. Bi, Jianping Wu, Xing Li, Xiangbin Cheng","doi":"10.1109/NGI.2008.21","DOIUrl":"https://doi.org/10.1109/NGI.2008.21","url":null,"abstract":"Since the Internet uses destination-based packet forwarding, malicious attacks have been launched using spoofed source addresses. In an effort to enhance the Internet with IP source address validation, we prototyped an implementation of the IPv6 source address validation architecture (SAVA) and conducted the evaluation on an IPv6 test-bed. This paper reports our prototype implementation and the test results, as well as the lessons and insights gained from our experimentation.","PeriodicalId":182496,"journal":{"name":"2008 Next Generation Internet Networks","volume":"367 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115958911","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":"Quality Evaluation of Compressed Panoramic Images Constructed using MPEG-7-Based Image Registration","authors":"A. Glowacz, M. Grega, P. Romaniak, M. Leszczuk","doi":"10.1109/NGI.2008.29","DOIUrl":"https://doi.org/10.1109/NGI.2008.29","url":null,"abstract":"This paper describes an innovative compression method of panoramic images based on MPEG-7 descriptors. The proposed solution employs a detection of a series of individual video frame overlaps in order to produce concatenated panoramic images. The presented method is easy to implement even in simple devices such as low power consuming chipsets installed in remote cameras having limited power supplies. Under subjective tests it has been proved that the concatenation method allows for achieving lower transmission rates while sustaining picture quality.","PeriodicalId":182496,"journal":{"name":"2008 Next Generation Internet Networks","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116840815","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}
Carlos Pinho, Jose Ruela, K. Pentikousis, Cornelia Kappler
{"title":"A Protocol for Event Distribution in Next-Generation Dynamic Networks","authors":"Carlos Pinho, Jose Ruela, K. Pentikousis, Cornelia Kappler","doi":"10.1109/NGI.2008.23","DOIUrl":"https://doi.org/10.1109/NGI.2008.23","url":null,"abstract":"With the increasing number of devices carried by users and the emergence of more dynamic network scenarios, new solutions have to be developed to support ubiquitous communications. The need for dynamic and transparent auto-configuration and adaptation of applications, devices and networks of devices to a wide variety of events is one of the major challenges. This paper presents a protocol to be used with notification systems, to support the registration, subscription and distribution of generic events among heterogeneous and independent entities, thus addressing the requirements of future communication scenarios.","PeriodicalId":182496,"journal":{"name":"2008 Next Generation Internet Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128422399","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 Index Policy for Dynamic Fading-Channel Allocation to Heterogeneous Mobile Users with Partial Observations","authors":"J. Nio-Mora","doi":"10.1109/NGI.2008.38","DOIUrl":"https://doi.org/10.1109/NGI.2008.38","url":null,"abstract":"This paper addresses a system model where multiple heterogeneous mobile users share a common wireless channel to a base station, extending work of Koole et al. (2001) which considered the corresponding homogeneous-user case. The channel's bandwidth is to be dynamically allocated to different users, based on partial information on their connectivity status. During each time slot, a user may or may not be connected to the base station, where the Gilbert-Elliott model is assumed that a user's connectivity evolves as a two-state (on-off) Markov chain. Transmitting from/to a user reveals its true connectivity status, while those of other users are only partially known by tracking their probabilities of being connected. The goal is to design a tractable dynamic channel allocation policy that comes close to maximizing the infinite-horizon discounted or long-run average value of the through put minus transmission costs. The paper exploits a restless bandit problem formulation drawing on and extending to the Partially Observed Markov Decision Process (POMDP) setting the powerful indexation theory introduced by Whittle (1988) and developed by the author, to obtain a new dynamic priority-index policy that is readily implementable. Computational results are presented showing that the proposed policy can substantially outperform the conventional greedy policy in instances with two heterogeneous users.","PeriodicalId":182496,"journal":{"name":"2008 Next Generation Internet Networks","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128800026","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 Reactive Approach to QoS Provisioning in IEEE 802.11e WLANs","authors":"F. Cacace, G. Iannello, M. Vellucci, L. Vollero","doi":"10.1109/NGI.2008.41","DOIUrl":"https://doi.org/10.1109/NGI.2008.41","url":null,"abstract":"IEEE 802.11e provides basic mechanisms for traffic differentiation in WLANs previously unavailable with the IEEE 802.11 standard. The enhanced distributed channel access (EDCA) is probably the most promising subset of such mechanisms, and it is already implemented in a huge number of Network Cards. In this paper we present an algorithm for the provisioning of QoS in EDCA WLANs. The algorithm is based on monitoring and reactive configuration of EDCA mechanisms in scenarios where voice over IP (VoIP) and best effort (BE) applications concurrently access the wireless channel. Results obtained in a real test-bed prove the effectiveness of the algorithm both in protecting VoIP communications and in providing minimal quality levels and fairness to BE applications.","PeriodicalId":182496,"journal":{"name":"2008 Next Generation Internet Networks","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134338396","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":"The Flushing Mechanism for MBAC in Flow-Aware Networks","authors":"J. Domżał, A. Jajszczyk","doi":"10.1109/NGI.2008.17","DOIUrl":"https://doi.org/10.1109/NGI.2008.17","url":null,"abstract":"The paper describes the flushing mechanism as an enhancement proposed for the measurement based admission control (MBAC) block in flow-aware networks (FAN). It focuses on periodical cleaning of the contents of protected flow list (PFL) in the congestion state. The mechanism is discussed and performance evaluation results are presented. The paper shows the motivation for FAN networks and presents simulation results evaluating the acceptance time of a new streaming flow in the congested link and bandwidth allocation for elastic flows. A new concept of the flushing mechanism in FAN networks, which improves network performance and servicing of streaming flows, is proposed.","PeriodicalId":182496,"journal":{"name":"2008 Next Generation Internet Networks","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122859838","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":"Network Layer Performance in Peer-to-Peer File Sharing Systems","authors":"R. Bolla, R. Bruschi, M. Sciuto, K. Pawlikowski","doi":"10.1109/NGI.2008.48","DOIUrl":"https://doi.org/10.1109/NGI.2008.48","url":null,"abstract":"Nowadays P2P applications dominate many networks. However, despite of their diffusion, the analysis of tele- traffic generated by these applications in real-time environment remains an open issue. In this paper we look at analytical and simulation models, which can be used for quantifying volumes of P2P teletraffic at the network layer, to ease still existing difficulties associated with monitoring such teletraffic. We present an event-driven simulator, able to simulate P2P teletraffic both at the application and network layers in large overlay networks (we have successfully tested it in networks used by up to 500,000 peers). The simulation model was developed for studying the impact that P2P systems have on the network layer performance. We studied also the application layer dynamics by looking at time evolution of file-downloading processes and at the offered load generated in such networks. We report the results of several simulation scenarios, in which we focused on the consequences such teletraffic has on the Internet access link of an enterprise network.","PeriodicalId":182496,"journal":{"name":"2008 Next Generation Internet Networks","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115676524","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}
Rajesh Mahindra, G. Bhanage, George Hadjichristofi, I. Seskar, Dipankar Raychaudhuri, Y. Y. Zhang
{"title":"Space Versus Time Separation for Wireless Virtualization on an Indoor Grid","authors":"Rajesh Mahindra, G. Bhanage, George Hadjichristofi, I. Seskar, Dipankar Raychaudhuri, Y. Y. Zhang","doi":"10.1109/NGI.2008.36","DOIUrl":"https://doi.org/10.1109/NGI.2008.36","url":null,"abstract":"The decreasing cost of wireless hardware and ever increasing number of wireless testbeds has led to a shift in the protocol evaluation paradigm from simulations towards emulation. In addition, with a large number of users demanding experimental resources and lack of space and time for deploying more hardware, fair resource sharing among independent co-existing experiments is important. We study the proposed approaches to wireless virtualization with a focus on schemes conserving wireless channels rather than nodes. Our detailed comparison reveals that while experiments sharing a channel by space separation achieve better efficiency than those relying on time separation of a channel, the isolation between experiments in both cases is comparable. We propose and implement a policy manager to alleviate the isolation problem and suggest scenarios in which either of the schemes would provide a suitable virtualization solution.","PeriodicalId":182496,"journal":{"name":"2008 Next Generation Internet Networks","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128173380","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":"Hierarchical Routing Architecture (HRA)","authors":"Xiaohu Xu, Dayong Guo","doi":"10.1109/NGI.2008.19","DOIUrl":"https://doi.org/10.1109/NGI.2008.19","url":null,"abstract":"Some recent research activities from IETF and IRTF Routing Research Group (RRG) are to explore a new routing and addressing architecture to meet those challenges that current Internet are facing, especially in scalability. An identifier/locator split idea has been widely recognized as an architectural solution to the routing scalability issue. This paper describes a new routing and addressing architecture, called as Hierarchical Routing Architecture (HRA). HRA is also a kind of id/locator split solution. It introduces a hierarchical and cryptographic host identifier and adopts a hierarchical routing mechanism to support routing across multiple independent address spaces.","PeriodicalId":182496,"journal":{"name":"2008 Next Generation Internet Networks","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130076180","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":"Transit Price Negotiation: Decentralized Learning of Optimal Strategies with Incomplete Information","authors":"D. Barth, L. Echabbi, C. Hamlaoui","doi":"10.1109/NGI.2008.10","DOIUrl":"https://doi.org/10.1109/NGI.2008.10","url":null,"abstract":"We present a distributed learning algorithm for optimising transit prices in a negotiation problem in the inter-domain routing framework. We present a combined game theoretic and distributed algorithmic analysis, where the notion of Nash equilibrium with the first approach model meets the notion of stability in the second. We show that minimum cost providers can learn how to strategically set their prices according to a Nash equilibrium; even when assuming incomplete information. We validate our theoretic model by simulations confirming the expected outcome.","PeriodicalId":182496,"journal":{"name":"2008 Next Generation Internet Networks","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133267417","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}