The Experts below are selected from a list of 39 Experts worldwide ranked by ideXlab platform
Gaurav Raina - One of the best experts on this subject based on the ideXlab platform.
-
Building power shortest inter-Area TE LSPs using pre-computed paths
2013Co-Authors: Gaurav Raina, Shankar Raman, Balaji VenkataswamiAbstract:In this paper, we propose a framework to reduce the aggregate power consumption of an Autonomous System (AS) using a collaborative approach between Areas within an AS. We identify the low-power paths within non-Backbone Areas and then use Traffic Engineering (TE) techniques to route the packets along the stitched paths from non- Backbone Areas / Backbone Area to other non-Backbone Areas. Such low- power paths can be identified by using the power-to-available- bandwidth (PWR) ratio as an additional constraint in the Constrained Shortest Path First (CSPF) algorithm. For routing the data traffic through these low-power paths, the Inter-Area Traffic Engineered Label Switched Path (TE-LSP) that spans multiple Areas can be used. Extensions to the Interior Gateway Protocols like OSPF and IS-IS that support TE extensions can be used to disseminate information about low-power paths in the respective Areas (Backbone or non-Backbone) that minimize the PWR ratio metric on the links within the Areas and between the Areas thereby creating a collaborative approach to reduce the power consumption. The feasibility of our approaches is illustrated by applying our algorithm to an AS with a Backbone Area and several non-Backbone Areas. The techniques proposed in this paper for the Inter-Area power reduced paths require a few modifications to the existing features of the IGPs supporting TE extensions. The proposed techniques can be extended to other levels of Internet hierarchy, such as Inter-AS paths, through suitable modifications as in [11]. When link state routing protocols like OSPF or ISIS are used to discover TE topology, there is the limitation that traffic engineered paths can be set up only when the head and tail end of the label switched path are in the same Area. There are solutions to overcome this limitation either using offline Path Computation Engine (PCE) that attach to multiple Areas and know the topology of all Areas. This document proposes an alternative approach that does not req ...
-
Power Based Topologies and TE-Shortest Power Paths in OSPF
2013Co-Authors: Gaurav Raina, Shankar Raman, Balaji Venkat Venkataswami, Vasan SriniAbstract:In a Interior Gateway Protocol like OSPF (Open Shortest Path First) the computation of the Constrained shortest path to destinations is computed for an Area say a Backbone or a non-Backbone Area using the TE-metrics advertised in the Area. With importance given to the reduction of power within a network it becomes important to provide a solution that reduces the power consumed amongst routers and links that make up the network (in this case an Area or a collection of Areas including the Backbone and non-Backbone Areas). This proposal aims at providing such a solution by producing a power topology of the Area / Areas. This power topology is constructed by assigning metrics to links based on the power consumed by the linecards (and hence their respective ports in an indirect way) of adjacent routers that are interconnected by each such link.
Gregor Von Bochmann - One of the best experts on this subject based on the ideXlab platform.
-
A Novel Framework for Inter-Area MPLS Optimal Routing
2006Co-Authors: Gregor Von BochmannAbstract:We propose a novel framework for inter-Area MPLS optimal routing. The key to our proposal lies in deploying an overlaid star optical network in the OSPF Backbone Area and introducing the concept of "virtual Area border routers" (v-ABRs). Compared with other proposals, our framework can provide globally optimized inter-Area routing and has very good compatibility to existing traditional IP/MPLS routers.
-
Wireless and Optical Communications - Routing of MPLS Flows over an Agile All-Photonic Star Network.
2006Co-Authors: Gregor Von BochmannAbstract:In this paper, we study how MPLS flows are routed in an Internet that contains a centrally-controlled agile allphotonic star WDM network (AAPN). Two scenarios are considered, namely deploying AAPN within one OSPF (Open Shortest Path First) Area and within several OSPF Areas. Since the AAPN provides an NxN interconnection structure for the N edge nodes of the AAPN architecture, the straightforward usage of a routing protocol like OSPF leads to scalability problems. In the first scenario, we have identified several schemes by which this scalability problem can be reduced. The idea is to introduce "virtual routers" that represent a collection of edge nodes (and possibly also the core node), thus reducing the number of paths between the "routers". In the second scenario, we focus on inter-Area routing in large-scale IP/MPLS networks. This paper proposes a novel framework for inter-Area MPLS Traffic Engineering. The key to our proposal lies in deploying the AAPN architecture as the OSPF Backbone Area and introducing the concept of “virtual Area border routers” (v-ABRs). Compared with other proposals, our proposal can provide globallyoptimized inter-Area routing and has very good compatibility to existing traditional IP/MPLS routers.
Shankar Raman - One of the best experts on this subject based on the ideXlab platform.
-
Building power shortest inter-Area TE LSPs using pre-computed paths
2013Co-Authors: Gaurav Raina, Shankar Raman, Balaji VenkataswamiAbstract:In this paper, we propose a framework to reduce the aggregate power consumption of an Autonomous System (AS) using a collaborative approach between Areas within an AS. We identify the low-power paths within non-Backbone Areas and then use Traffic Engineering (TE) techniques to route the packets along the stitched paths from non- Backbone Areas / Backbone Area to other non-Backbone Areas. Such low- power paths can be identified by using the power-to-available- bandwidth (PWR) ratio as an additional constraint in the Constrained Shortest Path First (CSPF) algorithm. For routing the data traffic through these low-power paths, the Inter-Area Traffic Engineered Label Switched Path (TE-LSP) that spans multiple Areas can be used. Extensions to the Interior Gateway Protocols like OSPF and IS-IS that support TE extensions can be used to disseminate information about low-power paths in the respective Areas (Backbone or non-Backbone) that minimize the PWR ratio metric on the links within the Areas and between the Areas thereby creating a collaborative approach to reduce the power consumption. The feasibility of our approaches is illustrated by applying our algorithm to an AS with a Backbone Area and several non-Backbone Areas. The techniques proposed in this paper for the Inter-Area power reduced paths require a few modifications to the existing features of the IGPs supporting TE extensions. The proposed techniques can be extended to other levels of Internet hierarchy, such as Inter-AS paths, through suitable modifications as in [11]. When link state routing protocols like OSPF or ISIS are used to discover TE topology, there is the limitation that traffic engineered paths can be set up only when the head and tail end of the label switched path are in the same Area. There are solutions to overcome this limitation either using offline Path Computation Engine (PCE) that attach to multiple Areas and know the topology of all Areas. This document proposes an alternative approach that does not req ...
-
Power Based Topologies and TE-Shortest Power Paths in OSPF
2013Co-Authors: Gaurav Raina, Shankar Raman, Balaji Venkat Venkataswami, Vasan SriniAbstract:In a Interior Gateway Protocol like OSPF (Open Shortest Path First) the computation of the Constrained shortest path to destinations is computed for an Area say a Backbone or a non-Backbone Area using the TE-metrics advertised in the Area. With importance given to the reduction of power within a network it becomes important to provide a solution that reduces the power consumed amongst routers and links that make up the network (in this case an Area or a collection of Areas including the Backbone and non-Backbone Areas). This proposal aims at providing such a solution by producing a power topology of the Area / Areas. This power topology is constructed by assigning metrics to links based on the power consumed by the linecards (and hence their respective ports in an indirect way) of adjacent routers that are interconnected by each such link.
Balaji Venkataswami - One of the best experts on this subject based on the ideXlab platform.
-
Building power shortest inter-Area TE LSPs using pre-computed paths
2013Co-Authors: Gaurav Raina, Shankar Raman, Balaji VenkataswamiAbstract:In this paper, we propose a framework to reduce the aggregate power consumption of an Autonomous System (AS) using a collaborative approach between Areas within an AS. We identify the low-power paths within non-Backbone Areas and then use Traffic Engineering (TE) techniques to route the packets along the stitched paths from non- Backbone Areas / Backbone Area to other non-Backbone Areas. Such low- power paths can be identified by using the power-to-available- bandwidth (PWR) ratio as an additional constraint in the Constrained Shortest Path First (CSPF) algorithm. For routing the data traffic through these low-power paths, the Inter-Area Traffic Engineered Label Switched Path (TE-LSP) that spans multiple Areas can be used. Extensions to the Interior Gateway Protocols like OSPF and IS-IS that support TE extensions can be used to disseminate information about low-power paths in the respective Areas (Backbone or non-Backbone) that minimize the PWR ratio metric on the links within the Areas and between the Areas thereby creating a collaborative approach to reduce the power consumption. The feasibility of our approaches is illustrated by applying our algorithm to an AS with a Backbone Area and several non-Backbone Areas. The techniques proposed in this paper for the Inter-Area power reduced paths require a few modifications to the existing features of the IGPs supporting TE extensions. The proposed techniques can be extended to other levels of Internet hierarchy, such as Inter-AS paths, through suitable modifications as in [11]. When link state routing protocols like OSPF or ISIS are used to discover TE topology, there is the limitation that traffic engineered paths can be set up only when the head and tail end of the label switched path are in the same Area. There are solutions to overcome this limitation either using offline Path Computation Engine (PCE) that attach to multiple Areas and know the topology of all Areas. This document proposes an alternative approach that does not req ...
Shanqing Zhang - One of the best experts on this subject based on the ideXlab platform.
-
Detection of Bird’s Nest in High Power Lines in the Vicinity of Remote Campus Based on Combination Features and Cascade Classifier
IEEE Access, 2018Co-Authors: Chin-chen Chang, Xiaoqing Feng, Shanqing ZhangAbstract:High-voltage transmission towers are built to supply electricity for campuses and local residents. In order to guarantee the power supply and safety for remote campus, the unmanned aerial vehicles (UAVs) are used to take the images of high power lines to alarm potential malfunction. A novel method of bird’s nest images detection based on cascade classifier and combination features is proposed. Different features of the bird’s nest and iron tower are analyzed, and the following four novel features are proposed: proportion of white Area (PWA), ratio of white pixels (RWP) in each lap, projection feature (PF), and improved burr feature (IBF). The combined features are used to describe the characteristics of the bird’s nest Backbone Area and the edges, respectively. Furthermore, the cascade classifier combined with the four proposed features is used for the further classification of bird’s nest region. The proposed detection process mainly consists of three stages. First, the suspected bird’s nest region is obtained by template convolution. Second, PWA and RWP with low dimensionality and high discrimination are used to classify the sample set of suspected nest region. Third, based on the previous classification results with positive and negative samples, PF and IBF are adopted to further conduct the secondary classification in order to reduce the misclassified samples, and the final classification label is determined by the second classification results. Experimental results show that the proposed algorithm can accurately detect the nest and achieve good performance.