Pro-active energy management for Wide Area Networks
11
Citation
7
Reference
10
Related Paper
Citation Trend
Abstract:
We present a methodology for achieving energy savings in excess of 30% in Wide Area Networks. The approach applies a limited set of pre-calculated network topology configurations derived via a Genetic Algorithm across the day. The GA determines the minimum set of resources required in order to support a given traffic demand. Information gleaned from SNMP trap messages, triggered by the use of a link utilization threshold, determine when to switch between configurations. The threshold employs moving average smoothing and is discretely readjusted over the course of a daily cycle based on anticipated basal load variations. By exploiting MT-OSPF this approach provides a scalable and flexible means of reconfiguring an infrastructure that avoids routing discontinuities, excessive computational effort and the exchange of considerable volumes of control information.With the development of IPv6, the research on Internet core technologies-routing technology based on IPv6 become more and more important. OSPF for IPv6, also referred to as OSPFv3, has been widely researched and implemented by many manufacturers in various devices such as routers and operation systems. In this paper we firstly introduce the knowledge of IPv6 and then analyze the mechanism of OSPF routing protocol. After research the improvements of OSPFv3, we use Dynamips simulator to model the main features of this complex protocol.
IPv4
Cite
Citations (7)
The aim is to analyze the behavior of interior gateway protocols using for routing protocol IPv4 and IPv6. Author introduces the principles of routing with protocol IP version 4 and IP version 6. He analyzes their support in the most known open and proprietary protocols for LAN networks. Specifically he focuses on protocols RIP, EIGRP and OSPF. The author suggests the way of analysis of the behavior of selected routing protocols and analyze them in the created test topologies which are implemented in the laboratory of computer networks.
Interior gateway protocol
Routing Information Protocol
IPv4
Distance-vector routing protocol
Cite
Citations (0)
We present two formal models for the OSPF routing protocol, designed for the model checker Uppaal. The first one is an optimised model of an existing model that allows to check larger network topologies. The second one is a specialised model for adjacency building, a complex subprocedure of OSPF, which is not part of any existing model and which is known to be vulnerable to cyber attacks. We illustrate how both models can be used to discover vulnerabilities in routing protocols.
Routing Information Protocol
Zone Routing Protocol
Cite
Citations (1)
This paper presents the theoretical and practical foundations of the migration of two routing protocols, they are RIP and OSPF. To increase and to improve the performance maximizing the resources inside a network of information exchanged. Mentioning the advantages and disadvantages that present the protocols selected for the process, using Cisco Ios
Routing Information Protocol
Distance-vector routing protocol
Interior gateway protocol
Cite
Citations (4)
Routing Protocols are underlying principles in networks like internet, transport and mobile. Routing Protocols include a series of rules and algorithms that consider routing metric and select the best way for sending healthy data packets from origin to destination. Dynamic routing protocol compatible to topology has a changeable state. RIP and OSPF are dynamic routing protocol that we consider criteria like convergence and sending protocols traffic assessment RIP first version and OSPF second version. By the test we have done on OPNET stimulation we understood that the OSPF protocol was more efficient than RIP protocol.
Routing Information Protocol
Interior gateway protocol
Zone Routing Protocol
Distance-vector routing protocol
Path vector protocol
Cite
Citations (2)
We study the stability of the OSPF protocol under steady state and perturbed conditions. We look at three indicators of stability, namely, (a) network convergence times, (b) routing load on processors, and (c) the number of route flaps. We study these statistics under three different scenarios: (a) on networks that deploy OSPF with TE extensions, (b) on networks that use subsecond HELLO timers, and (c) on networks that use alternative strategies for refreshing link-state information. Our results are based on a very detailed simulation of a real ISP network with 292 nodes and 765 links.
Network routing
Routing Information Protocol
Cite
Citations (37)
Routing Information Protocol
Carbon Footprint
Cite
Citations (2)
A comparison is made of the open shortest path first (OSPF) and intermediate system-to-intermediate system (IS-IS) routing protocols in terms of their ability to route internet protocol (IP) traffic. Common characteristics of the two protocols are briefly indicated. The differences between the two are explored with respect to packet encoding, area partitions, level 2 partitions, injection of level 2 information, authentication, designated router election, link state packet propagation, synchronized parameter setting, and neighbor initialization.< >
Initialization
Border Gateway Protocol
Interior gateway protocol
Link state packet
Cite
Citations (51)
Open Shortest Path First (OSPF), a link state routing protocol, is a popular interior gateway protocol (IGP) in the Internet. Wide spread deployment and years of experience running the protocol have motivated continuous improvements in its operation as the nature and demands of the routing infrastructures have changed. Modern routing domains need to maintain a very high level of service availability. Hence, OSPF needs to achieve fast convergence to topology changes. Also, the ever-growing size of routing domains, and possible presence of wireless mobile adhoc network (MANET) components, requires highly scalable operation on part of OSPF to avoid routing instability. Recent years have seen significant efforts aimed at improving OSPF's convergence speed as well as scalability and extending OSPF to achieve seamless integration of mobile adhoc networks with conventional wired networks. In this paper, we present a comprehensive survey of these efforts.
Routing Information Protocol
Zone Routing Protocol
Interior gateway protocol
Cite
Citations (75)
We study the stability of the OSPF protocol under steady state and perturbed conditions. We look at three indicators of stability, namely, (a) network convergence times, (b) routing load on processors, and (c) the number of route flaps. We study these statistics under three different scenarios: (a) on networks that deploy OSPF with TE extensions, (b) on networks that use subsecond HELLO timers, and (c) on networks that use alternative strategies for refreshing link-state information. Our results are based on a very detailed simulation of a real ISP network with 292 nodes and 765 links.
Network routing
Routing Information Protocol
Cite
Citations (195)