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

Giovanni Colombo

dblp:45/8149 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2004
0000-0002-0675-0465ORCID · corroborated

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

Computer networks · 1 · 1 first-authorTheory of computation · 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
Routing and switching · 44% Network management and operations · 44% Vehicular, aerial and satellite networks · 13%

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

TopicWeightPapersLastEvidence papers
Network management and operations
network control
0.011990
Asynchronous control algorithms for increasing the efficiency of three-stage connecting networks for multipoint services · IEEE Trans. Commun. 1990
Routing and switching › switching networks
rearrangement algorithms
0.011990
Asynchronous control algorithms for increasing the efficiency of three-stage connecting networks for multipoint services · IEEE Trans. Commun. 1990
Vehicular, aerial and satellite networks
satellite systems
0.011990
Asynchronous control algorithms for increasing the efficiency of three-stage connecting networks for multipoint services · IEEE Trans. Commun. 1990

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

connecting network theory · 0.0computer simulation · 0.0
YearPublicationVenuePosition
2004 The subgradient formula for the minimal time function in the case of constant dynamics in Hilbert space
Giovanni Colombo, Peter R. Wolenski
J. Glob. Optim.1
1994 Network architecture and functionalities in UMTS
abstract
The paper analyzes some of the major network topics arising in the UMTS design process. This is done by invoking functional and architectural issues with relation to both the B-ISDN/IN context and the radio access features. The integration of UMTS with the "core" network is discussed by showing functional and network architecture as as well as protocol aspects. A comparison with the solutions adopted for the actual cellular systems, highlights the improving elements characterizing UMTS. Specific UMTS functional schemes are analyzed for call handling and location management procedures. Functional and design issues are also discussed for the radio access part of UMTS. The handover procedure, heavily affecting the architectural choices to be performed, for the UMTS base station is described, and its use in the design process is presented. Basic performance evaluation topics, tied to the achievement of "optimal" solutions for the functions allocation to the network entities are discussed. The paper is based on the work performed within the RACE Project 2066, named MONET.
Giovanni Colombo, Hans Hegeman
PIMRC1
1990 Asynchronous control algorithms for increasing the efficiency of three-stage connecting networks for multipoint services
abstract
A study is made of the problem of designing low complexity control algorithms for controlling three-stage connecting networks with the objective of improving system performance. The chosen approach is based on the theory of connecting networks and makes use of rearrangement algorithms. These algorithms are applicable to a number of environments, including multipoint connections, time plan modifications in satellite systems, and real-time routing. The main feature of the algorithms is an asynchronous mode of operation for modifying the system switching configurations. A theoretical framework has been developed for defining the conditions that must hold for the asynchronous rearrangements to work. A quantitative evaluation of these algorithms obtained with a computer simulation program is given.>
Giovanni Colombo, Carlo Scarati, Franco Settimo
IEEE Trans. Commun.1