Please use this identifier to cite or link to this item:
http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/9084
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chaubey, V.K. | - |
dc.date.accessioned | 2023-02-08T09:17:09Z | - |
dc.date.available | 2023-02-08T09:17:09Z | - |
dc.date.issued | 2011 | - |
dc.identifier.uri | https://ieeexplore.ieee.org/document/6139451 | - |
dc.identifier.uri | http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/9084 | - |
dc.description.abstract | One of the key problems in application of packet switching in optical domain is the handling of packet contentions that take place when two or more incoming packets are directed to the same output line. This problem can be solved by incorporating fiber delay lines (FDLs) in the switch architecture. In the present paper simulated behavior of an optical node has been realized by using an n × m optical switch and recirculating optical delay lines, A mathematical model for the proposed switch architecture is developed employing packet queuing control to estimate the blocking probability for the incoming traffic. This investigation infers the scaling behaviors of the proposed architecture to maintain efficient use of the buffer under Poisson traffic loading. | en_US |
dc.language.iso | en | en_US |
dc.publisher | IEEE | en_US |
dc.subject | EEE | en_US |
dc.subject | Optical Packet Switching Networks | en_US |
dc.subject | Fiber Delay Lines | en_US |
dc.subject | Packet Recirculation | en_US |
dc.subject | Contention Resolution | en_US |
dc.subject | Node architecture | en_US |
dc.subject | Incoming Traffic | en_US |
dc.subject | Throughput | en_US |
dc.title | Modeling and performance analysis of optical packet switching network using fiber delay lines | en_US |
dc.type | Article | en_US |
Appears in Collections: | Department of Electrical and Electronics Engineering |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.