On applying stochastic network calculus

Chen, Lin; Deng, Yiping; Jiang, Yuming

doi:10.1007/s11704-013-3095-1

Cited by 4 publications

(4 citation statements)

References 43 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An upper arrival envelope that satisfies Def. 1 is derived for Lévy processes in [31,Lem. 6] using Doob's martingale inequality.…”

Section: Parallel Classical Queuesmentioning

confidence: 99%

“…To this end, we study a broad range of non-trivial random processes, which makes the analysis significantly more difficult. We use models known from effective bandwidths [24], [25] and the stochastic network calculus [25]- [29] and use Martingale techniques [30], [31] to derive tail bounds of arrivals and service to understand the age of relevant systems. The theory includes models of wireless channels, schedulers with random cross-traffic, and tandem networks thereof, as well as basic queueing systems such as the M|M|1 queue.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Statistical Age-of-Information Bounds for Parallel Systems: When Do Independent Channels Make a Difference?

Fidler,

Champati,

Widmer

et al. 2023

IEEE J. Sel. Areas Inf. Theory

View full text Add to dashboard Cite

This paper contributes tail bounds of the age-ofinformation of a general class of parallel systems and explores their potential. Parallel systems arise in relevant cases, such as in multi-band mobile networks, multi-technology wireless access, or multi-path protocols, just to name a few. Typically, control over each communication channel is limited and random service outages and congestion cause buffering that impairs the age-ofinformation. The parallel use of independent channels promises a remedy, since outages on one channel may be compensated for by another. Surprisingly, for the well-known case of M|M|1 queues we find the opposite: pooling capacity in one channel performs better than a parallel system with the same total capacity. A generalization is not possible since there are no solutions for other types of parallel queues at hand. In this work, we prove a dual representation of age-of-information in min-plus algebra that connects to queueing models known from the theory of effective bandwidth/capacity and the stochastic network calculus. Exploiting these methods, we derive tail bounds of the age-of-information of G|G|1 queues. Tail bounds of the age-of-information of independent parallel queues follow readily. In addition to parallel classical queues, we investigate Markov channels where, depending on the memory of the channel, we show the true advantage of parallel systems. We continue to investigate this new finding and provide insight into when capacity should be pooled in one channel or when independent parallel channels perform better. We complement our analysis with simulation results and evaluate different update policies, scheduling policies, and the use of heterogeneous channels that is most relevant for latest multi-band networks.

show abstract

“…An upper arrival envelope that satisfies Def. 1 is derived for Lévy processes in [31,Lem. 6] using Doob's martingale inequality.…”

Section: Parallel Classical Queuesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Statistical Age-of-Information Bounds for Parallel Systems: When Do Independent Channels Make a Difference?

Fidler,

Champati,

Widmer

et al. 2023

IEEE J. Sel. Areas Inf. Theory

View full text Add to dashboard Cite

show abstract

“…(2) Channel attention The shared feature images obtained from basic network first pass through the global average pooling layer [29], which can change the dimension of feature map from h×w×c to 1×1×c. The transformed feature passes through the convolution layer with a pad=0, stride=1, convolution kernel size of 1×1 and c' channels.…”

Section: Attribute Miningmentioning

confidence: 99%

Pedestrian re‐identification based on attribute mining and reasoning

Yang

Yin

et al. 2021

IET Image Processing

View full text Add to dashboard Cite

The high-level semantic information extracted from the pedestrian attribute feature is an important element for pedestrian recognition. Pedestrian attribute recognition plays an important role in both intelligent video surveillance and pedestrian re-identification promoting the convenience of searching and performance of model. This paper tries finding a practical method to improve the performance of the pedestrian re-identification by combining pedestrian attributes and identities. The multi-task learning method combines pedestrian recognition and attribute information in a direct way that considers the correlation between pedestrian attributes and identities but ignores the principle and degree of such correlation. To solve this problem, a new pedestrian recognition framework based on attribute mining and reasoning is proposed in this paper. To enhance the expression ability of attribute features, it designs spatial channel attention module (SCAM) based on attention mechanism to extract features from every attribute. SCAM can not only locate the attributes on the feature map, but also effectively mine channel features with a higher degree of association with attributes. In addition, both spatial attention model and channel attention model are integrated by multiple groups of parallel branches, which further improve the network performance. Finally, using the semantic reasoning and information transmission function of graph convolutional network, the relationship between attribute features and pedestrian features can be mined. Besides, pedestrian features with stronger expression ability can also be obtained. Experiment work is conducted in two databases, DukeMTMC-reID and Market-1501, which are commonly used in pedestrian recognition tasks. On the Market-1501 dataset, the final effect of the algorithm model CMC-1 can reach 94.74%, and mAP can reach 87.02%; on the DukeMTMC-reID dataset, CMC-1 can reach 87.03%, and mAP can reach 77.11%. The results show that our method is at the top of the existing pedestrian recognition methods.

show abstract

“…SNC is a mathematical framework designed for networks with variable resources. It allows researchers to model the random nature of energy arrivals and departures in UWSNs [5] [6]. By employing SNC, researchers can design efficient energy management strategies and guarantee a certain level of data transmission reliability even under unpredictable energy conditions.…”

Section: Introductionmentioning

confidence: 99%

Energy Harvesting using Stochastic Network Calculus for Monitoring Underwater Tunnelling Applications

Vignesh,

Sukumaran

2024

Preprint

View full text Add to dashboard Cite

The implementation of Underwater Wireless Sensor Networks (UWSNs) for applications in oceanographic environment monitoring, marine biology and ecology, and underwater infrastructure monitoring requires frequent battery replacements due to the limited energy capacity of sensor nodes. Underwater Energy Harvesting (UEH) offers a promising solution to extend sensor node lifetimes and reduce maintenance costs. Among various techniques, piezoelectricity emerges as a particularly efficient method for UEH. This research proposes a novel approach to improve energy harvesting for underwater infrastructure monitoring, specifically for underwater tunnelling applications. By implementing piezoelectric wave energy and a Stochastic Network Calculus (SNC) mathematical model, the proposed method aims to simulate Efficient Energy Harvesting (EEH) to enhance sensor node performance parameters. This includes maximising the Energy Harvesting Rate (EHR), Delivery Probability Ratio (DPR), and overall Network Throughput (NT). This research contributes to the advancement of sustainable UWSNs by enabling efficient energy management and prolonging sensor node operation.

show abstract

On applying stochastic network calculus

Cited by 4 publications

References 43 publications

Statistical Age-of-Information Bounds for Parallel Systems: When Do Independent Channels Make a Difference?

Statistical Age-of-Information Bounds for Parallel Systems: When Do Independent Channels Make a Difference?

Pedestrian re‐identification based on attribute mining and reasoning

Energy Harvesting using Stochastic Network Calculus for Monitoring Underwater Tunnelling Applications

Contact Info

Product

Resources

About