Back
  1. Home
  2. Profile of Fabian Skivée (ULiège)
Profil

Skivée Fabian

See author's contact details
Main Referenced Co-authors
Leduc, Guy  (3)
Balon, Simon  (2)
Abrahamsson, Henrik (1)
Bessler, Sandford (1)
Cerav-Erbas, Selin (1)
Main Referenced Keywords
MPLS (2); Congestion control (1); Fairness (1); IP (1); network management (1);
Main Referenced Disciplines
Computer science (3)

Publications (total 3)

The most downloaded
742 downloads
Leduc, G., Abrahamsson, H., Balon, S., Bessler, S., D'Arienzo, M., Delcourt, O., Domingo-Pascual, J., Cerav-Erbas, S., Gojmerac, I., Masip, X., Pescape, A., Quoitin, B., Romano, S., Salvadori, E., Skivée, F., Tran, H. T., Uhlig, S., & Umit, H. (March 2006). An open source traffic engineering toolbox. Computer Communications, 29 (5), 593-610. doi:10.1016/j.comcom.2005.06.010 https://hdl.handle.net/2268/3404

The most cited

39 citations (Scopus®)

Leduc, G., Abrahamsson, H., Balon, S., Bessler, S., D'Arienzo, M., Delcourt, O., Domingo-Pascual, J., Cerav-Erbas, S., Gojmerac, I., Masip, X., Pescape, A., Quoitin, B., Romano, S., Salvadori, E., Skivée, F., Tran, H. T., Uhlig, S., & Umit, H. (March 2006). An open source traffic engineering toolbox. Computer Communications, 29 (5), 593-610. doi:10.1016/j.comcom.2005.06.010 https://hdl.handle.net/2268/3404

Balon, S., Skivée, F., & Leduc, G. (May 2006). How well do traffic engineering objective functions meet TE requirements? Lecture Notes in Computer Science, 3976, 75-86. doi:10.1007/11753810_7
Peer reviewed

Leduc, G., Abrahamsson, H., Balon, S., Bessler, S., D'Arienzo, M., Delcourt, O., Domingo-Pascual, J., Cerav-Erbas, S., Gojmerac, I., Masip, X., Pescape, A., Quoitin, B., Romano, S., Salvadori, E., Skivée, F., Tran, H. T., Uhlig, S., & Umit, H. (March 2006). An open source traffic engineering toolbox. Computer Communications, 29 (5), 593-610. doi:10.1016/j.comcom.2005.06.010
Peer Reviewed verified by ORBi

Skivée, F., & Leduc, G. (August 2004). A distributed algorithm for weighted max-min fairness in MPLS networks. Lecture Notes in Computer Science, 3124, 644-653. doi:10.1007/978-3-540-27824-5_87
Peer reviewed

Contact ORBi