Hernandez Sola, Guillem
Total activity: 8
Research group
GCO - Optical Communications Group
Department
Department of Signal Theory and Communications
E-mail
guillem.hernandezalu-etsetb.upc.edu
Contact details
UPC directory Open in new window

Graphic summary
  • Show / hide key
  • Information


Scientific and technological production
  •  

1 to 8 of 8 results
  • Network convergence and QoS for future multimedia services in the VISION project

     Pérez, Luís; Velasco Esteban, Luis; Rodríguez, Juan; Capelastegui, Pedro; Hernandez Sola, Guillem; Calavia, Lorena; Marqués, Antonio; Iribarne, Borja; Pozo, Amador; Poorter, Antoine De
    Computer networks
    Date of publication: 2012
    Journal article

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    The emerging use of real-time 3D-based multimedia applications imposes strict quality of service (QoS) requirements on both access and core networks. These requirements and their impact to provide end-to-end 3D videoconferencing services have been studied within the Spanish-funded VISION project, where different scenarios were implemented showing an agile stereoscopic video call that might be offered to the general public in the near future. In view of the requirements, we designed an integrated access and core converged network architecture which provides the requested QoS to end-to-end IP sessions. Novel functional blocks are proposed to control core optical networks, the functionality of the standard ones is redefined, and the signaling improved to better meet the requirements of future multimedia services. An experimental test-bed to assess the feasibility of the solution was also deployed. In such test-bed, set-up and release of end-to-end sessions meeting specific QoS requirements are shown and the impact of QoS degradation in terms of the user perceived quality degradation is quantified. In addition, scalability results show that the proposed signaling architecture is able to cope with large number of requests introducing almost negligible delay.

  • Enhanced Optical Networks Featuring Adaptable and Highly Scalable Multi-granular Transport Services (ELASTIC) - TEC2011-27310

     Spadaro, Salvatore; Junyent Giralt, Gabriel; Comellas Colome, Jaume; Gené Bernaus, Joan M.; Velasco Esteban, Luis; Perello Muntan, Jordi; Conesa Fernandez, Josep; Agraz Bujan, Fernando; Ruiz Ramírez, Marc; Hernandez Sola, Guillem; Pages Cruz, Albert; Khodashenas, Pooria Saiyad
    Participation in a competitive project

     Share

  • Enhanced optical networks featuring adaptable and highly scalable multi-granular transport services

     Ruiz Ramírez, Marc; Junyent Giralt, Gabriel; Comellas Colome, Jaume; Gené Bernaus, Joan M.; Conesa Fernandez, Josep; Velasco Esteban, Luis; Perello Muntan, Jordi; Agraz Bujan, Fernando; Hernandez Sola, Guillem; Pages Cruz, Albert; Khodashenas, Pooria Saiyad; Spadaro, Salvatore
    Participation in a competitive project

     Share

  • Enhanced domain disjoint backward recursive TE path computation for PCE-based multi-domain networks

     Hernandez Sola, Guillem; Perello Muntan, Jordi; Agraz Bujan, Fernando; Velasco Esteban, Luis; Spadaro, Salvatore; Junyent Giralt, Gabriel
    Photonic network communications
    Date of publication: 2011-04
    Journal article

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    The ability of computing optimal routes poses new challenges when extending it to larger multi-domain network scenarios, as the quality of these computed endto-end inter-domain routes depends on the selection of the domain sequence to be traversed. In the scope of the Internet Engineering Task Force (IETF), the Path Computation Element (PCE) Working Group has not provided definitive solutions to address the domain sequence selection problem, being still a work in progress. To this goal, the Path Computation Flooding (PCF) approach appears as a possible extension to Backward Recursive PCE-based Computation (BRPC) to calculate optimal end-to-end inter-domain paths without requiring a pre-configured domain sequence. Nonetheless, PCF presents major scalability issues in terms of network control overhead and path computation complexity, thus pleading for more accurate domain sequence selection techniques. This paper describes two novel mechanisms to establish inter-domain paths calculating the sequence of domains to be crossed when it is not known in advance. Both procedures make a good trade-off between the control overhead introduced and the accuracy of the computed end-to-end route. The obtained simulation results show the benefits of the proposed contributions, drastically reducing the control overhead while keeping the connection blocking probability close to the optimal values.

  • Scalable hybrid path computation procedure for PCE-based

     Hernandez Sola, Guillem; Perello Muntan, Jordi; Agraz Bujan, Fernando; Spadaro, Salvatore; Comellas Colome, Jaume; Junyent Giralt, Gabriel
    International Conference on Transparent Optical Networks
    Presentation's date: 2011-06-27
    Presentation of work at congresses

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Scalable hybrid path computation procedure for PCE-based multi-domain WSON networks

     Hernandez Sola, Guillem; Perello Muntan, Jordi; Agraz Bujan, Fernando; Spadaro, Salvatore; Comellas Colome, Jaume; Junyent Giralt, Gabriel
    International Conference on Transparent Optical Networks
    Presentation's date: 2011
    Presentation of work at congresses

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    In the Hierarchical Path Computation Element (H-PCE) architecture, an optimum end-to-end path is computed using a hierarchical relationship among PCEs. An H-PCE-based path computation procedure provides low network blocking probability meanwhile it results on a great amount of control overhead messages. In this paper we propose a hybrid path computation procedure based on the H-PCE architecture and the Backward Recursive PCE-Based Computation (BRPC). Extensive simulation results show that the proposed approach performs better than H-PCE in terms of network control overhead.

  • Scalable path computation flooding approach for PCE-based multi-domain networks

     Perello Muntan, Jordi; Hernandez Sola, Guillem; Agraz Bujan, Fernando; Spadaro, Salvatore; Comellas Colome, Jaume
    ETRI journal
    Date of publication: 2010-08
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Access to the full text
    Analysis of traffic engineering information dissemination strategies in PCE-based multi-domain optical networks  Open access

     Spadaro, Salvatore; Perello Muntan, Jordi; Hernandez Sola, Guillem; Moreno, A.; Agraz Bujan, Fernando; Comellas Colome, Jaume; Junyent Giralt, Gabriel
    International Conference on Transparent Optical Networks
    Presentation's date: 2010-06-28
    Presentation of work at congresses

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    This paper presents and compares different TE information dissemination strategies between Path Computation Elements (PCEs) in multi-domain optical networks. In such network context, recent studies have found that path computation only with local domain visibility yields poor network performance. Accordingly, certain visibility between domains seems necessary. Aiming to fit the confidentiality requirements of the composing domains while improving the final network blocking probability, novel link aggregation techniques have been proposed, which summarize the state of network domains resources efficiently. This aggregated link information is afterwards disseminated to all the remainder domains in the network. To this end, we introduce different update triggering policies to make a good trade-off between routing information scalability and inaccuracy. The performance of all contributions has been supported by illustrative simulation results.