Delay analysis of randomised algorithms for link scheduling in wireless networks

Ghiasian, Ali; Saidi, Hossein; Behdadfar, Mohammad

doi:10.1504/ijahuc.2013.054017

Cited by 4 publications

(5 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We consider the characteristics of non‐uniform traffic to design two algorithms which are named Rnd4 and Rnd4rm . In design of those algorithms, we follow our achievements in [15] to attain less average queue length and then less average delay. The idea is to increase the probability of achieving the optimal solution.…”

Section: Proposed Algorithmsmentioning

confidence: 99%

“…In our previous work, we have analytically characterised the delay behaviour of randomised algorithms for link scheduling in wireless networks [15]. It has been shown that the average delay of a randomised algorithm is inversely proportional to the probability that the algorithm finds the optimal solution [15]. In other words, to keep delay small, it is necessary to have an algorithm that finds good matchings.…”

Section: Introductionmentioning

confidence: 99%

“…Following the outcomes of [15], our main focus in this paper is to propose two randomised algorithms that exploit Tassiulas idea in [14], but improve its delay performance specifically when input traffic is non‐uniform. Our simulation results illustrate that in case of non‐uniform input traffic, Tassiulas algorithm cannot follow MWM performance.…”

Section: Introductionmentioning

confidence: 99%

“…In Section 3, our proposed algorithms are defined. Specifically, according to our analytical findings in [15] the proposed algorithms are aimed to improve the average delay compared to some well‐known algorithms in the literature when input traffic is non‐uniform. In Section 4, delay behaviour of the algorithms are evaluated by a number of simulation.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Randomised scheduling algorithm for virtual output queuing switch at the presence of non‐uniform traffic

Jamali¹,

Ghiasian

2019

IET Networks

Self Cite

View full text Add to dashboard Cite

Virtual Output Queuing (VOQ) is a well-known queuing discipline in data switch architecture that eliminates Head Of Line (HOL) blocking issue. In VOQ scheme, for each output port, a separate FIFO is maintained by each input port. Consequently, a scheduling algorithm is required to determine the order of service to virtual queues at each time slot. Maximum Weight Matching (MWM) is a well-known scheduling algorithm that achieves the entire throughput region. Despite of outstanding attainable throughput, high complexity of MWM makes it an impractical algorithm for implementation in high-speed switches. To overcome this challenge, a number of randomized algorithms have been proposed in the literature. But they commonly perform poorly when input traffic does not uniformly select output ports. In this paper, we propose two randomized algorithms that outperform the wellknown formerly proposed solutions. We exploit a method to keep a parametric number of heavy edges from the last time matching and mix it by randomly generated matching to produce a new schedule. Simulation results confirm the superior performance of the proposed algorithms.

show abstract

Section: Proposed Algorithmsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Randomised scheduling algorithm for virtual output queuing switch at the presence of non‐uniform traffic

Jamali¹,

Ghiasian

2019

IET Networks

Self Cite

View full text Add to dashboard Cite

show abstract

“…M W IS, is one of the well-known NP-Hard problems (Sharma et al, 2006). Due to its favourable characteristics in terms of throughput and delay, many researches have been conducted to approximation (M W IS) by other simpler algorithms (Chaporkar et al, 2008;Joo, 2008) and characterising the delay performance of (M W IS) and its approximations (Le et al, 2009;Neely, 2008;Gupta and Shroff, 2011;Ghiasian et al, 2012). In this paper, we use different approach to cope with complexity of (M W IS).…”

Section: Literature Reviewmentioning

confidence: 99%

Complexity Reduction of Throughput Optimal Link Scheduling Algorithm through Topology Control in Wireless Networks

Ghiasian

Omoomi

Saidi

2015

IJAHUC

Self Cite

View full text Add to dashboard Cite

In single channel wireless networks, concurrent transmissions at different links may interfere with each other. To improve system throughput, a scheduling algorithm is necessary to choose a subset of links for data transmission. Throughput optimal link scheduling discipline is generally an NP-hard problem. In this paper, we utilise the concept of line graph and extend it to line multigraph to cope with the complexity issue of the maximum weight scheduling (MWS) algorithm. The necessary and sufficient conditions for reducing the complexity of MWS in terms of network topology are derived. We prove that the complexity of eLehot is polynomial time provided that conflict graph does not contain seven derived forbidden graphs as induced subgraphs. We also propose eLehot algorithm for detecting whether a graph is line multigraph and output its root graph. The results of this paper introduce a new approach in wireless topology control where the target is complexity reduction.

show abstract

A QoS aware message scheduling algorithm in Internet of Things environment

Abdullah

Yang

2013

2013 IEEE Online Conference on Green Communications (OnlineGreenComm)

View full text Add to dashboard Cite

Delay analysis of randomised algorithms for link scheduling in wireless networks

Cited by 4 publications

References 30 publications

Randomised scheduling algorithm for virtual output queuing switch at the presence of non‐uniform traffic

Randomised scheduling algorithm for virtual output queuing switch at the presence of non‐uniform traffic

Complexity Reduction of Throughput Optimal Link Scheduling Algorithm through Topology Control in Wireless Networks

A QoS aware message scheduling algorithm in Internet of Things environment

Contact Info

Product

Resources

About