EAI Endorsed Transactions on Internet of Things

Issue 3, 2015

Editor(s)-in-Chief: Jesus Alonso-Zarate and Mischa Dohler

Articles
Information

The M/G/1 queueing model with preemptive random priorities
Appears in:
IoT 15(3): e1

Author:
Moshe Haviv

Abstract:
For the M/G/1 model, we look into a preemptive priority scheme in which the priority level is decided by a lottery. Such a scheme has no effect on the mean waiting time in the non-preemptive case (in comparison with the First Come First Served (FCFS) regime, for example). This is not the case when …For the M/G/1 model, we look into a preemptive priority scheme in which the priority level is decided by a lottery. Such a scheme has no effect on the mean waiting time in the non-preemptive case (in comparison with the First Come First Served (FCFS) regime, for example). This is not the case when priority comes with preemption. We derived the resulting mean waiting time (which is invariant
with respect to the lottery performed) and show that
it lies between the corresponding means under the FCFS and the Last Come First Served with Preemption Resume (LCFS-PR) (or equivalently, the Egalitarian Processor Sharing (EPS)) schemes. We also derive an expression for the Laplace-Stieltjes transform for the time in the system in this
model. Finally, we show how this priority scheme may lead to an improvement in the utilization of the server when customer decide whether or not to join.
more »
On mean waiting time completeness and equivalence of EDD and HOL-PJ dynamic priority in 2-class M/G/1 queue
Appears in:
IoT 15(3): e2

Authors:
Manu Gupta, Nandyala Hemachandra, Jayendran Venkateswaran

Abstract:
This paper identifies two different parametrized dynamic priority queue disciplines, earliest due date (EDD) based and head of line priority jump (HOL-PJ), which are found to be mean waiting time complete in two class M/G/1 queue. An explicit one-to-one non linear transformation is obtained between…This paper identifies two different parametrized dynamic priority queue disciplines, earliest due date (EDD) based and head of line priority jump (HOL-PJ), which are found to be mean waiting time complete in two class M/G/1 queue. An explicit one-to-one non linear transformation is obtained between earliest due date and delay dependent priority policy. Mean waiting time equivalence between these queue disciplines is established. Motivation behind the mean completeness and equivalence results is discussed from optimal control perspective. Notion of minmax fairness is introduced and it is argued that a simple global FCFS policy is the only solution for minmax fairness problem in two class by exploiting completeness in the structure of EDD based dynamic priority. Further, these completeness results are used to propose a simpler way for developing optimal control policy in celebrated c/ρ rule for two class M/G/1 queues.
more »
Flow coupling and stochastic ordering of throughputs in linear networks
Appears in:
IoT 15(3): e3

Author:
Lasse Leskelä

Abstract:
Robust estimates for the performance of complicated queueing networks can be obtained by showing that the number of jobs in the network is stochastically comparable to a simpler, analytically tractable reference network. Classical coupling results on stochastic ordering of network populations requi…Robust estimates for the performance of complicated queueing networks can be obtained by showing that the number of jobs in the network is stochastically comparable to a simpler, analytically tractable reference network. Classical coupling results on stochastic ordering of network populations require strong monotonicity assumptions which are often violated in practice. However, in most real-world applications we care more about what goes through a network than what
sits inside it. This paper describes a new approach for ordering flows instead of populations by augmenting network states with their associated flow counting processes and deriving Markov couplings of the augmented state-flow processes.
more »
End-to-End Delay Bounds for Variable Length Packet Transmissions under Flow Transformations
Appears in:
IoT 15(3): e4

Authors:
Hao Wang, Jens Schmitt

Abstract:
A fundamental contribution of network calculus is the convolution-form representation of networks which enables tight end-to-end delay bounds. Recently, this has been extended to the case where the data flow is subject to transformations on its way to the destination. Yet, the extension, based on s…A fundamental contribution of network calculus is the convolution-form representation of networks which enables tight end-to-end delay bounds. Recently, this has been extended to the case where the data flow is subject to transformations on its way to the destination. Yet, the extension, based on so-called scaling elements, only applies to a setting of identically sized data units, e.g., bits. In practice, of course, one often has to deal with variable-length packets. Therefore, in this paper, we address this case and propose two novel methods to derive delay bounds for variable-length packets subject to flow transformations. One is a relatively direct extension
of existing work and the other one represents a more
detailed treatment of packetization effects. In a numerical evaluation, we show the clear superiority of the latter one and also validate the bounds by simulation results.
more »
Analysis of fibre-loop optical buffers with a void-avoiding schedule
Appears in:
IoT 15(3): e5

Authors:
Wouter Rogiest, Jan-Pieter Dorsman, Dieter Fiems

Abstract:
In optical packet/burst switching, fibre-loop optical buffers provide a compact and effective means of contention resolution. In case of fixed packet length, the involved loop length is typically chosen matched (equal to the packet length), and the loops are arranged in parallel, constituting a sin…In optical packet/burst switching, fibre-loop optical buffers provide a compact and effective means of contention resolution. In case of fixed packet length, the involved loop length is typically chosen matched (equal to the packet length), and the loops are arranged in parallel, constituting a single-stage buffer. In this contribution, we investigate the performance of such a buffer in an asynchronous network setting, assuming batch-Poisson arrivals and assuming a so-called void-avoiding schedule. We show that by time-discretisation, the fibre-loop dynamics can be captured by a particular type of exhaustive polling model. We obtain performance measures such as the moments of the optical queue content and packet delay for the discretised model as well as for the asynchronous optical buffer. We illustrate our approach by various numerical examples.
more »

