{"title":"Adaptive Packet Prioritisation for Wireless Sensor Networks","authors":"L. Hey, E. Gelenbe","doi":"10.1109/NGI.2009.5175755","DOIUrl":"https://doi.org/10.1109/NGI.2009.5175755","url":null,"abstract":"The cost of a large wireless sensor network consisting of hundreds of devices may only be justified if it is deployed for multiple monitoring tasks. Introducing multiple tasks to the system however raises concerns regarding resource contention and quality of service (QoS). For example, rapid response tasks may have strict requirements with regards to data delivery latency, whereas data gathering tasks may be more lenient. In order to address the differential QoS challenge, we use the random re-routing (RRR) wireless sensor network routing protocol to prioritise the packets of some tasks above those of others. We extend the RRR protocol beyond that found in the previous literature to improve performance, and in simulation demonstrate an acknowledgement mechanism for adapting the packet priorities assigned to tasks.","PeriodicalId":162766,"journal":{"name":"2009 Next Generation Internet Networks","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123804222","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 Coding Multicast in Satellite Networks","authors":"F. Vieira, J. Barros","doi":"10.1109/NGI.2009.5175769","DOIUrl":"https://doi.org/10.1109/NGI.2009.5175769","url":null,"abstract":"The broadcast nature of satellite networks such as DVB-RCS based systems provides a highly effective medium for content distribution, especially in the case of geographically scattered clients. Non-real-time services typically rely on application level protocols that often use forward error correction (FEC) and carousel data cycling schemes in unidirectional links. The presence of a feedback channel in satellite networks is mostly unexploited in the context of reliable multicast services. We show that network coding protocols offer a native and transparent solution for reliable multicast over satellites. When employing a feedback channel, network coding can reach near real-time performance at an efficiency level close to known theoretical bounds for lossy satellite links.","PeriodicalId":162766,"journal":{"name":"2009 Next Generation Internet Networks","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126653020","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":"Multilayer Optimization of Inverse-Multiplexed 100 Gb/s Ethernet Services over Optical Transport Networks","authors":"J. Santos, J. Pedro, P. Monteiro, J. Pires","doi":"10.1109/NGI.2009.5175767","DOIUrl":"https://doi.org/10.1109/NGI.2009.5175767","url":null,"abstract":"Stimulated by the remarkable packet traffic growth, the transport of 100 Gb/s Ethernet (100-GbE) services is to become a reality in a near future. To provide a smooth and cost-efficient network evolution, inverse-multiplexing techniques can be employed to carry the high-capacity data streams. In this context, the Virtual Concatenation (VCAT) protocol, available in Optical Transport Network (OTN) systems, represents the most adequate solution to decompose the 100-GbE signal into logical containers of 10 Gb/s and 40 Gb/s. With VCAT, each container can be independently routed throughout the network under several distribution paradigms, such as the classical single-path and multipath schemes, and the alternative degraded-service approach. In the network architecture considered, each routing path is required to be transmitted over an optical channel at the underlying WDM layer. Hence, in this work, we provide an optimization framework for solving the resource provisioning problem for 100-GbE at both OTN and WDM layers. Linear Programming based heuristics are proposed for routing the containers and dimension the capacity required at the OTN level. In particular, solutions for single-path, multipath, and degraded-service routing are described and evaluated in a reference network topology. The optimization procedures are also extended to resolve the wavelength assignment problem at the physical WDM layer. With this optimized multilayer architecture, the capacity gains resulting from the adoption of multipath strategies over single-path are properly evaluated and demonstrated. In addition, it is shown that the implications of using diverse-routing over the WDM layer have a minor impact in the capacity savings.","PeriodicalId":162766,"journal":{"name":"2009 Next Generation Internet Networks","volume":"362 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129158113","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":"Exploiting Power-Law Node Degree Distribution in Chord Overlays","authors":"S. Ktari, A. Hecker, H. Labiod","doi":"10.1109/NGI.2009.5175761","DOIUrl":"https://doi.org/10.1109/NGI.2009.5175761","url":null,"abstract":"In this paper, we propose to extend the topology of Chord to a bidirectional graph to provide a super-peer based lookup algorithm and a scalable broadcast search support. We consider routing algorithms for a bidirectional variant of Chord network and show how the resulting structure extends the search region and provides an efficient resource lookup service at a very little additional cost.","PeriodicalId":162766,"journal":{"name":"2009 Next Generation Internet Networks","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133518474","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":"Performance Analysis of Sliding Window Based Erasure Correction for Real-Time Traffic","authors":"T. Tirronen, J. Virtamo","doi":"10.1109/NGI.2009.5175775","DOIUrl":"https://doi.org/10.1109/NGI.2009.5175775","url":null,"abstract":"We propose a fountain-coding-like erasure correction method for streaming traffic with real-time requirements. A sliding window defines the range of non-expired data. Each new block entering the window is once sent as such, followed by probabilistically sending a repair packet, formed as a random combination of the blocks in the current window using a degree distribution as in LT-coding. The decoding of repair packets is based on an iterative algorithm. The performance of the method with a given channel loss probability is analyzed using an exact Markov chain model. The state space, however, has to be truncated for computational tractability. The truncation error is verified to be small enough by simulations. By using the analytical model the optimal degree distribution Is fonnd to be of single-degree type. Both analytical and simulation results on the performance with the optimal repalr packet degree are presented and the effectiveness of the method demonstrated.","PeriodicalId":162766,"journal":{"name":"2009 Next Generation Internet Networks","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117297031","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 Middleware Design for Bridging Legacy Infrastructures and NGN","authors":"N. Matsumoto, M. Hayashi, Hideaki Tanaka","doi":"10.1109/NGI.2009.5175770","DOIUrl":"https://doi.org/10.1109/NGI.2009.5175770","url":null,"abstract":"Session-based QoS control mechanism is a key characteristic in next generation networks (NGN). However, the session-based QoS control defined in NGN standardizations is not designed for layer 2 infrastructures, but for border gateway function (BGF) at IP edge. To achieve QoS assurance for NGN services, end-to-end network resource management, including layer 2 access and metro networks, is required. Although the BGF function needs to be introduced at IP edge, legacy infrastructures must be utilized especially for access and metro networks. Incorporating those widely deployed legacy infrastructures into session-based QoS control mechanisms is expected. However, differences in user-flow identification of NGN and resource identification required for managing legacy infrastructures induce gaps blocking integration to the unified session-based infrastructure. This paper proposes to use a network middleware for bridging NGN control frameworks and legacy infrastructures. With the multiple service oriented architecture (SOA) chain, the network middleware distributedly coordinates middleware element managing each network segments, and harmonizes differences of resource description and control procedures in NGN and legacy infrastructures. The network middleware enables to maintain coherent QoS policy for the end-to-end route of the session-based services throughout the heterogeneous and multi-layer infrastructures.","PeriodicalId":162766,"journal":{"name":"2009 Next Generation Internet Networks","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123957931","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":"On Movement-based Location Update. A Lookahead Strategy","authors":"V. Giner, Pablo García-Escalle","doi":"10.1109/NGI.2009.5175771","DOIUrl":"https://doi.org/10.1109/NGI.2009.5175771","url":null,"abstract":"This paper presents a lookahead strategy for a movement-based location update procedure that reduces the signaling traffic of the classical movement-based scheme. Our proposal is based on the observation that many trips of the mobile users are daily trajectories according to certain routines, for instance from home to the working place and vice-versa. Also we assume that the network can predict the mobile's position at the cell level. Based on those aspects, our scheme works as follows. If the mobile terminal visits an expected cell, a target cell, before a certain movement threshold M is reached, its movement counter is reset to zero. If the movement counter of the mobile terminal reaches the threshold M before visiting the target cell the mobile terminal will trigger a location update message. \u0000 \u0000With this strategy, since mobile terminals have less contacts with the network, the uncertainty on their location increases and as a consequence of that, in order to keep the terminal paging cost below reasonable bounds, a selective polling strategy based on the expected trajectory of the mobile terminal should be applied. To that purpose a selective line-paging-Iike procedure is considered. Two step and three step paging procedures have been implemented. The net effect is a significant saving in the total signalling load (location update + paging) supported in the air interface. The assertion of this expected result has been carried out using a suitable Markovian analytical framework.","PeriodicalId":162766,"journal":{"name":"2009 Next Generation Internet Networks","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129518653","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":"Performance Analysis of an Enhanced Distributed Access Mechanism in a Novel Multiservice OPS Architecture","authors":"T. Eido, F. Pekergin, T. Atmaca","doi":"10.1109/NGI.2009.5175774","DOIUrl":"https://doi.org/10.1109/NGI.2009.5175774","url":null,"abstract":"Optical Packet Switching (OPS) technologies are among the most promising solutions for Next Generation Internet. In this paper, we address Quality of Service (QoS) and fairness issues in a novel OPS ring architecture with a slotted synchronous transmission mode. The basic MAC protocol in the studied architecture is similar to the CSMA/CA mechanism. Using this mechanism, each node in the network may use the available bandwidth in an opportunist manner. Moreover, in the considered network, optical packets bypass intermediate nodes without being delayed or converted to the electronic domain. Therefore, the chances for a ring node to find available transmission resources are tightly correlated to the matrix of traffic of the other nodes. This leads to unfair sharing of the transmission medium. In order to remedy this problem, we elaborate a distributed Tag-based Enhanced Access Mechanism (TEAM). The proposed solution evolves from two preemptive access mechanisms that we have proposed recently (namely the Packet Erasing Mechanism PEM and the Extraction and Reemission Mechanism ERM). In order to resolve the unfairness issue, which characterizes ring OPS architectures with transparent transit at intermediate nodes, we use an advanced distributed approach where all ring nodes cooperate together. Finally, we evaluate the performance of the TEAM mechanism through several simulation scenarios.","PeriodicalId":162766,"journal":{"name":"2009 Next Generation Internet Networks","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128014602","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. Carvalho, S. R. Lima, André Ferreira, Emanuel Freitas, Filipe A. Leitao
{"title":"Providing Cost-effective QoS Monitoring in Multiservice Networks","authors":"P. Carvalho, S. R. Lima, André Ferreira, Emanuel Freitas, Filipe A. Leitao","doi":"10.1109/NGI.2009.5175778","DOIUrl":"https://doi.org/10.1109/NGI.2009.5175778","url":null,"abstract":"In multiservice networks, QoS monitoring needs to be carried out in a per-class basis so that each service class measuring requirements and behavior are met and sensed properly. Facing the shortage of off-the-shelf class-based monitoring solutions, this work is focused on the development of a flexibly QoS monitoring tool oriented to multiservice networks. In this context, after discussing main QoS monitoring issues, we propose a flexible QoS monitoring Java application, totally user parameterized and supporting service differentiation. Benefiting from an edge-to-edge design perspective, this service-oriented tool is able to make a periodic evaluation of relevant QoS metrics for each service class, on an intra-domain or end-to-end path basis. Monitoring results, stored in a MySQL database, are useful to drive both online and offline traffic engineering and service management tasks.","PeriodicalId":162766,"journal":{"name":"2009 Next Generation Internet Networks","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129894938","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":"Distributed Ant Algorithm for Inter-Carrier Service Composition","authors":"Hélia Pouyllau, N. Djarallah","doi":"10.1109/NGI.2009.5175759","DOIUrl":"https://doi.org/10.1109/NGI.2009.5175759","url":null,"abstract":"The future Internet would benefit from the delivery of high performance services crossing several carriers and bringing new incomes to telco operators. Such services compel carriers to guarantee Quality of Service (QoS) inside their boundaries. As carriers are independently administrated, architectures and processes must be reconsidered so that requirements for autonomy and confidentiality are respected. In this context, enforcing Service Level Agreements (SLAs) between partners cannot be avoided. The following problem has to be solved: given an end-to-end service request and collections of SLAs on each participating carrier, establish an end-to-end contract, which gives an optimal service under reliable QoS guarantees. In previous works, we described distributed processes based on dynamic programming principles. In this article, we depict a distributed adaptation of a meta-heuristic algorithm, known as Ant Colony algorithm. We demonstrate that the performances of this algorithm are competitive to other works.","PeriodicalId":162766,"journal":{"name":"2009 Next Generation Internet Networks","volume":"41 18","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113973513","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}