Low-complexity multiple access protocols for wavelength-division multiplexed photonic networks

Bogineni, Kalyani; Sivalingam, Krishna M.; Dowd, P.W.

doi:10.1109/49.221206

Cited by 109 publications

(33 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In pre-allocation schemes the available wavelengths are only used as data channels and are pre-assigned to transmitters or receivers in some fixed manner, so that each wavelength comprises the 'home channel' of the node(s) it is pre-allocated to. Pre-allocation schemes can be further divided into static access, which predetermine the exact time instants the nodes are allowed to access the shared channels [2,6,10,38,39], and random access schemes, where nodes can access the channels randomly [9,10,21,38,39].…”

Section: Introductionmentioning

confidence: 99%

A high-performance message prioritization and scheduling protocol for WDM star networks

2007

View full text Add to dashboard Cite

A high-performance Efficient Message Prioritization and Scheduling (EMPS) protocol, for intelligent message scheduling in Wavelength-Division Multiplexing (WDM) star networks is introduced. The performance of the well-known EATS and MSL schemes is noticeably degraded in practical networks with non-uniform destinations and non-negligible transceiver tuning latencies. Under these realistic conditions, it is common that two or more messages with the same destination have to be scheduled consecutively or at close times. In most cases, this brings about some performance penalty, owing to the delayed availability of the destination's receiver for the second (and beyond) of the consecutive messages. As the frequency of such occurrences increases, the performance degradation of the existing schemes becomes more prominent. EMPS is proposed to deal with this problem. It simultaneously considers multiple messages from different transmitting nodes and gives priority to messages intended for the least used destinations each time. By balancing the offered load in this way, EMPS minimizes the probability of having to schedule two or more messages with the same destination consecutively or at close times. Additionally, by incorporating the Minimum Scheduling Latency algorithm for channel selection, the protocol also minimizes the actual performance penalty incurred, when scheduling of consecutive messages with the same destination cannot be avoided. Extensive simulations are carried out in order to study the performance of EMPS and compare it to other efficient schemes under various conditions. The simulation results show that the proposed protocol always brings about a significant performance improvement.

show abstract

Section: Introductionmentioning

confidence: 99%

A high-performance message prioritization and scheduling protocol for WDM star networks

2007

View full text Add to dashboard Cite

show abstract

“…We discuss the relationship between our task and the variablelength problem in Section 3. The authors of [12][13][14][15] have considered the problem of scheduling a frame of fixed length for star-coupled networks with tunable transmitters/receivers, but do not address the allocation of unused time slots or rejection of inadmissible demand.…”

Section: Introductionmentioning

confidence: 99%

Minimum Rejection Scheduling in All-Photonic Networks

Saberi

Coates

2006

2006 3rd International Conference on Broadband Communications, Networks and Systems

View full text Add to dashboard Cite

Internal switches in all-photonic networks do not perform data conversion into the electronic domain, thereby eliminating a potential capacity bottleneck, but the inability to perform efficient optical buffering introduces network scheduling challenges. In this paper we focus on the problem of scheduling fixed-length frames in allphotonic star-topology networks with the goal of minimizing rejected demand. We formulate the task as an optimization problem and characterize its complexity. We describe the Minimum Rejection Algorithm (MRA), which minimizes total rejection, and demonstrate that the Fair Matching Algorithm (FMA) minimizes the maximum percentage rejection of any connection. We analyze through OPNET simulation the rejection and delay performance.

show abstract

“…The improvements proposed here are based on an extensive evaluation of two major classes of protocols: preallocation-based protocols [4] and reservationbased protocols with preallocated reservation control [5,6,7]. Our evaluation reveals that both classes of protocols typically suffer from excessive slot synchronization latency, of which the major portion consists of unused slot space.…”

Section: Introductionmentioning

confidence: 99%

“…There is a number of proposed distributed channel access protocols for use in optical multiprocessor interconnects. I-TDMA [4] is based on time division multiple access (TDMA) and preallocates slots in an interleaved fashion between channels using the source-destination allocation map. TDMA-C [5] is a reservation-based protocol that employs a separate TDMAcontrolled channel for reservation.…”

Section: Introductionmentioning

confidence: 99%

A New Token-Based Channel Access Protocol for Wavelength Division Multiplexed Multiprocessor Interconnects

Pinkston

2000

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

Low-complexity multiple access protocols for wavelength-division multiplexed photonic networks

Cited by 109 publications

References 30 publications

A high-performance message prioritization and scheduling protocol for WDM star networks

A high-performance message prioritization and scheduling protocol for WDM star networks

Minimum Rejection Scheduling in All-Photonic Networks

A New Token-Based Channel Access Protocol for Wavelength Division Multiplexed Multiprocessor Interconnects

Contact Info

Product

Resources

About