E. Cerqueira, A. Neto, M. Curado, P. Mendes, E. Monteiro
{"title":"WiRA: An Approach to Resource Control in WiMAX Systems","authors":"E. Cerqueira, A. Neto, M. Curado, P. Mendes, E. Monteiro","doi":"10.1109/NGI.2008.39","DOIUrl":"https://doi.org/10.1109/NGI.2008.39","url":null,"abstract":"The emerging of quality of service (QoS)-enabled broadband wireless access technologies brings internetworking facilities by allowing the development of systems with high speed communications as well as service differentiation and bandwidth guarantees for communication sessions. The end-to-end QoS control in heterogeneous environments, where networks may be composed of links with different bandwidth capacities and may support several QoS models, is still an open issue. This paper proposes a QoS control approach to guarantee the quality level of sessions crossing worldwide interoperability for microwave access (WiMAX) systems, independently of the QoS models or bandwidth capacities supported inside a WiMAX network as well as supported by a neighbour network. The proposed scheme is based on the coordination of resource allocation control with QoS mapping and adaptation mechanisms, which assures the quality level control of sessions over heterogeneous environments. Simulation results show the benefits of the proposed solution in reducing the session blocking probability and in optimizing the usage of network resources, while keeping sessions with an acceptable quality level during periods.","PeriodicalId":182496,"journal":{"name":"2008 Next Generation Internet Networks","volume":"347 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":"122547350","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":"Designing Two-Level IP Networks Including the Points of Presence","authors":"S. Chamberland","doi":"10.1109/NGI.2008.7","DOIUrl":"https://doi.org/10.1109/NGI.2008.7","url":null,"abstract":"In this paper, we propose a heuristic algorithm based on the tabu search principle for the topological design problem of two-level Internet protocol (IP) networks including the design of the points of presence. This global problem consists in selecting the number of routers and their types to install in each point of presence, selecting the interface card types to install in each router, finding the access and backbone networks and finally, interconnecting the co-located routers in each point of presence. The numerical results show that \"good\" solutions can be found rapidly with the proposed approach.","PeriodicalId":182496,"journal":{"name":"2008 Next Generation Internet Networks","volume":"53 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":"128977569","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":"OSN-IX: A Novel Internet eXchange (IX) Architecture based on Overlaid-Star Networks","authors":"P. He, G. Bochmann","doi":"10.1109/NGI.2008.20","DOIUrl":"https://doi.org/10.1109/NGI.2008.20","url":null,"abstract":"We propose a novel Internet Exchange (IX) architecture, namely OSN-IX, which adopts an overlaid-star network (OSN) as an IX. OSN can be considered as a \"distributed\" switch, which combines the advantages of the network and switch. Compared to other IX architectures, e.g., LAN-based IX, MPLS IX, Photonic IX, etc., OSN-IX has good properties of scalability, resilience, and widely distributed access points. Particularly, for the first time, OSN-IX introduces traffic engineering (TE) into the IX world. Based on the TE framework we developed for OSN-IX, OSN-IX can provide optimized dynamic inter-ISP (Internet Service Provider) routing while requiring no change, hardware or software, on existing traditional IP/MPLS routers. We have shown by simulation that our TE framework outperforms several existing inter-AS TE schemes.","PeriodicalId":182496,"journal":{"name":"2008 Next Generation Internet Networks","volume":"102 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":"125414748","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":"Jitter Analysis of Multimedia Streaming Traffic Assuming Batch Arrivals","authors":"P. Zalán, S. Molnár, T. Éltető","doi":"10.1109/NGI.2008.43","DOIUrl":"https://doi.org/10.1109/NGI.2008.43","url":null,"abstract":"This paper deals with the queueing analysis of IP networks carrying streaming traffic. The main focus of the analysis is the jitter which is a widely used performance characteristic of that type of traffic. The study is carried out by a novel technique using Quasi-Birth-Death processes in a matrix-geometric approach. Our method calculates network performance descriptors such as the transient queue length and the jitter characteristics in the case of correlated batch arrivals and Phase-type service times. The method is demonstrated by several numerical examples that are also compared to simulation results. A jitter measurement-based utilisation estimation method is also presented as an application of our results.","PeriodicalId":182496,"journal":{"name":"2008 Next Generation Internet Networks","volume":"49 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":"128632756","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}
S. Singhal, G. Hadjichristofi, I. Seskar, D. Raychaudhri
{"title":"Evaluation of UML Based Wireless Network Virtualization","authors":"S. Singhal, G. Hadjichristofi, I. Seskar, D. Raychaudhri","doi":"10.1109/NGI.2008.37","DOIUrl":"https://doi.org/10.1109/NGI.2008.37","url":null,"abstract":"Wireless virtualization aims to support concurrent experiments on shared wireless network resources. This research is based on efforts to enhance the control structure of the wireless test bed 'ORBIT' through different forms of virtualization. The focus of this paper is virtualization in frequency or frequency division multiplexing (FDM), and more specifically using multiple wireless interfaces per node and splitting the wireless medium by assigning a different channel frequency to each interface. A wireless node is virtualized through User Mode Linux (UML), with each sliver or experiment using a different interface. Extensive experimental results are presented that analyze the effectiveness of this method of virtualization in terms of different types of traffic. We examine cross-coupling effects of coexisting virtualized experiments and investigate proof-of-concept virtualization for one typical usage scenarios. This research provides practical guidance for the use of this type of virtualization for simultaneous wireless experiments.","PeriodicalId":182496,"journal":{"name":"2008 Next Generation Internet Networks","volume":"54 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":"125971154","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}
M. Dzida, M. Zagozdzon, M. Pióro, T. Sliwinski, W. Ogryczak
{"title":"Path Generation for a Class of Survivable Network Design Problems","authors":"M. Dzida, M. Zagozdzon, M. Pióro, T. Sliwinski, W. Ogryczak","doi":"10.1109/NGI.2008.11","DOIUrl":"https://doi.org/10.1109/NGI.2008.11","url":null,"abstract":"In this paper we address link dimensioning and routing problems related to the area of resilient network design. We present two network design problems that assume different flow restoration schemes used to cope with network failures. In both cases we allow bifurcation of traffic flows in the normal (failure-less) network state. In the case of a failure, we assume that affected primary flows (i.e., flows applied in the normal state) are restored using assigned protection paths and that the primary flows are restored (also in a bifurcated manner) in a separate pool of (protection) capacity, distinct from the basic capacity used in the normal network operation state. The two presented models differ in the way protection paths are used to protect primary flows against different failure states. The first model, called state-independent flow restoration, assumes that once the backup path is assigned it must be used in every state in which the protected primary path fails. The second model allows different protection paths to be used in different network failure states and is called state-dependent flow restoration. The considered problems are formulated as linear programming (LP) problems using link-path (L-P) notation of multi-commodity flow network optimization. As the L-P notation is useful only when an effective column generation scheme is known, we discuss the applicability of this method on the basis of the theory of duality of LP. The paper presents and compares three different approaches and evaluates their usefulness for solving problem instances of practical size.","PeriodicalId":182496,"journal":{"name":"2008 Next Generation Internet Networks","volume":"75 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":"131479784","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":"Power Aware Smart Routing in Wireless Sensor Networks","authors":"L. Hey","doi":"10.1109/NGI.2008.33","DOIUrl":"https://doi.org/10.1109/NGI.2008.33","url":null,"abstract":"Autonomic smart routing has previously been used in wired cognitive packet networks in order to achieve and maintain quality of service goals by continuously monitoring QoS metrics and adapting routes accordingly. In this paper we employ aspects of this routing protocol for use in wireless sensor networks with many devices of limited energy, memory, and processing capabilities. Through simulations we examine the use of smart routing in wireless sensor networks for static and mobile networks consisting of hundreds of devices, and show that it is an effective means to minimise the transmission power use. The locality of motes is also used to aggregate sensor readings for further transmission power reductions. These concepts are implemented as the tinyCPN routing protocol for the popular tinyOS sensor network operating system, and experimental results from a real sensor network testbed are presented.","PeriodicalId":182496,"journal":{"name":"2008 Next Generation Internet Networks","volume":"47 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":"115580552","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. Langendorfer, A. Grilo, K. Piotrowski, A. Casaca
{"title":"A Wireless Sensor Network Reliable Architecture for Intrusion Detection","authors":"P. Langendorfer, A. Grilo, K. Piotrowski, A. Casaca","doi":"10.1109/NGI.2008.32","DOIUrl":"https://doi.org/10.1109/NGI.2008.32","url":null,"abstract":"An important aspect of homeland security is securing public buildings and places against intrusion. Wireless sensor networks (WSN) are an efficient means of detecting intrusion and extremely convenient to deploy in such situations. However, the software running on top of the sensor nodes that directly supports the alarm applications defined by the security forces needs to provide reliability, security and ease of use. In this paper we introduce the new concept of tinyDSM that combines distributed shared memory like behaviour with event mechanisms and a new transport protocol called DTSN which provides reliable and efficient transport of messages in WSN. Both contribute to the WSN reliability that is required for the intrusion detection application. The specific security aspects are not treated in this paper.","PeriodicalId":182496,"journal":{"name":"2008 Next Generation Internet Networks","volume":"3 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":"115862502","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":"Designing Low Cost Access Networks with IPTV Performance Constraints","authors":"S. Chamberland","doi":"10.1109/NGI.2008.13","DOIUrl":"https://doi.org/10.1109/NGI.2008.13","url":null,"abstract":"In this paper, we propose to tackle the global problem of designing an access network in order to have enough bandwidth to offer high definition television (HDTV) over the Internet protocol (IPTV). Two important access network architectures are considered: the fiber-to-the-node (FTTN) and the fiber- to-the-premises (FTTP) architectures. An integer mathematical programming model is proposed for this network planning problem. Next, a heuristic algorithm based on the tabu search principle is proposed to find \"good\" feasible solutions within a reasonable amount of computational time. Finally, numerical results are presented and analyzed.","PeriodicalId":182496,"journal":{"name":"2008 Next Generation Internet Networks","volume":"198 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":"127315725","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 Loop-Free Interface-Based Fast Reroute Technique","authors":"G. Enyedi, G. Rétvári","doi":"10.1109/NGI.2008.12","DOIUrl":"https://doi.org/10.1109/NGI.2008.12","url":null,"abstract":"Nowadays, providing reliable network services is getting more and more important. However, traditional failure recovery methods in IP networks are typically reactive, therefore restoration often takes a long time. One of the most interesting solutions is interface-based fast rerouting, where not only the destination address but the incoming interface too is taken into consideration during forwarding packets in normal state and upon rerouting after a failure. Unfortunately, current methods are prone to form routing loops during the recovery process, which might make parts of the network unaffected by the failure unavailable. In this paper, we propose a new interface-based routing method, which always avoids loops at the price of a bit longer paths. We also present extensive simulation results to compare the traditional and our proposed algorithms.","PeriodicalId":182496,"journal":{"name":"2008 Next Generation Internet Networks","volume":"92 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":"126189621","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}