Transmissions in a network with capacities and delays

dc.contributor.author	Καγάρης, Δημήτριος	el
dc.contributor.author	Πάντζιου, Γραμματή Ε.	el
dc.contributor.author	Τραγούδας, Σπύρος	el
dc.contributor.author	Ζαρολιάγκης, Χρήστος	el
dc.date.accessioned	2015-05-24T20:30:48Z
dc.date.available	2015-05-24T20:30:48Z
dc.date.issued	2015-05-24
dc.identifier.uri	http://hdl.handle.net/11400/11088
dc.rights	Αναφορά Δημιουργού-Μη Εμπορική Χρήση-Όχι Παράγωγα Έργα 3.0 Ηνωμένες Πολιτείες	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/us/	*
dc.source	http://onlinelibrary.wiley.com/doi/10.1002/(SICI)1097-0037(199905)33:3%3C167::AID-NET2%3E3.0.CO;2-J/abstract	en
dc.subject	διαβίβαση δεδομένων
dc.subject	αραιό δίκτυο
dc.subject	χρόνος μετάδοσης
dc.subject	βέλτιστη διαδρομή
dc.subject	δυναμικός αλγόριθμος
dc.subject	data transmission
dc.subject	sparse network
dc.subject	transmission time
dc.subject	quickest path
dc.subject	dynamic algorithm
dc.title	Transmissions in a network with capacities and delays	en
heal.type	journalArticle
heal.classification	Πληροφορική
heal.classification	Μηχανική υπολογιστών
heal.classification	Computer science
heal.classification	Computer engineering
heal.classificationURI	N/A-Πληροφορική
heal.classificationURI	N/A-Μηχανική υπολογιστών
heal.classificationURI	http://skos.um.es/unescothes/C00750
heal.classificationURI	http://id.loc.gov/authorities/subjects/sh85029495
heal.identifier.secondary	DOI: 10.1002/(SICI)1097-0037(199905)33:3<167::AID-NET2>3.0.CO;2-J
heal.language	en
heal.access	campus
heal.recordProvider	Τεχνολογικό Εκπαιδευτικό Ίδρυμα Αθήνας. Σχολή Τεχνολογικών Εφαρμογών. Τμήμα Μηχανικών Πληροφορικής Τ.Ε.	el
heal.publicationDate	1999-05
heal.bibliographicCitation	Kagaris, D., Pantziou, G., Tragoudas, S. and Zaroliagis. C. (1999) Transmissions in a Network with Capacities and Delays. Networks. [Online] 33 (3). pp.167-174. Available from: http://onlinelibrary.wiley.com [Accessed 24/05/2015]	en
heal.abstract	We examine the problem of transmitting in minimum time a given amount of data between a source and a destination in a network with finite channel capacities and nonzero propagation delays. In the absence of delays, the problem has been shown to be solvable in polynomial time. In this paper, we show that the general problem is NP-complete. In addition, we examine transmissions along a single path, called the quickest path, and present algorithms for general and special classes of networks that improve upon previous approaches. The first dynamic algorithm for the quickest path problem is also given.	en
heal.publisher	John Willey & Sons	en
heal.journalName	Networks	en
heal.journalType	peer-reviewed
heal.fullTextAvailability	true