An efficient data structure for advance bandwidth reservations on the Internet
2002 (English)In: Proceedings of CSEE 2002: Second Annual Conference on Computer Science and Electrical Engineering. The third Annual Symposium on Computer Science and Electrical Engineering, 2002Conference paper (Refereed)
In this contribution we present a problem of resource reservation during some time. We show that the problem has a lower bound of Ω (log n) per operation on average and also give a matching upper bound algorithm.
Place, publisher, year, edition, pages
Research subject Dependable Communication and Computation Systems
IdentifiersURN: urn:nbn:se:ltu:diva-34214Local ID: 859bd300-9772-11dc-ad7f-000ea68e967bOAI: oai:DiVA.org:ltu-34214DiVA: diva2:1007464
Annual Conference on Computer Science and Electrical Engineering : 27/05/2002 - 28/05/2002
Godkänd; 2002; 20071120 (ysko)2016-09-302016-09-30Bibliographically approved