A multipath self-routing switch

Henrion, M.A.; Eilenberger, G.; Petit, Guido H.; Parmentier, P.

doi:10.1109/35.210395

Cited by 17 publications

(3 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…6. Note that this multi server queueing system can be used to model an output port of an ATM switching element, which has been used as a building block to construct a large ATM switching network (Henrion (1990(Henrion ( , 1993). The above traffic descriptors for the homogeneous traffic case, are also well suited for describing heterogeneous traffic.…”

Section: 0e+oomentioning

confidence: 99%

Buffer requirements in ATM-related queueing models with bursty traffic: an alternative approach

Steyaert¹,

Xiong

1996

Data Communications and Their Performance

View full text Add to dashboard Cite

During the past couple of years, a lot of effort has been put into solving all kinds of Markov Modulated discrete-time queueing models, which occur, almost in a natural way, in the performance analysis of slotted systems, such as ATM multiplexers and switching elements. However, in most cases, the practical application of such solutions is limited, due to the large state space that is usually involved. In this paper, we try to set a first step towards obtaining approximate solutions for a discrete-time multiserver queueing model with a general heterogeneous Markov Modulated cell arrival process, that allow accurate predictions concerning the behavior of the buffer occupancy in such a model, and still remains tractable, both from an analytical and a computational point-of-view. We first introduce a solution technique which leads to a closed-form expression for the jOint probability generating function of the buffer occupancy and the state of the arrival process, from which an expression for V(z), the probability generating function of the buffer occupancy is easily derived. Based on this result, for the single-server case, we propose an approximation for the boundary probabilities, that reduces all calculations to an absolute minimum. In addition, we show how accurate data for the distribution of the buffer occupancy can be obtained, by using multiple poles of V(z) in the geometric-tail approximation of the distribution.

show abstract

Section: 0e+oomentioning

confidence: 99%

Buffer requirements in ATM-related queueing models with bursty traffic: an alternative approach

Steyaert¹,

Xiong

1996

Data Communications and Their Performance

View full text Add to dashboard Cite

show abstract

“…The additional header is removed once the packet reaches the desired output port. Much work has been carried out on switch structures and self-routing algorithms [11], [27]. The robustness and simplicity of self-routing also makes it a promising candidate 0733-8724/03$17.00 © 2003 IEEE for pure all-optical packet-switched networks [15], [28].…”

Section: Introductionmentioning

confidence: 99%

A novel self-routing address scheme for all-optical packet-switched networks with arbitrary topologies

Yuan

et al. 2003

J. Lightwave Technol.

View full text Add to dashboard Cite

Pure all-optical packet-switched networks in which both header processing and packet routing are carried out in the optical domain overcome the bandwidth bottlenecks of optoelectronic conversions and therefore are expected to meet the needs of next generation high speed networks. Due to the limited capabilities of available optical logic devices, realizations of pure all-optical packet-switched networks in the near future will likely employ routing schemes that minimize the complexity of routing control. In this paper, we propose a novel self-routing scheme that identifies the output ports of the nodes in a network instead of the nodes themselves. The proposed address scheme requires single bit processing only and is applicable to small to medium size pure all-optical packet-switched networks with arbitrary topologies. Unlike traditional self-routing schemes, multiple paths between two nodes can be defined. Hierarchical address structure can be used in the proposed routing scheme to shorten the address.

show abstract

“…Figure 1 shows an example whereby an ATM cell is internally converted into eight minicells, where the first minicell is the 'self-routeing tag (SRT)' which contains all the necessary routeing information. The advantages of this internal transfer mode are: (1) to reduce the required buffer capacity for the switching element and the total network cell delay; (2) to facilitate the adaptation to different external cell (or packet) sizes; (3) to optimize the internal characteristics for optimum usage of technologies, which is probably the most important advantage. 2 Since all the N inlets of the switching element are synchronized on minislots, the converted cells may arrive on minislot boundaries (see Figure 2).…”

Section: Introductionmentioning

confidence: 99%

Output‐queue contents in a ‘minislot’ synchronized ATM switch

Xiong

Bruneel

1995

Int J Communication

View full text Add to dashboard Cite

An N × N switching element with output queueing, as used in a large ATM switching network, is considered. All the inlets of the switching element are synchronized on ‘minislots’, where a minislot is the fixed‐length time unit for the transmission of one ‘minicell’. When entering the switching network, an ATM cell is converted into a ‘minicell‐train’, consisting of a fixed number of minicells. Using an active/silent model, it is assumed that on each inlet of the switching element, the number of minicelltrains in an active period and the length of a silent period are both geometrically distributed, and the arriving minicell‐trains are uniformly distributed among all the outlets. The performance of the switching element can be obtained by analysing one single output queue, which is modeled as a discrete‐time single‐server queuing system with train arrivals. In this paper, an upper bound and an approximate expression for the mean queue length are derived. More importantly, an analytical method is developed to obtain a tight upper bound and a good approximation for the tail distribution of the queue length. This analytical method is very useful in buffer dimensioning of ATM switches.

show abstract

A multipath self-routing switch

Cited by 17 publications

References 1 publication

Buffer requirements in ATM-related queueing models with bursty traffic: an alternative approach

Buffer requirements in ATM-related queueing models with bursty traffic: an alternative approach

A novel self-routing address scheme for all-optical packet-switched networks with arbitrary topologies

Output‐queue contents in a ‘minislot’ synchronized ATM switch

Contact Info

Product

Resources

About