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

Andreas Antonopoulos

dblp:09/5834 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 2001
—ORCID · none

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

Computer networks · 4 · 3 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
Routing and switching · 67% Optical networks · 33%

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

TopicWeightPapersLastEvidence papers
Routing and switching › traffic engineering
network cost optimization
0.012001
Analysis Of Optimisation Issues In Multi-Period DWDM Network Planning · INFOCOM 2001
Routing and switching › traffic engineering
routing optimization
0.012001
Analysis Of Optimisation Issues In Multi-Period DWDM Network Planning · INFOCOM 2001

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

present value analysis · 0.0
YearPublicationVenuePosition
2001 Analysis Of Optimisation Issues In Multi-Period DWDM Network Planning
abstract
Techniques for the planning of multi-service telecommunications networks over a multi-period scenario are proposed, based on routing optimisation to reduce network cost by removing DWDM transmission systems. A model of a medium-size national network is optimised using the various techniques, and the results presented in terms of the total number of DWDM systems required and the amount of wavelength-hops (giving an indication toward the number of optical transponders required). Traffic is taken as a mix between unprotected and 1+1 SNCP optical path protected demands. Traffic growth is applied over the 5 year planning horizon to give a tenfold increase in total traffic volume for the final year. A greenfield situation is assumed, yet since deployment occurs over several years, a present value calculation is used to estimate total cost, assuming that transponders and systems are only installed when they are due to be 'lit'.
Neil Geary, Andreas Antonopoulos, Elias Drakopoulos, John O'Reilly
INFOCOM2
1998 An algorithmic approach for the planning of partial access ETSI SDH SNCP-ring subnetworks
abstract
With the development of rings employing subnetwork connection protection (SNCP-rings) numerous complex solutions can be realised in the design of survivable synchronous digital hierarchy (SDH) networks. Three algorithms for optimising the planning of equipment cost-effective SDH networks using SNCP-ring solutions have been implemented. Results indicating the efficiency of the algorithms and the factors affecting this efficiency, supported by simulation work, are presented and discussed.
Andreas Antonopoulos, J. J. O'Reilly, Peter Lane
ISCC1
1997 Design Methodology for ETSI SDH Subnetworks Employing SNCP-Rings
abstract
The increased demand for distribution of telecommunication services over survivable network architectures led to the identification of resilient ring architectures as a very desirable network option. With the recent development of rings employing subnetwork connection protection (SNCP-rings) numerous complex solutions can be achieved in the design of survivable SDH subnetworks. In this paper, the methodology for the strategic planning of survivable SDH SNCP-ring subnetworks is presented and analysed. The various subnetwork solutions are classified. The trade-offs of the different solution types for subnetwork planning are introduced and the factors affecting them are discussed. Three algorithms for optimising the planning of equipment cost-effective SDH subnetworks using SNCP-ring solutions have been implemented. Results, indicating the efficiency of the algorithms and the factors affecting it, supported by simulation work, are presented and discussed.
Andreas Antonopoulos, J. J. O'Reilly, Peter Lane
ICC (2)1
1997 A framework for the availability assessment of SDH transport networks
abstract
Fibre optic transport systems are being installed at a rapid pace in national networks to meet the large demands for capacity. However, the consequences of service disruption are becoming more severe essentially due to the advent of these high capacity fibre optic systems. In an increasingly competitive world, network reliability is becoming the key characteristic which differentiates between competitive network solutions. A challenging task for service providers is to ensure service continuity at affordable costs. We present a novel framework to assess the network availability and we examine its applicability in a model network.
Andreas Antonopoulos, J. J. O'Reilly, Peter Lane
ISCC1