TY  - CHAP
AU  - Cinkler, Tibor
AU  - Coudert, David
AU  - Flammini, Michele
AU  - Monaco, Gianpiero
AU  - Moscardelli, Luca
AU  - Munoz, Xavier
AU  - Sau, Ignasi
AU  - Shalom, Mordechai
AU  - Zaks, Shmuel
ED  - Koster, Arie M C A
ED  - Munoz, Xavier
TI  - Traffic Grooming. Combinatorial results and practical resolutions
TS  - Combinatorial results and practical resolutions
T2  - Graphs and algorithms in communication networks
PB  - Springer Netherlands
CY  - Heidelberg
SN  - 9783642022494
T3  - Text in Theoretical computer science
PB  - Springer Netherlands
PY  - 2010
SP  - 63
EP  - 94
PG  - 32
DO  - 10.1007/978-3-642-02250-0_2
UR  - https://m2.mtmt.hu/api/publication/23945813
ID  - 23945813
LA  - English
DB  - MTMT
ER  - 

TY  - JOUR
AU  - Cinkler, Tibor
AU  - Hegyi, Péter
TI  - Automated adaptive on-line Multi-Layer Traffic Engineering through "tailoring"' wavelength-paths in the Fragment Graph
JF  - OPTICAL SWITCHING AND NETWORKING
J2  - OPT SWITCH NETW
VL  - 6
PY  - 2009
IS  - 3
SP  - 194
EP  - 214
PG  - 21
SN  - 1573-4277
DO  - 10.1016/j.osn.2009.05.002
UR  - https://m2.mtmt.hu/api/publication/2645157
ID  - 2645157
N1  - Export Date: 9 January 2024            
            Correspondence Address: Hegyi, P.; High Speed Networks Laboratory, Magyar tudosok korutja 2, H-1117 Budapest, Hungary; email: hegyi@tmit.bme.hu
AB  - In Multi-Layer networks, where more than one layer is switched, i.e., connections are set
up using not only the upper, e.g., IP layer but the underlying wavelength layer as well leads
often to suboptimal performance due to long wavelength paths, that do not allow routing
the traffic along the shortest path. The role of MLTE (Multi-Layer Traffic Engineering) is
to cut (fragment) these long wavelength-paths into parts (fragments) that allow better
routing at the upper layer, or to concatenate (defragment) two or more fragments into
longer paths when the network load is low and therefore
^
fewer hops are preferred.
In this paperwepresent a new model, the Fragment Graph (FG) and an algorithm for this
model that supports Fragmentation and De-Fragmentation of wavelength paths making the
network always instantly adapt to changing traffic conditions. We introduce the notion of
shadow links to model ``#?#-path tailoring''. We implicitly assume that the wavelength paths
carry such, e.g., IP traffic that can be interrupted for a few milliseconds and that even allows
minor packet reordering.
To show the superior performance of our approach in various network and traffic
conditions we have carried out an intensive simulation study where we compare blocking
ratios and path lengths and we analyze the dynamic behavior and fairness of the proposed
and of reference methods.
LA  - English
DB  - MTMT
ER  - 

TY  - CHAP
AU  - Cinkler, Tibor
AU  - Hegyi, Péter
AU  - Geleji, Géza
AU  - Szigeti, János
AU  - Ladányi, Ákos
ED  - IEEE, Communication Society
TI  - Adaptive Multi-Layer Traffic Engineering with Shared Risk Group Protection
T2  - 2008 IEEE International Conference on Communications, Vols 1-13
PB  - IEEE
CY  - Piscataway (NJ)
SN  - 9781424420759
T3  - IEEE International Conference on Communications, ISSN 1550-3607
PY  - 2008
SP  - 5367
EP  - 5371
PG  - 5
DO  - 10.1109/ICC.2008.1006
UR  - https://m2.mtmt.hu/api/publication/2618027
ID  - 2618027
N1  - Export Date: 9 January 2024            
            Correspondence Address: Cinkler, T.; High-Speed Networks Laboratory, , Budapest, Hungary; email: cinkler@tmit.bme.hu
LA  - English
DB  - MTMT
ER  - 

TY  - CHAP
AU  - Cinkler, Tibor
AU  - Hegyi, Péter
AU  - Geleji, Géza
AU  - Szigeti, János
ED  - IEEE, null
TI  - Protection for Adaptive Multi-Layer Traffic Engineering
T2  - DRCN 2007, 6th International Workshop on the Design of Reliable Communication Networks
PB  - IEEE Press
CY  - New York, New York
SN  - 1424438241
PY  - 2007
SP  - 266
EP  - 272
PG  - 7
DO  - 10.1109/DRCN.2007.4762288
UR  - https://m2.mtmt.hu/api/publication/2605497
ID  - 2605497
LA  - English
DB  - MTMT
ER  - 

TY  - JOUR
AU  - Szigeti, János
AU  - Cinkler, Tibor
TI  - Rule-based advertisement and maintenance of network state information in optical-beared heterogeneous networks
JF  - LECTURE NOTES IN COMPUTER SCIENCE
J2  - LNCS
VL  - 4534
PY  - 2007
SP  - 279
EP  - 288
PG  - 10
SN  - 0302-9743
DO  - 10.1007/978-3-540-72731-6_31
UR  - https://m2.mtmt.hu/api/publication/2627458
ID  - 2627458
N1  - WoS:hiba:000247270800031 2020-08-27 04:37 típus nem egyezik
AB  - A more flexible routing of better performance can be achieved in
multilayer networks when the controllers of different network layers are "peering" instead of "overlaying", i.e., instead of the simple overlay model the peer interconnection or the vertically integrated model is used, and Label Switched Paths are searched in a Wavelength Graph that represents the network state very accurately. However, routing in "Peer network" does not only require large databases for storing the Wavelength Graph and complex path-search algorithms, it also increases the load of control channels, as more link state changes must be advertised. Much of the link state information is, however,
redundant as the state changes are not independent. In this paper we propose a method for topology information advertisement and maintenance to significantly reduce the amount of control messages without deteriorating the quality of routing.
LA  - English
DB  - MTMT
ER  - 