Scope

The scope of the Transactions encompasses latest advances in the growing field of the Internet of Things (IoT), with the topics of interest being: • Technologies & Protocols: sensors, energy harvesters, RFID, machine-type communications, medium access protocols, radio resource management, industrial control, real-time systems, embedded software design. • Architectures & Services: cloud-based platforms, big data processing engines, security, privacy, device management, CPS/SCADA platforms, innovative/open service architectures, data mining, service middleware, semantic service management. • Applications & Use Cases: smart cities, smart buildings, smart traffic, industrial internet of things, smart metering, smart agriculture, etc. • Standardisation Landscape: IEEE, IETF, 3GPP, ETSI, and various alliances. • Experimentation & Prototypes: real-world deployments at scale, industrial deployments, experiences with prototypes (including what didn’t work), etc. The aims of the transactions on the IoT are as follows: to attract cutting-edge publications from leading researchers and research groups around the world; to become a highly cited source of timely research findings in emerging fields of the Internet of Things; to limit revision and publication cycles to a few weeks and thus significantly increase attractiveness to publish.

Topics

The scope of the Transactions encompasses latest advances in the growing field of the Internet of Things (IoT), with the topics of interest being:

Technologies & Protocols: sensors, energy harvesters, RFID, machine-type communications, medium access protocols, radio resource management, indust…

The scope of the Transactions encompasses latest advances in the growing field of the Internet of Things (IoT), with the topics of interest being:

Technologies & Protocols: sensors, energy harvesters, RFID, machine-type communications, medium access protocols, radio resource management, industrial control, real-time systems, embedded software design.
Architectures & Services: cloud-based platforms, big data processing engines, security, privacy, device management, CPS/SCADA platforms, innovative/open service architectures, data mining, service middleware, semantic service management.
Applications & Use Cases: smart cities, smart buildings, smart traffic, industrial internet of things, smart metering, smart agriculture, etc.
Standardisation Landscape: IEEE, IETF, 3GPP, ETSI, and various alliances.
Experimentation & Prototypes: real-world deployments at scale, industrial deployments, experiences with prototypes (including what didn’t work), etc.

Scopus
DOAJ
CrossRef
EBSCO Discovery Service
[OCLC Discovery Services](https://www.worldcat.org/title/eai-endors…

Special Issues

Call for Papers: Special issue on IoT, Machine Learning and Data Analytics for Smart Environment (Manuscript submission deadline: 2022-08-15; Notification of acceptance: 2022-09-30; Submission of final revised paper: 2022-10-30; Publication of special is…

Lead Guest Editor: Mourade Azrour (Moulay Ismail University, Morocco) Guest Editor: Azeem Irshad (Faculty of Computer Science, Asghar Mall College Rawalpindi, HED, Govt. of the Punjab, Pakistan) Guest Editor: Azidine Guezzaz (Cadi Ayyad University, Morocco) Guest Editor: Jamal Mabrouki (Mohammed V University in Rabat, Faculty of Science, Morocco) Guest Editor: Said Benkirane (Cadi Ayyad University, Morocco;)

Editors-in-Chief
Der Jiunn Deng, National Changhua University of Education, Taiwan
Shancang Li, University of the West of England - UWE Bristol, UK
Area Editors
Antonella Molinaro (University Mediterranea of Reggio Calabria, Italy)
Atta Quddus (University of Surrey, UK)
Joachim …

Editors-in-Chief
Der Jiunn Deng, National Changhua University of Education, Taiwan
Shancang Li, University of the West of England - UWE Bristol, UK
Area Editors
Antonella Molinaro (University Mediterranea of Reggio Calabria, Italy)
Atta Quddus (University of Surrey, UK)
Joachim Sachs (Ericsson, Sweden)
Kan Zheng (BUPT, China)
Liljana Gavrilovska (University Sts. Cyril and Methodius, Macedonia)
Maria Rita Palattella (University of Luxembourg, Luxembourg)
Rose Qingyang Hu (Utah State University, USA)
Xuan Liu (Future Network Research Center, Southeast University, China)
Chien-Liang Chen (Overseas Chinese University, Taichung, Taiwan)
Yu-Liang Liu (Overseas Chinese University, Taiwan)
Thomas Watteyne (INRIA, France; Linear Technologies, USA)
Pietro Manzoni (Universitat Politècnica de València)
Ahmet Çağdaş Seçkin (Uşak University, Turkey)
Xavi Vilajosana (UOC, Spain; Worldsensing, Spain)
Qindong Sun (Xi’an University of Technology, China)
Ripon Patgiri (National Institute of Technology Silchar, India)
Shanshan Zhao (University of West England, UK)
Kamran Ali (Beijing University of Posts & Telecommunications, China)
Muddesar Iqbal (London South Bank University, UK)
Yun Zhao (Shanxi Agricultural University, China)

Journal Blurb

Visit the new journal website to submit and consult our contents: https://publications.eai.eu/index.php/iot/index

Publisher: EAI
ISSN: 2414-1399
Volume: 1

Published: 2015-11-30

The M/G/1 queueing model with preemptive random priorities

On mean waiting time completeness and equivalence of EDD and HOL-PJ dynamic priority in 2-class M/G/1 queue

Flow coupling and stochastic ordering of throughputs in linear networks

End-to-End Delay Bounds for Variable Length Packet Transmissions under Flow Transformations

Analysis of fibre-loop optical buffers with a void-avoiding schedule

About EAI

Community

Publish with EAI