37 research outputs found

    D13.2 Techniques and performance analysis on energy- and bandwidth-efficient communications and networking

    Get PDF
    Deliverable D13.2 del projecte europeu NEWCOM#The report presents the status of the research work of the various Joint Research Activities (JRA) in WP1.3 and the results that were developed up to the second year of the project. For each activity there is a description, an illustration of the adherence to and relevance with the identified fundamental open issues, a short presentation of the main results, and a roadmap for the future joint research. In the Annex, for each JRA, the main technical details on specific scientific activities are described in detail.Peer ReviewedPostprint (published version

    D13.3 Overall assessment of selected techniques on energy- and bandwidth-efficient communications

    Get PDF
    Deliverable D13.3 del projecte europeu NEWCOM#The report presents the outcome of the Joint Research Activities (JRA) of WP1.3 in the last year of the Newcom# project. The activities focus on the investigation of bandwidth and energy efficient techniques for current and emerging wireless systems. The JRAs are categorized in three Tasks: (i) the first deals with techniques for power efficiency and minimization at the transceiver and network level; (ii) the second deals with the handling of interference by appropriate low interference transmission techniques; (iii) the third is concentrated on Radio Resource Management (RRM) and Interference Management (IM) in selected scenarios, including HetNets and multi-tier networks.Peer ReviewedPostprint (published version

    D13.1 Fundamental issues on energy- and bandwidth-efficient communications and networking

    Get PDF
    Deliverable D13.1 del projecte europeu NEWCOM#The report presents the current status in the research area of energy- and bandwidth-efficient communications and networking and highlights the fundamental issues still open for further investigation. Furthermore, the report presents the Joint Research Activities (JRAs) which will be performed within WP1.3. For each activity there is the description, the identification of the adherence with the identified fundamental open issues, a presentation of the initial results, and a roadmap for the planned joint research work in each topic.Preprin

    An efficient virtual topology design and traffic engineering scheme for ip wdm networks

    No full text
    Date of Conference: 29-31 May 2007 Conference Name: 11th International IFIP TC6 Conference, ONDM 2007 We propose an online traffic engineering (TE) scheme for efficient routing of bandwidth guaranteed connections on a Multiprotocol label switching (MPLS)/wavelength division multiplexing (WDM) network with a traffic pattern varying with the time of day. We first consider the problem of designing the WDM virtual topology utilizing multi-hour statistical traffic pattern. After presenting an effective solution to this offline problem, we introduce a Dynamic tRaffic Engineering AlgorithM (DREAM) that makes use of the bandwidth update and rerouting of the label switched paths (LSPs). The performance of DREAM is compared with commonly used online TE schemes and it is shown to be superior in terms of blocked traffic ratio. Document type: Part of book or chapter of boo

    Robust path design algorithms for traffic engineering with restoration in MPLS networks

    No full text
    In this paper we study traffic engineering in Multiprotocol Label Switching (MPLS) networks. We consider off-line computation of disjoint working and restoration paths where path rerouting is used as the restoration scheme. We first compute maximum number of paths for each demand such that paths satisfy diversity requirements. Using the generated path set we study four different approaches for selecting working and restoration paths, and formulate each method as an Integer Linear Programming (ILP) problem. The first two methods treat working and restoration path design problems separately. We propose two new path design methods that jointly optimize the working and restoration paths. A traffic uncertainty model is developed in order to evaluate performances of these four approaches based on their robustness with respect to changing traffic patterns. We compare these design approaches based on the number of additional demands carried and the distribution of residual capacity over the network. It is shown through simulations that the weighted load balancing method proposed in this paper outperforms the other three methods in handling traffic demand uncertainty

    <title>Traffic engineering and regenerator placement in GMPLS networks with restoration</title>

    No full text
    In this paper we study regenerator placement and traffic engineering of restorable paths in Generalized Multipro-tocol Label Switching (GMPLS) networks. Regenerators are necessary in optical networks due to transmission impairments. We study a network architecture where there are regenerators at selected nodes and we propose two heuristic algorithms for the regenerator placement problem. Performances of these algorithms in terms of required number of regenerators and computational complexity are evaluated. In this network architecture with sparse regeneration, offline computation of working and restoration paths is studied with bandwidth reservation and path rerouting as the restoration scheme. We study two approaches for selecting working and restoration paths from a set of candidate paths and formulate each method as an Integer Linear Programming (ILP) prob-lem. Traffic uncertainty model is developed in order to compare these methods based on their robustness with respect to changing traffic patterns. Traffic engineering methods are compared based on number of additional demands due to traffic uncertainty that can be carried. Regenerator placement algorithms are also evaluated from a traffic engineering point of view.© (2002) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only
    corecore