Adaptable resource management in wireless IP links

dc.contributor.author	Πασσάς, Νίκος Ι.	el
dc.contributor.author	Ζέρβας, Ευάγγελος	el
dc.contributor.author	Μεράκος, Λάζαρος Φ.	el
dc.date.accessioned	2015-05-25T10:18:37Z
dc.date.issued	2015-05-25
dc.identifier.uri	http://hdl.handle.net/11400/11106
dc.rights	Αναφορά Δημιουργού-Μη Εμπορική Χρήση-Όχι Παράγωγα Έργα 3.0 Ηνωμένες Πολιτείες	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/us/	*
dc.source	http://ieeexplore.ieee.org/	en
dc.subject	Resource management
dc.subject	RSVP
dc.subject	Wireless
dc.subject	Electronics
dc.subject	Διαχείριση πόρων
dc.subject	Ασύρματο
dc.subject	Ηλεκτρονική
dc.title	Adaptable resource management in wireless IP links	en
heal.type	conferenceItem
heal.classification	Technology
heal.classification	Electrical engineering
heal.classification	Τεχνολογία
heal.classification	Ηλεκτρολογία Μηχανολογία
heal.classificationURI	http://id.loc.gov/authorities/subjects/sh85133147
heal.classificationURI	http://zbw.eu/stw/descriptor/18426-4
heal.classificationURI	N/A-Τεχνολογία
heal.classificationURI	N/A-Ηλεκτρολογία Μηχανολογία
heal.keywordURI	http://zbw.eu/stw/descriptor/10455-2
heal.identifier.secondary	DOI: 10.1109/VETECF.2003.1285300
heal.dateAvailable	10000-01-01
heal.language	en
heal.access	forever
heal.publicationDate	2003
heal.bibliographicCitation	Passas, N.I., Zervas, E. & Merakos, L.F. (2003) Adaptable resource management in wireless IP links, In: Proceedings of the IEEE 58th Vehicular Technology Conference, VTC2003-Fall. Orlando, FL, United States. 6-9 October, 2003. [online] 58 (3). p. 1628-1631. Available from: http://ieeexplore.ieee.org/	en
heal.abstract	Although the Resource ReSerVation Protocol. (RSVP) is considered efficient for fixed access networks, its performance is problematic over wireless links, due to the variable available bandwidth they provide, asking for adaptable resource management techniques. If, for example, the channel quality falls to a level that the available bandwidth cannot support all reservations of admitted flows, then none of them is operating properly. One solution to this problem is to reject one or more of the flows in order to maintain Quality of Service (QoS) to the rest. In this paper describes a flow rejection mechanism that is based on priorities and bandwidth requirements, and aims at minimizing the number of rejected flows. Simulation results have shown that, compared to a random rejection mechanism, the attained flow rejection probability is significantly reduced, especially for high priority flows, while, at the same time, the bandwidth utilization remains at the same level.	en
heal.publisher	IEEE	en
heal.fullTextAvailability	false
heal.conferenceName	IEEE 58th Vehicular Technology Conference, VTC2003-Fall	en
heal.conferenceItemType	poster