Analysis of a deterministic Manhattan network

Paschos, SA; Anagnostou, ME; Protonotarios, EN

dc.contributor.author	Paschos, SA	en
dc.contributor.author	Anagnostou, ME	en
dc.contributor.author	Protonotarios, EN	en
dc.date.accessioned	2014-03-01T02:40:54Z
dc.date.available	2014-03-01T02:40:54Z
dc.date.issued	1989	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/30268
dc.subject	Queuing Analysis	en
dc.subject	Packet Radio Network	en
dc.subject.other	Computer Networks--Protocols	en
dc.subject.other	Data Transmission--Packet Switching	en
dc.subject.other	Digital Communication Systems	en
dc.subject.other	Probability--Queueing Theory	en
dc.subject.other	Deterministic Manhattan Network	en
dc.subject.other	Deterministic Protocol	en
dc.subject.other	Manhattan Packet Radio Network	en
dc.subject.other	Radio Systems	en
dc.title	Analysis of a deterministic Manhattan network	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/MELCON.1989.50071	en
heal.identifier.secondary	http://dx.doi.org/10.1109/MELCON.1989.50071	en
heal.publicationDate	1989	en
heal.abstract	The authors explore the properties of a Manhattan packet radio network. They model the network as a grid of GI/G/1 queues. The two-step analysis involves a computation of the flows (first step) and a queuing analysis (second step), at each link of the network. A deterministic protocol is used which determines which node transmits in each time slot (slots are fixed-length time intervals).	en
heal.publisher	Publ by IEEE, Piscataway, NJ, United States	en
heal.journalName	[No source information available]	en
dc.identifier.doi	10.1109/MELCON.1989.50071	en
dc.identifier.spage	421	en
dc.identifier.epage	424	en