End-to-End Delay Analysis in Wireless Network Coding: A Network Calculus-Based Approach

Li, Huanzhong; Li, Xue; He, Wenbo; Li, Jian; Wang, Dou

doi:10.1109/icdcs.2011.31

Cited by 25 publications

(12 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…f2,1 has higher priority than that of f1,1 and of f1,2. Also, according to [21], we assume that the maximum size of packet of a data flow is 1500 byte, and the burst data transfer parameter is 1.1Mb. In PGPS, w i,k of data flows are 0.3, 0.2, and 0.5.…”

Section: Numerical Resultsmentioning

confidence: 99%

Hybrid Scheduling for Quality of Service Guarantee of Multimedia Data Flows in Software Defined Networks

Huang

Yan

et al. 2015

Proceedings of the 8th International Conference on Mobile Multimedia Communications

View full text Add to dashboard Cite

Supporting diverse Quality of Service (QoS) performance for heterogeneous data flows generated by multimedia applications has been a challenging issue that is not fully addressed in the Internet. Software Defined Network, which decouples data forwarding and network control, offers a promising approach to QoS guarantee of multimedia flows in the future Internet. However, the currently available QoS mechanisms proposed for SDN have not fully considered the diversity in performance requirements of multimedia data flows. In order to tackle this challenge, we propose a hybrid scheduling scheme in this paper to combine priority queueing with Packet General Processor Sharing (PGPS) algorithm to provide QoS guarantee for multimedia applications in SDN. We apply network calculus to develop modeling and analysis techniques to evaluate the QoS performance of the proposed scheduling scheme. Both analytical and numerical results obtained in this paper show that the proposed scheme can provide QoS guarantee for meeting diverse requirements of multimedia applications.

show abstract

Section: Numerical Resultsmentioning

confidence: 99%

Hybrid Scheduling for Quality of Service Guarantee of Multimedia Data Flows in Software Defined Networks

Huang

Yan

et al. 2015

Proceedings of the 8th International Conference on Mobile Multimedia Communications

View full text Add to dashboard Cite

show abstract

“…Jayachandran and Andrews [9] have applied a coordinated EDF scheduler for wireless networks and obtained asymptotic bounds on end-to-end delays. Li et al [10] have used network calculus to analyze and derive upper-bound for end-toend delays. Li, Li, and Mohapatra [11] have proposed a distributed policy for scheduling packets with end-to-end delay guarantees.…”

Section: Related Workmentioning

confidence: 99%

Packet Scheduling for Real-Time Surveillance in Multihop Wireless Sensor Networks With Lossy Channels

Hou

2015

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

We consider the problem of real-time surveillance where remote sensors transmit data periodically to a control center through multihop transmissions. All data need to be delivered within a common deadline, which is the time that the control center makes control decisions. We propose a model that jointly considers the end-to-end delay constraints and delivery ratio requirements of flows, the need for multihop transmissions, and the unreliable nature of wireless transmissions. We develop a framework for designing feasibility-optimal policies. We then demonstrate the utility of this framework by considering two types of systems: one where sensors can transmit and receive packets simultaneously, possibly on different channels, and the other where sensors cannot. For the first type of systems, we propose an online distributed scheduling policy and prove that the policy is feasibility optimal. We also provide a heuristic for the second type of systems. We show that this heuristic is still feasibility optimal for some topologies. Simulation results show that both policies outperform state-of-the-art policies by large margins.Index Terms-Wireless sensor networks, multi-hop, end-to-end deadline scheduling.

show abstract

“…Scaling functions widen the applying range of the network calculus, which can't apply to any kind of processing where data are scaled. [10] uses information flows instead of packet flow when applying the network calculus to networks with broadcast or multicast.…”

Section: Related Workmentioning

confidence: 99%

End-to-End Delay Bounds Analysis of Different On-chip Cache Coherence Policies: A Network Calculus-Based Approch

Lai

Wang

2012

2012 Sixth Asia Modelling Symposium

View full text Add to dashboard Cite

To analyze and compare end-to-end delay bounds of different cache coherence policies will provide beneficial guidelines for NoC design. However, it is not an easy task, because 1)packet flows generated by cache coherence events do not conform to the Poisson process, traditional queue theorem can't be applied to the performance analyzing for the NoCs that support cache coherence; 2) broadcast or multicast operations, which will duplicate the cache coherence packets, makes the analysis much more complicated. To address these challenges, in this paper, we use the stochastic network calculus to analyze the end-to-end delay bounds of different cache coherence policies. Specifically, we utilize Markovmodulated On-Off (MMOO) flow to model the arrival process of cache coherence events, and then deduce the general end-toend delay bounds for different cache coherence policies. Furthermore, to deal with packet duplication issues in broadcast or multicast operations, we develop an analytical model based on scaling functions to study their impacts on end-to-end delay bounds.

show abstract

End-to-End Delay Analysis in Wireless Network Coding: A Network Calculus-Based Approach

Cited by 25 publications

References 17 publications

Hybrid Scheduling for Quality of Service Guarantee of Multimedia Data Flows in Software Defined Networks

Hybrid Scheduling for Quality of Service Guarantee of Multimedia Data Flows in Software Defined Networks

Packet Scheduling for Real-Time Surveillance in Multihop Wireless Sensor Networks With Lossy Channels

End-to-End Delay Bounds Analysis of Different On-chip Cache Coherence Policies: A Network Calculus-Based Approch

Contact Info

Product

Resources

About