Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Nikos Argiriou

dblp:53/5711 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2007
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 1 first-authorSystems, architecture and hardware · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Wireless networking · 50% Content delivery and video streaming · 50%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Content delivery and video streaming
adaptive video streaming
0.012002
Channel Sharing by Rate Adaptive Streaming Applications · INFOCOM 2002
Wireless networking › cognitive radio › spectrum access
channel sharing
0.012002
Channel Sharing by Rate Adaptive Streaming Applications · INFOCOM 2002

Methods — techniques the papers use, named apart from their topics

analytical modeling · 0.0
YearPublicationVenuePosition
2007 Channel sharing by multi-class rate adaptive streams: Performance region and optimization
Nikos Argiriou, Leonidas Georgiadis
Comput. Networks1
2004 Channel sharing by rate-adaptive streaming applications
Nikos Argiriou, Leonidas Georgiadis
Perform. Evaluation1
2002 Channel Sharing by Rate Adaptive Streaming Applications
abstract
There are various techniques for adapting the transmission rate of an application while maintaining the perceived quality at the receiver at acceptable levels. Shared channel systems can use this rate adaptation capability to increase the number of concurrent applications in the system. This can be achieved by appropriately modifying the rate of the already running applications when a new connection arrives in the system. We present an analytical model for a class of algorithms for channel sharing by rate adaptive applications. We provide means for calculating performance measures related to the quality of reception of an application. We also present the design of algorithms that ensure fair channel sharing while keeping the application performance within acceptable levels.
Leonidas Georgiadis, Nikos Argiriou
INFOCOM2