IET Networks
Volume 3, Issue 1, March 2014
Volumes & issues:
Volume 3, Issue 1
March 2014
-
- Author(s): Mariusz Glabowski
- Source: IET Networks, Volume 3, Issue 1, p. 1 –3
- DOI: 10.1049/iet-net.2014.0019
- Type: Article
- + Show details - Hide details
-
p.
1
–3
(3)
- Author(s): Shigeo Shioda
- Source: IET Networks, Volume 3, Issue 1, p. 4 –15
- DOI: 10.1049/iet-net.2013.0120
- Type: Article
- + Show details - Hide details
-
p.
4
–15
(12)
There are two possible resource-allocation strategies for the quality of service (QoS) guarantee in the Internet: the resource separation and the resource share. The resource-separation strategy allows a prioritised flow to occupy its own network resource, which is physically or logically separated from resources used by other traffic. The resource-sharing strategy secures some portion of network resources for prioritised traffic, but secured resource is shared by all of prioritised flows. This study compares these two resource-allocation strategies in terms of the provided QoS level. It is found that the two strategies form a striking contrast to each other in terms of the resource usage. The resource share can benefit from the statistical multiplexing gain, but it increases the envelope of each individual multiplexed flow. In contrast to this, the resource separation does not increase the envelope of flows so much, while it does not benefit from the statistical multiplexing gain. That is, the general belief that the resource separation like the IntServ provides better QoS is not always true, and various conditions including network topology or QoS target would determine which strategy is preferable.
- Author(s): Lukasz Brewka ; Villy Baek Iversen ; Georgios Kardaras
- Source: IET Networks, Volume 3, Issue 1, p. 16 –21
- DOI: 10.1049/iet-net.2013.0121
- Type: Article
- + Show details - Hide details
-
p.
16
–21
(6)
This study analyses multi-server multi-service queueing networks with service protection. To guarantee each service a certain quality-of-service and at the same time ensure high utilisation of servers, a minimum capacity is reserved each service. In addition, all services share the remaining non-reserved capacity and all buffers in such a way that the system becomes reversible. This implies the model has product form between nodes and is insensitive to the packet size distribution. An analytical model and algorithm for performance evaluation are presented.
- Author(s): Yue-Cai Huang ; King-Tim Ko ; Moshe Zukerman
- Source: IET Networks, Volume 3, Issue 1, p. 22 –29
- DOI: 10.1049/iet-net.2013.0142
- Type: Article
- + Show details - Hide details
-
p.
22
–29
(8)
The authors consider an integrated service system, where real-time (RT) calls of multiple rate requirements and non-real-time (NRT) calls share the total system capacity. Typically, RT calls are given strict priority over NRT calls; therefore NRT performance is dependent on the RT process. When RT call arrivals do not follow a Poisson process, the effect of the RT traffic burstiness on the NRT performance has not been investigated. In this study, the authors investigate this effect and provide computationally efficient approximations and bounds for the NRT performance evaluation in the integrated service system with multi-rate non-Poisson RT traffic. With known first and second moments of the RT call arrival processes, the authors propose to consider the multi-rate non-Poisson RT traffic streams as an equivalent single-rate Poisson traffic stream. Then, the authors evaluate the NRT performance by converting the original system to a system offered with the equivalent RT traffic and the NRT traffic. The authors’ approximations and bounds are validated by extensive numerical examples.
- Author(s): Muhammad Asad Arfeen ; Krzysztof Pawlikowski ; Andreas Willig ; Don McNickle
- Source: IET Networks, Volume 3, Issue 1, p. 30 –40
- DOI: 10.1049/iet-net.2013.0148
- Type: Article
- + Show details - Hide details
-
p.
30
–40
(11)
Internet traffic at various tiers of service providers is essentially a superposition or active mixture of traffic from various sources. Statistical properties of this superposition and a resulting phenomenon of scaling are important for network performance (queuing), traffic engineering (routing) and network dimensioning (bandwidth provisioning). In this article, the authors study the process of superposition and scaling jointly in a non-asymptotic framework so as to better understand the point process nature of cumulative input traffic process arriving at telecommunication devices (e.g., switches, routers). The authors further assess the scaling dynamics of the structural components (packets, flows and sessions) of the cumulative input process and their relation with superposition of point processes. Classical and new results are discussed with their applicability in access and core networks. The authors propose that renewal theory-based approximate point process models, that is, Pareto renewal process superposition and Weibull renewal process superposition can model the similar second-order scaling, as observed in traffic data of access and backbone core networks, respectively.
- Author(s): Vidarshana W. Bandara ; Ali Pezeshki ; Anura P. Jayasumana
- Source: IET Networks, Volume 3, Issue 1, p. 41 –53
- DOI: 10.1049/iet-net.2013.0123
- Type: Article
- + Show details - Hide details
-
p.
41
–53
(13)
Models for Internet traffic anomalies greatly benefit a range of applications including robust network design, network provisioning and performance studies. A novel approach to analyse and model network traffic anomalies is presented. The proposed approach individually characterises different aspects of anomalies, such as origin, termination, propagation and changes in duration and volume, with common random processes. These characteristics are then integrated into a single model that successfully captures the overall anomaly behaviours. Characterisation of each anomaly property requires only a few parameters, leading to a concise set of parameters for the entire model. Although the model is calibrated with local measurements made at nodes, it successfully represents the global behaviours of anomalies over the network. The proposed model is applicable both at nodal level and at subnet level. This enables hierarchically analysing large and sophisticated networks. Anomalies are analysed using a multi-scale analysis framework based on which, a real-time monitoring system that efficiently communicate ongoing anomaly information across the network is developed. The system is also used for learning regional model parameters distributively. Internet2 traffic data is analysed using the framework, and the corresponding model parameters are derived. These results provide insight on the nature of anomalies in networks.
- Author(s): Constandinos X. Mavromoustakis ; George Mastorakis ; Athina Bourdena ; Evangelos Pallis
- Source: IET Networks, Volume 3, Issue 1, p. 54 –63
- DOI: 10.1049/iet-net.2013.0132
- Type: Article
- + Show details - Hide details
-
p.
54
–63
(10)
This study proposes a resource intensive traffic-aware scheme, incorporated into an energy-efficient routing protocol that enables maximum energy conservation and efficient data flow coordination, among secondary communicating nodes with heterogeneous spectrum availability in cognitive radio networks. The proposed scheme associates the backward difference of the traffic moments of each node according to a Fibonacci model, with the sleep-time duration, in order to tune the activity periods for achieving optimal energy conservation. Efficient routing protocol operation, as a matter of maximum-possible routing paths establishments and minimum delays is obtained, by utilising a signalling mechanism, developed based on a simulation scenario that includes secondary communication nodes, operating over television white spaces. The validity of the proposed Fibonacci-based backward traffic difference is verified, by conducting experimental simulation tests. Simulation results validate the efficiency of the proposed traffic-aware scheme for minimising energy consumption and routing delays, as well as maximising resources exchange between secondary communication nodes.
Editorial
Fundamental trade-offs between resource separation and resource share for quality of service guarantees
Integrated service resource reservation using queueing networks theory
Performance approximations and bounds for non-real-time traffic in an integrated service system
Internet traffic modelling: from superposition to scaling
Spatiotemporal model for Internet traffic anomalies
Energy efficient resource sharing using a traffic-oriented routing scheme for cognitive radio networks
Most viewed content
Most cited content for this Journal
-
Theoretical modelling of fog computing: a green computing paradigm to support IoT applications
- Author(s): Subhadeep Sarkar and Sudip Misra
- Type: Article
-
IoT technologies for smart cities
- Author(s): Badis Hammi ; Rida Khatoun ; Sherali Zeadally ; Achraf Fayad ; Lyes Khoukhi
- Type: Article
-
Monetization of IoT data using smart contracts
- Author(s): Ahmed Suliman ; Zainab Husain ; Menatallah Abououf ; Mansoor Alblooshi ; Khaled Salah
- Type: Article
-
SCGRP: SDN-enabled connectivity-aware geographical routing protocol of VANETs for urban environment
- Author(s): Dharani Kumari Nooji Venkatramana ; Shylaja Banagiri Srikantaiah ; Jayalakshmi Moodabidri
- Type: Article
-
Ellipse fitting model for improving the effectiveness of life-logging physical activity measures in an Internet of Things environment
- Author(s): Jun Qi ; Po Yang ; Martin Hanneghan ; Dina Fan ; Zhikun Deng ; Feng Dong
- Type: Article