Autor: Voss, M. - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Determining hop-constrained spanning trees with repetitive heuristics
Autorzy:: Fernandes, M.
Gouveia, L.
Voß, S.
Powiązania:: https://bibliotekanauki.pl/articles/308588.pdf
Data publikacji:: 2007
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: hop-constrained spanning tree problem
metaheuristics
pilot method
rollout method
Opis:: The hop-constrained minimum spanning tree problem is the problem of determining a rooted spanning tree of minimum cost in which each path from the root node to any other node contains at most H hops or edges. This problem relates to the design of centralized tree networks with quality of service requirements (in telecommunications) and has a close relation with other tree problems. In this paper we investigate the adaptation of some well-known "repetitive" heuristics used for the capacitated minimum spanning tree problem to the hop-constrained minimum spanning tree problem and investigate some simple look ahead mechanisms for enhancing the quality of a savings heuristic. Computational results for a set of benchmark tests with up to 80 nodes are presented.
Źródło:: Journal of Telecommunications and Information Technology; 2007, 4; 16-22
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: Developing a Ring-Based Optical Network Structure with Glass-Through Nodes
Autorzy:: Caserta, M.
Schwarze, S.
Voß, S.
Powiązania:: https://bibliotekanauki.pl/articles/309201.pdf
Data publikacji:: 2012
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: active nodes
interring traffic
optical transport network
ring network design
Opis:: An important issue in designing optical transport networks (OTN) is security. The concept of 1+1 protection requires to connect each origin-destination(OD)-pair by at least two node-disjoint paths. In the case of a single edge or node failure, the connection of all OD-pairs is maintained under 1+1 protection. On a ring, 1+1 protection is given naturally. Moreover, on rings, the routing effort is typically decreasing. These observations motivate the investigation of ring structures for OTN. When developing a ring structure for telecommunication networks, several subtasks can be identified. Ringshave to be designed, OD-pairs have to be assigned to rings, communication among rings has to be defined, a proper flow routing has to be chosen, and rings have to be dimensioned regarding flow capacity. In this paper, we address the first two issues, namely generation of rings and assignment of OD-pairs to rings. Our approach allows to distinguish active and non-active (glass-through) nodes in OTN. Active nodes are equipped with active routing hardware that weakens the optical signal and has impact on feasible ring lengths. Non-active nodes do not influence the optical signal. Although a consideration of active/non-active nodes is important in ring design, only a few references address this issue. We propose an algorithm for generating random ring candidates. Moreover, we present a mathematical model for the assignment of OD-pairs to rings subject to a feasible choice of active nodes. We test our methods using a case of Deutsche Telekom.
Źródło:: Journal of Telecommunications and Information Technology; 2012, 2; 13-20
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 3.

Tytuł:: Extensions of the minimum labelling spanning tree problem
Autorzy:: Cerulli, R.
Fink, A.
Gentili, M.
Voss, S.
Powiązania:: https://bibliotekanauki.pl/articles/308930.pdf
Data publikacji:: 2006
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: network design
metaheuristics
spanning trees
labelling trees
Steiner tree problem
Opis:: In this paper we propose some extensions of the minimum labelling spanning tree problem. The main focus is on the minimum labelling Steiner tree problem: given a graph G with a color (label) assigned to each edge, and a subset Q of the nodes of G (basic vertices), we look for a connected subgraph of G with the minimum number of different colors covering all the basic vertices. The problem has several applications in telecommunication networks, electric networks, multimodal transportation networks, among others, where one aims to ensure connectivity by means of homogeneous connections. Numerical results for several metaheuristics to solve the problem are presented.
Źródło:: Journal of Telecommunications and Information Technology; 2006, 4; 39-45
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 4.

Tytuł:: Requirements of 4G-Based Mobile Broadband on Future Transport Networks
Autorzy:: Fricke, M.
Heckwolf, A.
Herber, R.
Nitsch, R.
Schwarze, S.
Voß, S.
Powiązania:: https://bibliotekanauki.pl/articles/309203.pdf
Data publikacji:: 2012
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: backhauling
LTE advanced
mobile network de-sign
X2 interface
Opis:: Long term evolution technologies provide new standards in mobile communications regarding available bandwidth. It is expected that users of one radio cell will share more than 100 Mbit/s in future. To take advantage of the full feature set of next generation mobile networks, transport network design has to face new requirements, caused by the architectural changes of LTE technologies. Especially the newly defined X2 interface impacts on the transport network requirements. X2 enables direct communication between evolved base stations (eNBs) and thus, enforces local solutions. At the same time a tendency of locating network elements at fewer, central sites to reduce operational expenditure can be observed, in particular concerning the transport layer. This leads to the question of how the direct X2 connection of eNBs on the logical layer can be accommodated with a general centralization of transport networks. Our considerations show that for LTE, a centralized transport network is able to realize the local meshing between eNBs. However, for LTE Advanced, the standards currently discussed by the 3GPP initiative could lead to enhanced requirements on the X2 interface latency. Consequently, the implications for the network architecture have to be analyzed in more detail.
Źródło:: Journal of Telecommunications and Information Technology; 2012, 2; 21-28
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "Voss, M." wg kryterium: Autor

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język