Title:
Cascaded All-Optical Shared-Memory Architecture Packet Switches Using Channel Grouping Under Bursty Traffic

dc.contributor.advisor Hughes, Joseph L. A.
dc.contributor.author Shell, Michael David en_US
dc.contributor.committeeMember Owen, Henry L.
dc.contributor.committeeMember Copeland, John A.
dc.contributor.committeeMember Richard M. Fujimoto
dc.contributor.committeeMember W. Russell Callen
dc.contributor.department Electrical and Computer Engineering en_US
dc.date.accessioned 2005-03-01T19:39:30Z
dc.date.available 2005-03-01T19:39:30Z
dc.date.issued 2004-12-01 en_US
dc.description.abstract This work develops an exact logical operation model to predict the performance of the all-optical shared-memory architecture (OSMA) class of packet switches and provides a means to obtain a reasonable approximation of OSMA switch performance within certain types of networks, including the Banyan family. All-optical packet switches have the potential to far exceed the bandwidth capability of their current electronic counterparts. However, all-optical switching technology is currently not mature. Consequently, all-optical switch fabrics and buffers are more constrained in size and can cost several orders of magnitude more than those of electronic switches. The use of shared-memory buffers and/or links with multiple parallel channels (channel grouping) have been suggested as ways to maximize switch performance with buffers of limited size. However, analysis of shared-memory switches is far more difficult than for other commonly used buffering strategies. Obtaining packet loss performance by simulation is often not a viable alternative to modeling if low loss rates or large networks are encountered. Published models of electronic shared-memory packet switches (ESMP) have primarily involved approximate models to allow analysis of switches with a large number of ports and/or buffer cells. Because most ESMP models become inaccurate for small switches, and OSMA switches, unlike ESMP switches, do not buffer packets unless contention occurs, existing ESMP models cannot be applied to OSMA switches. Previous models of OSMA switches were confined to isolated (non-networked), symmetric OSMA switches using channel grouping under random traffic. This work is far more general in that it also encompasses OSMA switches that (1) are subjected to bursty traffic and/or with input links that have arbitrary occupancy probability distributions, (2) are interconnected to form a network and (3) are asymmetric. en_US
dc.description.degree Ph.D. en_US
dc.format.extent 2158500 bytes
dc.format.mimetype application/pdf
dc.identifier.uri http://hdl.handle.net/1853/4892
dc.language.iso en_US
dc.publisher Georgia Institute of Technology en_US
dc.subject Packet switching en_US
dc.subject Optical buffering
dc.subject Networks
dc.subject Markov models
dc.subject Channel grouping
dc.subject Bursty traffic
dc.subject Banyan networks
dc.subject Asymmetric
dc.subject Analytical modeling
dc.subject All-optical networks
dc.subject Shared-memory switches
dc.subject.lcsh Optical data processing en_US
dc.subject.lcsh Packet switching (Data transmission) Mathematical models en_US
dc.subject.lcsh Computer networks en_US
dc.subject.lcsh Markov processes en_US
dc.subject.lcsh Optical communications en_US
dc.title Cascaded All-Optical Shared-Memory Architecture Packet Switches Using Channel Grouping Under Bursty Traffic en_US
dc.type Text
dc.type.genre Dissertation
dspace.entity.type Publication
local.contributor.corporatename School of Electrical and Computer Engineering
local.contributor.corporatename College of Engineering
local.relation.ispartofseries Doctor of Philosophy with a Major in Electrical and Computer Engineering
relation.isOrgUnitOfPublication 5b7adef2-447c-4270-b9fc-846bd76f80f2
relation.isOrgUnitOfPublication 7c022d60-21d5-497c-b552-95e489a06569
relation.isSeriesOfPublication 3890cd56-8ecf-424b-8074-8f5ebd8dbe15
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
shell_michael_d_200412_phd.pdf
Size:
2.06 MB
Format:
Adobe Portable Document Format
Description: