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.

Milan Kovacevic

dblp:25/2240 · DBLP profile ↗
← Back
9ranked-venue papers
7as first author
0since 2021 · last 1996
—ORCID · none

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

Computer networks · 9 · 7 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
7 papers
Optical networks · 65% Routing and switching · 19% Wireless networking · 10%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Interconnection networks and networks-on-chip · 79% Performance modeling and evaluation · 21%

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

TopicWeightPapersLastEvidence papers
Optical networks
all-optical networks
0.031996
Benefits of Wavelength Translation in All-Optical Clear-Channel Networks · IEEE J. Sel. Areas Commun. 1996
On Wavelength Translation in All-Optical Networks · INFOCOM 1995
An All-Optical Multifiber Tree Network · INFOCOM 1993
Optical networks
wavelength conversion
0.021996
Benefits of Wavelength Translation in All-Optical Clear-Channel Networks · IEEE J. Sel. Areas Commun. 1996
On Wavelength Translation in All-Optical Networks · INFOCOM 1995
Optical networks › optical network architecture
linear lightwave network
0.021995
A new optical signal routing scheme for linear lightwave networks · IEEE Trans. Commun. 1995
Rooted Routing in Linear Lightwave Networks · INFOCOM 1992
Optical networks
optical routing
0.021995
A new optical signal routing scheme for linear lightwave networks · IEEE Trans. Commun. 1995
Rooted Routing in Linear Lightwave Networks · INFOCOM 1992
Network performance modeling › loss systems
blocking probability
0.011996
Benefits of Wavelength Translation in All-Optical Clear-Channel Networks · IEEE J. Sel. Areas Commun. 1996
Routing and switching
circuit switching
0.011996
Benefits of Wavelength Translation in All-Optical Clear-Channel Networks · IEEE J. Sel. Areas Commun. 1996
Routing and switching › geographic routing
greedy routing
0.011996
On Torus Topologies with Random Extra Links · INFOCOM 1996
Routing and switching
routing
0.011996
On Torus Topologies with Random Extra Links · INFOCOM 1996
Interconnection networks and networks-on-chip
network topology
0.011996
On Torus Topologies with Random Extra Links · INFOCOM 1996
Interconnection networks and networks-on-chip › network topology
torus network
0.011996
On Torus Topologies with Random Extra Links · INFOCOM 1996
Optical networks › optical network architecture
multihop lightwave network
0.011994
On the Performance of Shared-Channel Multihop Lightwave Networks · INFOCOM 1994
Wireless networking › medium access control
TDMA
0.011994
On the Performance of Shared-Channel Multihop Lightwave Networks · INFOCOM 1994
Wireless networking › network capacity
throughput bounds
0.011994
On the Performance of Shared-Channel Multihop Lightwave Networks · INFOCOM 1994
Optical networks › WDM networks
virtual topology
0.011994
On the Performance of Shared-Channel Multihop Lightwave Networks · INFOCOM 1994
Optical networks › fiber optic network
multifiber networks
0.011993
An All-Optical Multifiber Tree Network · INFOCOM 1993
Performance modeling and evaluation
analytical modeling
0.011996
On Torus Topologies with Random Extra Links · INFOCOM 1996
Optical networks
wavelength-division multiplexing
0.011995
On Wavelength Translation in All-Optical Networks · INFOCOM 1995
Performance modeling and evaluation › network performance analysis
throughput and delay analysis
0.011994
On the Performance of Shared-Channel Multihop Lightwave Networks · INFOCOM 1994
Optical networks
optical amplifier
0.011992
Rooted Routing in Linear Lightwave Networks · INFOCOM 1992

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

analytical modeling · 0.1expected hop count analysis · 0.0throughput upper bound · 0.0power budget analysis · 0.0simulation · 0.0rooted routing · 0.0multiplexing techniques · 0.0
YearPublicationVenuePosition
1996 On Torus Topologies with Random Extra Links
abstract
We study networks based on torus topologies enhanced with additional, arbitrary assigned links. We develop a method for analyzing the expected number of hops which can be applied to any torus topology with randomly assigned extra links when the simplest greedy routing is used. Using this method, we study the following topologies with extra links: one-dimensional unidirectional and bidirectional torus (i.e., ring), and two-dimensional bidirectional and unidirectional torus (e.g., bidirectional Manhattan network and Manhattan street network). We also show how these results can be extended to some non-torus topologies with extra links, such as the bus and the two-dimensional grid. From our analysis we find that the expected number of hops in a D-dimensional N-node torus with extra links grows as O(/sup D+1//spl radic/N) and that it can be reduced to O(/sup 2D//spl radic/N) with the orthogonal assignment of extra links.
Milan Kovacevic
INFOCOM1
1996 Benefits of Wavelength Translation in All-Optical Clear-Channel Networks
abstract
In this paper, we study the benefits of wavelength translation in all-optical networks providing clear channel circuit-switching among users. We first establish approximate analytical models for a static-routing circuit-switched network with an arbitrary topology, both with and without wavelength translation. We then study the performance of the nonblocking centralized switch, the mesh-torus network and the ring network, using the analytical models and simulation results. It is shown that the analytical models match the simulation results very well in the case of the centralized switch and the mesh network. The results of our study also show that the benefits of wavelength translation are modest for the centralized switch and the ring network. On the other hand, the results show that wavelength translation can significantly improve the performance of a large mesh-torus network.
Milan Kovacevic, Anthony S. Acampora
IEEE J. Sel. Areas Commun.1
1995 On Wavelength Translation in All-Optical Networks
Milan Kovacevic, Anthony S. Acampora
INFOCOM1
1995 Performance of Shared-Channel Multihop Lightwave Networks
Milan Kovacevic, Mario Gerla, Joseph A. Bannister
Comput. Commun.1
1995 A new optical signal routing scheme for linear lightwave networks
abstract
We propose a new scheme for optical signal routing within linear lightwave network (LLN) subnets. The LLN is a fiber optic network which performs only linear operations on optical signals: power combining, splitting and possibly linear optical amplification. The LLN can be partitioned into several subnets where each subnet is a tree providing full broadcast among all stations connected to it. We study the synchronization problem that exists in these subnets which prevents efficient implementation of time division multiple access schemes for sharing a common broadcast medium. A solution to this problem is proposed, based on a new optical signal routing scheme, called rooted routing. The impact of rooted routing on power losses is analyzed, and an approach for minimizing power loss in LLNs with rooted routing is presented. It is shown that when link and excess losses are small, rooted routing power budget can be made close to the power budget yielded by the original, shortest path routing scheme. It is also shown that rooted routing power budget can be significantly improved using a single optical amplifier.
Milan Kovacevic, Mario Gerla
IEEE Trans. Commun.1
1994 On the Performance of Shared-Channel Multihop Lightwave Networks
abstract
The authors study the effect of channel sharing on the performance of multihop lightwave networks when channel sharing is achieved by using a time-division multiple-access (TDMA) technique. They present a result which gives an upper bound for the throughput that can be achieved with any virtual topology that can be established with N stations assuming that the traffic distribution is uniform and that all virtual links have the same capacity. Using this result they determine the optimal degree of channel sharing that maximizes throughput. They also determine the optimal degree of channel sharing when the criterion is to maximize the network power, which is defined as a ratio of throughput and delay.>
Milan Kovacevic, Mario Gerla, Joseph A. Bannister
INFOCOM1
1994 Optical Tree Topologies: Access Control and Wavelength Assignment
Mario Gerla, Milan Kovacevic, Joseph A. Bannister
Comput. Networks ISDN Syst.2
1993 An All-Optical Multifiber Tree Network
abstract
Given that many optical fibers can be economically packaged within a single cable, the design of communication networks that exploit multifiber topologies is considered. A network architecture that uses the multifiber tree topology to provide high-speed datagram and circuit-switching communication services to a large population of stations is presented. Using a combination of space-, wavelength-, and time-division multiplexing, this network architecture provides all-optical transmission media to its stations and can interconnect several thousand stations in a metropolitan region without the need for optical amplification or electrooptical signal regeneration.>
Joseph A. Bannister, Mario Gerla, Milan Kovacevic
INFOCOM3
1992 Rooted Routing in Linear Lightwave Networks
abstract
The authors propose a new scheme for optical signal routing within linear lightwave network (LLN) subnets. They study the synchronization problem that exists in these subnets which prevents efficient implementation of time division multiple access schemes for sharing a common broadcast medium. A solution for this problem is proposed, based on a new optical agent signal routing scheme, called rooted routing. The impact of the rooted routing on power losses is analyzed, and an approach for optimizing the power losses in LLNs with rooted routing is presented. It is shown that when the link and excess losses are small, the optimal power budget is close to that when the original, shortest path routing scheme is used. It is also shown that the power budget in LLNs with rooted routing can be significantly improved using a single optical amplifier.>
Milan Kovacevic, Mario Gerla
INFOCOM1