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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Marjan Bozinovski

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

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

Computer networks · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 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 architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Distributed systems › distributed resource management
server selection
0.112007
Maximum availability server selection policy for efficient and reliable session control systems · IEEE/ACM Trans. Netw. 2007
Distributed systems
fault tolerance
0.012007
Maximum availability server selection policy for efficient and reliable session control systems · IEEE/ACM Trans. Netw. 2007
YearPublicationVenuePosition
2007 Maximum availability server selection policy for efficient and reliable session control systems
Marjan Bozinovski, Hans-Peter Schwefel, Ramjee Prasad
IEEE/ACM Trans. Netw.1
2001 Adaptive Call Admission Control for Wireless Multimedia Network
Marjan Bozinovski, Liljana Gavrilovska
Mobile Data Management1
2000 QoS-based policy for call admission control in mobile cellular network
abstract
This paper proposes a QoS-based strategy for call admission in mobile cellular networks, based on the past system's behavior. The algorithm is an extension of the conventional guard scheme (CGC) and demonstrates improvements compared to CGC. It reduces the new call blocking probability, increases the total carried traffic and keeps the forced call termination probability almost unchanged. The proposed policy falls into the class of fractional guard policies. Each cell builds cumulative statistics from its "experience" and accepts a new call only when predetermined handoff failure probability is not exceeded. The generic form of the algorithm is independent of cellular network topology.
Marjan Bozinovski, Petar Popovski, Liljana Gavrilovska
WCNC1