TY  - JOUR
AU  - Cinkler, Tibor
AU  - Hegyi, Péter
AU  - Asztalos, Márk
AU  - Geleji, Géza
AU  - Kern, András
AU  - Szigeti, János
TI  - Multi-Layer Traffic Engineering through Adaptive Lambda-path Fragmentation and De-Fragmentation: The Grooming-Graph and Shadow-Capacities
JF  - LECTURE NOTES IN COMPUTER SCIENCE
J2  - LNCS
VL  - 3976
PY  - 2006
SP  - 715
EP  - 726
PG  - 12
SN  - 0302-9743
DO  - 10.1007/11753810_60
UR  - https://m2.mtmt.hu/api/publication/1789071
ID  - 1789071
N1  - WoS:hiba:000238114800060 2020-12-06 02:18 típus nem egyezik
LA  - English
DB  - MTMT
ER  - 

TY  - JOUR
AU  - Geleji, Géza
AU  - Asztalos, Márk
AU  - Cinkler, Tibor
AU  - Hegyi, Péter
TI  - A hullámhossz-utak adaptív fragmentálása forgalomkötegeléses WDM optikai hálózatokban
JF  - HIRADÁSTECHNIKA (1962)
J2  - HIRADÁSTECHNIKA
VL  - 61
PY  - 2006
IS  - 2
SP  - 54
EP  - 59
PG  - 6
SN  - 0018-2028
UR  - https://m2.mtmt.hu/api/publication/1789078
ID  - 1789078
LA  - Hungarian
DB  - MTMT
ER  - 

TY  - CHAP
AU  - Perényi, Marcell Ádám
AU  - Hegyi, Péter
AU  - Szigeti, János
AU  - Cinkler, Tibor
AU  - Sallai, Gyula
TI  - Joint Grooming Capability and Wavelength Number Optimization with Protection
T2  - WTC 2006
SN  - 3800736020
PY  - 2006
SP  - 1
EP  - 8
PG  - 8
UR  - https://m2.mtmt.hu/api/publication/2605501
ID  - 2605501
LA  - English
DB  - MTMT
ER  - 

TY  - CHAP
AU  - Perényi, Marcell Ádám
AU  - Ladányi, Ákos
AU  - Cinkler, Tibor
ED  - Marciniak, M.
TI  - Joint Grooming Capability and Wavelength Number Optimization
T2  - 2005 7th International Conference on Transparent Optical Networks, Vol 1, Proceedings
PB  - IEEE Press
CY  - New York, New York
SN  - 0780392361
PY  - 2005
SP  - 77
EP  - 84
PG  - 8
DO  - 10.1109/ICTON.2005.1505757
UR  - https://m2.mtmt.hu/api/publication/2612974
ID  - 2612974
LA  - English
DB  - MTMT
ER  - 

TY  - CHAP
AU  - Szigeti, János
AU  - Ballók, István
AU  - Cinkler, Tibor
ED  - Marciniak, M.
TI  - Efficiency of Information Update Strategies for Automatically Switched Multi-domain Optical Networks
T2  - 2005 7th International Conference on Transparent Optical Networks, Vol 1, Proceedings
PB  - IEEE Press
CY  - New York, New York
SN  - 0780392361
PY  - 2005
SP  - 445
EP  - 454
PG  - 10
DO  - 10.1109/ICTON.2005.1505840
UR  - https://m2.mtmt.hu/api/publication/2619979
ID  - 2619979
N1  - Cited By :7            
            Export Date: 28 May 2020            
            Correspondence Address: Szigeti, J.; High-Speed Networks Laboratory, Department of Telecommunications and Media Informatics, Budapest University of Technology and Economics, Magyar tudósok krt. 2, H-1117 Budapest, Hungary; email: szigeti@tmit.bme.hu
AB  - The routing and wavelength assignment algorithm is a complex task in today's dynamically switched networks. As
the number of network nodes and links increases, advertising
link states requires more control messages, larger databases and more processing capacity while searching for an available path.
Information aggregation in multi-domain networks helps us
to reduce the number of advertised links. Furthermore, there
are numerous information update strategies that also result in
less link state control messages. However, these enhancements are done on the account of information inaccuracy, which leads to higher blocking ratio and longer setup delays.
In our article we present a Physical Device Abstraction Layer
for the Control Plane where interior optical switches having different multiplexing capabilities and exterior autonomous domains are treated in a unified way. Next we show and analyse solutions for how to apply information update strategies on multilayer networks and how to extend these strategies to fit into multidomain environment.
LA  - English
DB  - MTMT
ER  - 

TY  - GEN
AU  - Tibor, Cinkler
TI  - Routing, TE and Resilience in Heterogeneous GMPLS Networks. WGN5: V Workshop in G/MPLS networks
TS  - WGN5: V Workshop in G/MPLS networks
PY  - 2005
UR  - https://m2.mtmt.hu/api/publication/23931136
ID  - 23931136
LA  - English
DB  - MTMT
ER  -