Decomposition of a Multiple Access Network into a Number of Interconnected Subnetworks.
dc.contributor.author | Karatzaglu, Minas A. | en_US |
dc.contributor.author | Ephremides, Anthony | en_US |
dc.contributor.department | ISR | en_US |
dc.date.accessioned | 2007-05-23T09:43:47Z | |
dc.date.available | 2007-05-23T09:43:47Z | |
dc.date.issued | 1989 | en_US |
dc.description.abstract | A random access system with a finite number of buffered terminals is considered. The problem of how to decompose this system into a number of interconnected subsystems in order to maximize its throughput is studied. Two different interconnection topologies are considered, a directional ring topology and a fully connected network of subsystems. For each of these two topologies the problem of maximizing the throughput is reduced to a simple maximization problem. We apply the attained results to a slotted ALOHA and a CSMA/CD system. For the former a significant improvement in the throughput performance is reported, while simulation analysis shows an expected deterioration in the delay performance, for low intensity traffic. | en_US |
dc.format.extent | 1139222 bytes | |
dc.format.mimetype | application/pdf | |
dc.identifier.uri | http://hdl.handle.net/1903/4896 | |
dc.language.iso | en_US | en_US |
dc.relation.ispartofseries | ISR; TR 1989-50 | en_US |
dc.title | Decomposition of a Multiple Access Network into a Number of Interconnected Subnetworks. | en_US |
dc.type | Technical Report | en_US |
Files
Original bundle
1 - 1 of 1