A conflict-free traffic assignment algorithm using forward planning

Authors:
Victor Yau;Krzysztof Pawlikowski
Affiliations:
Department of Computer Science, University of Canterbury, Christchurch, New Zealand;Department of Computer Science, University of Canterbury, Christchurch, New Zealand
Venue:
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Year:
1996

Citing 7
Cited 1

Steady-state simulation of queueing processes: survey of problems and solutions

ACM Computing Surveys (CSUR)
Asynchronous transfer mode: solution for broadband ISDN

Asynchronous transfer mode: solution for broadband ISDN
Buffer sharing in conflict-free WDMA networks

IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 2)
Distributed stochastic discrete-event simulation in parallel time streams

WSC '94 Proceedings of the 26th conference on Winter simulation
A spectral method for confidence interval generation and run length control in simulations

Communications of the ACM - Special issue on simulation modeling and statistical computing
Multiprocessor memory organization and memory interference

Communications of the ACM
A General Model for Memory Interference in Multiprocessors

IEEE Transactions on Computers

Automating parallel simulation using parallel time streams

ACM Transactions on Modeling and Computer Simulation (TOMACS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In multichannel telecommunication networks, switching system and processor-memory inter-connects the need for conflict-free traffic assignment arises whenever packets (or requests) are to be directed from input buffers (processors) to specific outlets (modules). In this paper we present an algorithm, based on Forward Planning, which can be used in the above-mentioned applications for scheduling conflict-free transfers of packets from inputs to outputs. The pevormance of the algorithm is evaluated in the sense of throughput and delay, and compared with that of SDR, an earlier proposed algorithm featuring 100% assignment efficiency. Then, its worst case computational complexity is compared with that of SDR and several suboptimal low-complexity algorithm reported in literature. It is shown that Forward Planning of packet transmissions ofers significant performance improvements if finite capacity of buffers is taken into account. Furthermore, the proposed algorithm has the lowest order of computational complexity and pennits simpler buffer organisation and access modes.