18
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

An Algorithm for Contention Resolution in Label-Switched Networks

&
Pages 63-72 | Received 30 May 2006, Accepted 21 Jul 2006, Published online: 04 Jan 2007
 

Abstract

In this article, we are comparing two schemes of contention resolution, one through loopless deflection routing and other through criticality-based contention resolution. The comparison is done on the basis of packet loss probability and average delay in the network. The networks considered for analysis are NSFnet network and 6-node network.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.