Multiple Routing Configurations for Datacenter Disaster Recovery Applicability and Challenges
|
|
- Eustacia Curtis
- 7 years ago
- Views:
Transcription
1 Proc. of the International Conference on Computer & Communication Engineering 2014 (ICCCE 2014) September 2014, Kuala Lumpur, Malaysia Multiple Routing Configurations for Datacenter Disaster Recovery Applicability and Challenges Mohamed A. El-Serafy 1, El-Sayed A. El-Badawy 1,3,4, Moustafa H. Aly 2,3, and Ibrahim A. Ghaleb 1,4 1 Electrical Engineering Department, Faculty of Engineering, Alexandria University, Alexandria, Egypt 2 Arab Academy for Science, Technology and Maritime Transport, Alexandria, Egypt 3 Member of the Optical Society of America (OSA) 4 Member IEEE Abstract: Cloud services based on datacenter networks are becoming very important. Datacenters host computing and storage resources, and these resources are served to customers through a network of datacenters. Protecting such a network from disasters like earthquakes, hurricanes and terrorist attacks is crucial. In this paper, we propose the use of multiple routing configurations (MRC) IP fast reroute recovery process for datacenter disaster recovery. A demonstration of how this recovery scheme can be applied is shown. Also, we discuss the impact of the MRC recovery process on the post failure load distribution over network links and how this impact can be minimized. We propose a manual technique to minimize the impact of MRC and compare it to an automatic technique called modified MRC. Both the advantages and disadvantages of the two techniques are outlined. We conclude that a newer technique is needed that overcome the above mentioned disadvantages. The new technique should not manipulate link weights to achieve good load distribution. Keywords: Datacenter networks; disaster recovery; network resilience; multiple routing configurations; IP fast reroute; multi topology routing; network protection. I. Introduction The role of the Internet is continuously increasing and many technical, commercial and business transactions are carried out by millions of users who exploit a set of network applications [1]. An increasing fraction of computing and storage is migrating to a planetary cloud of datacenters [2]. Cloud computing has emerged as a popular computing environment that provides computing power and storing space for small to large enterprises, within minimum cost [3]. The cloud consists of geographically distributed mega datacenters connected by a high capacity network [4]. In such a network, different services are replicated over multiple datacenters, so that a user request can be served by any datacenter that supports the specified service [5]. To meet the demands set by the high volume of traffic between datacenters, optical networks are ideally suited, given their high bandwidth and low-latency characteristics [5]. Traditionally, network protection against single-link failures is ensured by providing a backup path to the same destination (i.e., datacenter), which is link-disjoint to the primary path. This scheme has been refined by the introduction of a backup datacenter, thus adding protection against failures of a single datacenter [6]. However, this protection scheme fails to protect against disasters located in an area that contains both primary and backup resources (either network links or datacenters) [5]. Multiple failures generally occur due to natural disasters such as earthquake, hurricane, tsunami, tornado, etc. or human-made disasters such as weapons of mass destruction (WMD) and electromagnetic pulse (EMP) attacks [7]. Such disasters affect specific geographic areas, as a result, a set of collocated nodes and links go down simultaneously e.g., the 2011 earthquake and tsunami in Japan and the 2008 China Sichuan earthquake caused massive damage to telecom networks in large geographic areas. These events indicate that it is crucial to study disaster protection mechanisms for communication networks [5]. From a networking point of view, disasters like the ones just mentioned have two key characteristics. First, a large number of nodes can be down at the same time. This makes many traditional protection mechanisms unsuitable, since they are often designed to protect against single failures, and most methods focus on link failures only. Second, the failing nodes are geographically near each other, giving poor connectivity in the disaster area [8]. Given the reduced availability and the increased need for communications near and in the disaster area, a disaster recovery scheme should aim at treating the affected area isolated from the rest of the network. Since the affected area of the network must be considered unreliable, other parts of the network should not be dependent on this area for routing or traffic forwarding [8]. At the same time, the remaining resources in the affected area and between the affected area and the rest of the network, is likely to be scarce, and put under heavy pressure. These communication resources should therefore be available for intra-area traffic and traffic originating or terminating in the area, not transit traffic [8]. In such networks, path protection against network failures is a must. A link or a node failure is typically followed by a period of routing instability. During this period, packets may be dropped due to invalid routes and this has an adverse effect on real time applications [9]. Traditionally, such disruptions have lasted for periods of at least several seconds. They have been shown to occur frequently and are often triggered by external routing protocols [10].
2 Recent advances in routers have reduced this interval to under a second for carefully configured networks using link state interior gateway protocols (IGPs). However, new Internet services that are classified as real time applications are very sensitive to periods of traffic loss [11]. Addressing these issues is difficult because the distributed nature of the network imposes an intrinsic limit on the minimum convergence time that can be achieved. However, there is an alternate approach, which is to compute backup routes that allow the failure to be repaired locally by the router detecting the failure without the immediate need to inform other routers of the failure. In this case, the disruption time can be limited to the small time taken to detect the adjacent failure and invoke the backup routes. This approach is called IP fast reroute [12]. Link state IGPs use reconvergence process that is characterized by being reactive and global. IP fast reroute is proactive and local in nature. One of the IP fast reroute approaches is MRC [13]. MRC was built on the concept of resilient routing layers (RRL) [14] and [15]. Previously, RRL was proposed as a disaster recovery scheme to protect the network against large scale disasters [8]. In this paper, we propose MRC as a proactive disaster recovery scheme that can be applied to datacenter networks. The impact of the MRC recovery process on the post failure load distribution over network links and how this impact can be minimized is also discussed. We propose a manual technique to minimize the impact of MRC and compare it to an automatic technique called modified MRC. Both the advantages and disadvantages of the two techniques are outlined. We conclude that a newer technique is needed that overcome the above mentioned disadvantages. The new technique should not manipulate link weights to achieve good load distribution. The rest of this paper is organized as follows: in Section 2, the idea behind MRC is outlined. In Section 3, MRC for datacenter disaster recovery is presented. In section 4 a comparison between two techniques used to achieve good load distribution of traffic across network links after failure while using MRC is discussed and finally findings are concluded in Section 5. detects the failure can safely forward the incoming packets towards the destination. This is achieved for each link and node failure, and regardless of whether it is a link or a node failure. MRC assumes that, the network uses shortest path routing like open shortest path first (OSPF) and destination based hop-by-hop forwarding [13]. In a configuration that is resistant to the failure of a node n or link l, link weights are assigned so that traffic routed according to this configuration is never routed through node n or over link l. In MRC, node n and link l are called isolated in a configuration, when no traffic is routed through n or l according to this configuration [13]. After generating the backup configurations, a standard link state routing protocol like OSPF is run over the generated configurations to construct a loop free configuration specific forwarding table to all destinations in the network. When a packet is forwarded according to a configuration, it is forwarded using the forwarding table calculated based on that configuration. Figure 1 shows packet forwarding process from a node s perspective [13]. II. IP Fast Reroute using MRC MRC is a proactive and local IP fast reroute scheme which allows recovery in the range of milliseconds. MRC allows packet forwarding to continue over preconfigured alternative next hops immediately after the detection of the failure. Using MRC as a first line of defense against network failures, the normal IP re-convergence process can be put on hold. This process is then initiated only as a consequence of non-transient failures [13]. MRC guarantees recovery from any single link or node failure, which constitutes a large majority of the failures experienced in a network [16]. The main idea of MRC is to use the network graph and the associated link weights to produce a small set of backup network configurations. The link weights in these backup configurations are manipulated so that the node that Fig. 1. Flow chart of a node s packet forwarding process using MRC [13]. When a router detects that a neighbor can no longer be reached through one of its interfaces, it does not immediately inform the rest of the network about the connectivity failure. Instead, packets that would normally be forwarded over the failed interface are marked as belonging to a backup configuration, and forwarded on an alternative interface towards its destination. The packets must be marked with a configuration identifier. So, the routers along the path know which configuration to use [13].
3 MRC does not affect the failure free original routing. When there is no failure, all packets are forwarded according to the original configuration, where all link weights are normal. Upon detection of a failure, only traffic reaching the failure will switch configuration. All other traffic is forwarded according to the original configuration as normal [13]. A detailed explanation of the MRC algorithm can be found in [13]. III. MRC for Datacenter Disaster Recovery Once a node running MRC detects a failure towards the final destination, there exists a backup configuration that will forward the traffic to its final destination on a path that avoids the failed element [13]. The disastrous events often strike one or more particular areas. These areas can be states, cities, campuses or buildings. An area that has been struck by a disaster will experience a decreased amount of available communication resources. On the contrary the need for communication to and from that area may increase. Therefore, communications that are transiting this area should find other routes [8]. To accomplish the isolation of whole areas and not only single nodes, it is suggested to consider localized nodes as one area (i.e. a node represents an area with respect to the recovery scheme) [8]. Figure 2 shows the European COST239 network [17]. Each area consists of several intra-area nodes which offer different connections to other nodes in other areas. We apply the MRC recovery algorithm to the above COST239 network to demonstrate the applicability of the algorithm to protect against disastrous events that affect datacenter networks. The following is considered in our simulation model: The European COST239 network denoted by C0. Number of MRC backup configurations n = 5 (C1, C2, C3, C4, C5). OSPF is the IGP routing protocol. The output of the algorithm is five backup configurations. OSPF is used as the IGP to build the forwarding table for each backup configuration. Hereafter, the five backup configurations are shown. The isolated areas are denoted by dotted circles. The isolated links are denoted by dotted lines, where they are given very high weights. No transit traffic will pass through the isolated areas or isolated links. Figure 3 shows the first backup configuration where area 1 and area 7 are isolated along with their links. Considering a disaster event striking area 1, some intra-area nodes may survive and hence still offer connectivity to other areas. The MRC will guarantee that the traffic originated and terminated in area 1 will still be routed from or to that area, while the traffic transiting area 1 will be rerouted around the affected area. This is accomplished by routing the affected traffic according to the backup configuration C1. Traffic not originally passing area 1 will still be routed according to the full topology C0. Fig. 3. Backup configuration C1 generated using the MRC algorithm. Fig. 2. The COST239 network topology. Figure 4 shows the backup configuration C2 where area 3 and area 8 are isolated. In this section, we propose the use of MRC recovery algorithm to a network of datacenters. Assuming that every area contains a datacenter, The MRC recovery scheme will guarantee that every area and link is isolated in at least one backup configuration. The isolated area or link in a backup configuration will not carry any transit traffic, just the traffic destined to or originating from the isolated area.
4 Fig. 4. Backup configuration C2 generated using the MRC algorithm. Figure 5 shows the backup configuration C3 where area 2 and area 6 are isolated. Figure 6 shows the backup configuration C4 where area 5, area 10 and area 11 are isolated. Figure 7 shows the backup configuration C5 where area 4 and area 9 are isolated. Fig. 7. Backup configuration C5 - MRC algorithm. Following the assumption that every area has a datacenter, MRC succeeds to offer service protection as the failure of a single datacenter in any area does not cause the disappearance of a specific service from the whole network. By using the backup configuration that has the failed datacenter isolated, user requests can still be served by any datacenter that supports the specified service. IV. Impact of MRC on Post Failure Link Load Distribution Fig. 5. Backup configuration C3 - MRC algorithm. Once an area running MRC detects a failure towards the final destination, there exists a backup configuration that will forward the traffic to its final destination on a path that avoids the failed area. This shifting of traffic to alternate links after a failure can lead to congestion and packet loss in parts of the network [18]. In this section, we discuss how to minimize the impact of the MRC recovery process on the post failure load distribution over network links. Two techniques used to achieve a good load distribution across links after failure are compared. We proposed the first technique which utilizes manual link weight manipulation with MRC. The second technique is the modified MRC proposed in [19]. A. Manual link weight manipulation for post failure load distribution with MRC Fig. 6. Backup configuration C4 - MRC algorithm. Our simulation model using OPNET modeler software shows the impact of the MRC recovery process on the link load. The link load is shown to increase after single area failure. To solve this problem, and to achieve good load distribution across links, we propose the use of manual link weight manipulation on the MRC backup configurations. Considering the case of area 1 failure while having full mesh traffic between all areas, area 2 will use backup configuration C1 to continue forwarding traffic to area 10.
5 This will cause congestion in some network links. To decrease the load on the congested links, manual link weight manipulate is used to achieve a better load distribution for the traffic. Figure 8 shows the effect of using this approach on the link loads of some links. B. Modified MRC for post failure load distribution In this section, it is shown how Kvalbein et al. tried to solve this problem. Kvalbein et al. proposed an approach for minimizing the impact of the MRC recovery process on the post failure load distribution. They presented an algorithm to create the MRC backup configurations in a way that takes the traffic distribution into account. They referred to this new algorithm as the modified MRC. They presented a heuristic aimed at finding a set of link weights for each backup configuration that distributes the load well in the network after any single link failure [19]. In figure 10 the standard MRC and the modified MRC are directly compared. The modified MRC often manages to route traffic over less utilized links after the failure of a heavily loaded link [20]. Fig. 8. Link utilization for A2-A9 and A10-A11 links. As a drawback of applying manual link weight manipulation, some other links in the network have severe high link utilization. Figure 9 shows the drawback for three links. Fig. 10. Load on all unidirectional links after failure using standard MRC and modified MRC [20]. Fig. 9. Link utilization for A9-A2, A10-A9 & A2-A5 links. As a conclusion, using manual link weight manipulation technique to solve the problem of achieving good load distribution in the network has the following advantages: Simple - no complex algorithm is needed. Easy to deploy in small networks. Used to achieve good load distribution for selected number of links. Its disadvantages are as follows: Manual Hard to deploy in large networks Cannot be used to achieve global load distribution for all network links at the same time. The modified MRC algorithm has the following advantages: Automatic - no link weight manipulation is needed after the discovery of a failure. Used to achieve good load distribution across all links. Its disadvantages are as follows: Complex - the complexity of the algorithm is affected by the size of the network topology G under consideration. A predefined demand matrix D must be defined. If the matrix is changed, the algorithm has to run again. Cannot be used to protect against all link failure. The algorithm is designed to protect against the failure of critical links only by distributing the traffic that was held by these links on other available links.
6 V. Conclusion In this paper, we propose the use of MRC IP fast reroute recovery process for datacenter disaster recovery. We demonstrated the applicability of MRC algorithm for network of datacenters. Using MRC as a proactive IP fast reroute scheme, no traffic will be dropped. The traffic that is destined to the failed datacenter will be immediately rerouted to a backup datacenter in another area away from the area that suffered a disaster. Such scheme suits modern applications that are replicated over distributed datacenters. Also, we discuss the impact of the MRC recovery process on the post failure load distribution over network links and how this impact can be minimized. We propose a manual technique to minimize the impact of MRC and compare it to an automatic technique called modified MRC. Both the advantages and disadvantages of the two techniques are outlined. We conclude that a newer technique is needed that overcome the above mentioned disadvantages. The new technique should not manipulate link weights to achieve good load distribution. Currently, we are developing this new technique that achieves unequal weight load balance with no need to change link weights. To achieve this, OSPF protocol is tweaked to be able to do unequal weight load balance with no change in link weights. This new technique will overcomes all previously mentioned disadvantages while achieving good load distribution across network links. REFERENCES [1] M. Marchese, R. Surlinelli and S. Zappatore, "Monitoring unauthorized internet accesses through a honeypot system," International Journal of Communication Systems, vol. 24, issue 1, pp , [2] A. Vahdat, L. Hong, Z. Xiaoxue and C. Johnson, "The emerging optical data center," Optical Fiber Communication Conference and Exposition and the National Fiber Optic Engineers Conference, OFC/NFOEC 2011, pp. 1-3, Los Angeles, California, USA, 6-10 March [3] B. Rimal and E. Choi, "A service-oriented taxonomical spectrum, cloudy challenges and opportunities of cloud computing," International Journal of Communication Systems, vol. 25, issue 6, pp , [4] V. Vusirikala, C. Lam, P. Schultz and B. Koley, "Drivers and applications of optical technologies for Internet Data Center networks," Optical Fiber Communication Conference and Exposition and the National Fiber Optic Engineers Conference, OFC/NFOEC 2011, pp. 1-3, Los Angeles, California, USA, 6-10 March [5] M. Habib, M. Tornatore, M. De Leenheer, F. Dikbiyik and B. Mukherjee, "A disaster-resilient multi-content optical datacenter network architecture," Proceedings of the 13th International Conference on Transparent Optical Networks, ICTON 2011, pp. 1-4, Stockholm, Sweden, June [6] C. Develder, B. Dhoedt, B. Mukherjee and P. Demeester, "On dimensioning optical grids and the impact of scheduling," Journal of Photonic Network Communications, vol. 17, issue 3, pp , June [7] S. Neumayer, G. Zussman, R. Cohen and E. Modiano, "Assessing the Vulnerability of the Fiber Infrastructure to Disasters," Proceedings of the 28th IEEE International Conference on Computer Communications, INFOCOM 2009, pp , Rio de Janeiro, Brazil, April [8] A. F. Hansen, A. Kvalbein, T. Cicic and S. Gjessing, "Resilient routing layers for network disaster planning," Proceedings of the 4th International Conference on Networking, ICN 2005, pp , Reunion Island, France, April [9] C. Boutremans, G. Iannaccone and C. Diot, "Impact of link failures on VoIP performance," Proceedings of the 12th International Workshop on Network and Operating Systems Support for Digital Audio and Video, NOSSDAV 2002, pp , Miami, Florida, USA, May [10] D. Watson, F. Jahanian and C. Labovitz, "Experiences with monitoring OSPF on a regional service provider network," Proceedings of the 23rd International Conference on Distributed Computing Systems, ICDCS 2003, pp , Providence, Rhode Island, USA, May [11] P. Francois, C. Filsfils, J. Evans and O. Bonaventure, "Achieving subsecond IGP convergence in large IP networks," ACM SIGCOMM Computer Communication Review, vol. 35, pp , July [12] M. Shand and S. Bryant, "IP Fast Reroute Framework," IETF Internet draft, draft-ietf-rtgwg-ipfrr-framework-13.txt, 23 October [13] A. Kvalbein, A. F. Hansen, T. Cicic, S. Gjessing, and O. Lysne, "Fast IP network recovery using multiple routing configurations," Proceedings of the 25th IEEE International Conference on Computer Communications, INFOCOM 2006, pp. 1-11, Barcelona, Catalunya, Spain, April [14] A. F. Hansen, A. Kvalbein, T. Cicic, S. Gjessing and O. Lysne, "Resilient routing layers for recovery in packet networks," Proceedings of the International Conference on Dependable Systems and Networks, DSN 2005, pp , Yokohama, Japan, 28 June - 1 July [15] A. Kvalbein, A. F. Hansen, T. Cicic, S. Gjessing and O. Lysne, "Fast recovery from link failures using resilient routing layers," Proceedings of the 10th IEEE Symposium on Computers and Communications, ISCC 2005, pp , Murcia, Cartagena, Spain, June [16] A. Markopoulou, G. Iannaccone, S. Bhattacharyya, C. Chen-Nee and C. Diot, "Characterization of failures in an IP backbone," Proceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 2004, vol. 4, pp , Hong Kong, China, 7-11 March [17] M. O'Mahony, "Results from the COST 239 project. Ultra-High Capacity Optical Transmission Networks," 22nd European Conference on optical Communication, ECOC 1996, vol. 2, pp , Oslo, Norway, 19 September [18] I. Sundar, B. Supratik, N. Taft and C. Diot, "An approach to alleviate link overload as observed on an IP backbone," Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 2003, vol. 1, pp , San Franciso, California, USA, 30 March - 3 April [17] A. Kvalbein, T. Cicic and S. Gjessing, "Post-failure routing performance with multiple routing configurations," Proceedings of the 26th IEEE International Conference on Computer Communications, INFOCOM 2007, pp , Anchorage, Alaska, USA, 6-12 May [20] A. Kvalbein, A. F. Hansen, T. Cicic, S. Gjessing and O. Lysne, "Multiple routing configurations for fast IP network recovery," IEEE/ACM Transactions on Networking, vol. 17, pp , April 2009.
Enhanced Multiple Routing Configurations For Fast IP Network Recovery From Multiple Failures
Enhanced Multiple Routing Configurations For Fast IP Network Recovery From Multiple Failures T. Anji Kumar anji5678@gmail.com Dept. of IT/ UCEV JNTUK Vizianagaram, 535003, India Dr MHM Krishna Prasad Dept.
More informationA Network Recovery Scheme for Node or Link Failures using Multiple Routing Configurations
A Network Recovery Scheme for Node or Link Failures using Multiple Routing Configurations Suresh Babu Panatula Department of Computer Science and Engineering Sri Sai Aditya Institute of Science and Technology,
More informationAnalyzing Multiple Routing Configuration
I. J. Computer Network and Information Security, 2016, 5, 48-54 Published Online May 2016 in MECS (http://www.mecs-press.org/) DOI: 10.5815/ijcnis.2016.05.07 Analyzing Multiple Routing Configuration Meenakshi
More informationMultiple Routing Configurations for Fast IP Network Recovery
1 Multiple Routing Configurations for Fast IP Network Recovery Amund Kvalbein, Member, IEEE, Audun Fosselie Hansen, Member, IEEE, Tarik Čičić, Member, IEEE, Stein Gjessing, Member, IEEE, Olav Lysne, Member,
More informationSimulation of Heuristic Usage for Load Balancing In Routing Efficiency
Simulation of Heuristic Usage for Load Balancing In Routing Efficiency Nor Musliza Mustafa Fakulti Sains dan Teknologi Maklumat, Kolej Universiti Islam Antarabangsa Selangor normusliza@kuis.edu.my Abstract.
More informationRobust Load Balancing using Multi-Topology Routing
Robust Load Balancing using Multi-Topology Routing Amund Kvalbein and Olav Lysne Simula Research Laboratory, Oslo, Norway Abstract Current methods for traffic engineering with traditional link state routing
More informationA Fast Path Recovery Mechanism for MPLS Networks
A Fast Path Recovery Mechanism for MPLS Networks Jenhui Chen, Chung-Ching Chiou, and Shih-Lin Wu Department of Computer Science and Information Engineering Chang Gung University, Taoyuan, Taiwan, R.O.C.
More informationA Comparison Study of Qos Using Different Routing Algorithms In Mobile Ad Hoc Networks
A Comparison Study of Qos Using Different Routing Algorithms In Mobile Ad Hoc Networks T.Chandrasekhar 1, J.S.Chakravarthi 2, K.Sravya 3 Professor, Dept. of Electronics and Communication Engg., GIET Engg.
More informationAchieving fast Recovery in IP Networks by Multiple Routing Configuration
Achieving fast Recovery in IP Networks by Multiple Routing Configuration 1. Prajwalsingh Parihar 2. Pradeep Pandey, Anushree Deshmukh, Surabhi Gawali, Samruddhi Phadnis, Nikesh Gajbhiye 1Assistant Professor,Department
More informationAutonomous Fast Rerouting for Software Defined Network
Autonomous ast Rerouting for Software Defined Network 2012.10.29 NTT Network Service System Laboratories, NTT Corporation Shohei Kamamura, Akeo Masuda, Koji Sasayama Page 1 Outline 1. Background and Motivation
More informationIP Traffic Engineering over OMP technique
IP Traffic Engineering over OMP technique 1 Károly Farkas, 1 Zoltán Balogh, 2 Henrik Villför 1 High Speed Networks Laboratory Department of Telecommunications and Telematics Technical University of Budapest,
More informationFlow optimization in IP networks with fast proactive recovery
INVITED PAPER Flow optimization in IP networks with fast proactive recovery MATEUSZ DZIDA, MICHAL ZAGOZDZON, MATEUSZ ZOTKIEWICZ, MICHAL PIÓRO Institute of Telecommunications, Warsaw University of Technology,
More informationRecovery Modeling in MPLS Networks
Proceedings of the Int. Conf. on Computer and Communication Engineering, ICCCE 06 Vol. I, 9-11 May 2006, Kuala Lumpur, Malaysia Recovery Modeling in MPLS Networks Wajdi Al-Khateeb 1, Sufyan Al-Irhayim
More informationA Cross-Layer Approach for IP Network Protection
A Cross-Layer Approach for IP Network Protection Qiang Zheng, Jing Zhao, and Guohong Cao Department of Computer Science and Engineering The Pennsylvania State University E-mail: {quz13, juz139, gcao}@cse.psu.edu
More informationMILP Model And Models For Cloud Network Backup
Minimizing Disaster Backup Window for Geo-Distributed Multi-Datacenter Cloud Systems Jingjing Yao, Ping Lu, Zuqing Zhu School of Information Science and Technology University of Science and Technology
More informationWDM Passive Optical Networks: Protection and Restoration
OECC 2009 Workshop: Next-generation Broadband Optical Access Future Challenges Session 1: Broadband Network Architectures, WDM PON Evolution Strategies and Future Ultra-high- bandwidth Services WDM Passive
More informationBorder Gateway Protocols
Paper 106, ENG 104 Border Gateway Protocols Sadeta Krijestorac, Marc Beck, Jonathan Bagby Morehead State University University of Louisville Florida Atlanic University s.krijestor@moreheadstate.edu marcbeck1982@yahoo.com
More informationOpnet Based simulation for route redistribution in EIGRP, BGP and OSPF network protocols
IOSR Journal of Electronics and Communication Engineering (IOSR-JECE) e-issn: 2278-2834,p- ISSN: 2278-8735.Volume 9, Issue 1, Ver. IV (Jan. 2014), PP 47-52 Opnet Based simulation for route redistribution
More informationSecurity Threats in Mobile Ad Hoc Networks
Security Threats in Mobile Ad Hoc Networks Hande Bakiler, Aysel Şafak Department of Electrical & Electronics Engineering Baskent University Ankara, Turkey 21020013@baskent.edu.tr, asafak@baskent.edu.tr
More informationOSPF Version 2 (RFC 2328) Describes Autonomous Systems (AS) topology. Propagated by flooding: Link State Advertisements (LSAs).
OSPF Version 2 (RFC 2328) Interior gateway protocol (IGP). Routers maintain link-state database. Describes Autonomous Systems (AS) topology. Propagated by flooding: Link State Advertisements (LSAs). Router
More informationLoad-Balanced IP Fast Failure Recovery
Load-Balanced IP Fast Failure Recovery Mingui Zhang,BinLiu, and Beichuan Zhang 2 Computer Science and Technology Dept., Tsinghua University, Beijing, 84, P.R. China 2 Computer Science Dept., University
More informationFast Reroute Techniques in MPLS Networks. George Swallow swallow@cisco.com
Fast Reroute Techniques in MPLS Networks George Swallow swallow@cisco.com Agenda What are your requirements? The solution space U-turns Traffic Engineering for LDP Traffic Engineering Some Observations
More informationA New Forwarding Policy for Load Balancing in Communication Networks
A New Forwarding Policy for Load Balancing in Communication Networks Martin Heusse Yvon Kermarrec ENST de Bretagne BP 83, 985 Brest Cedex, France Martin.Heusse@enst-bretagne.fr Abstract We present in this
More informationDisaster-Resilient Backbone and Access Networks
The Workshop on Establishing Resilient Life-Space in the Cyber-Physical Integrated Society, March. 17, 2015, Sendai, Japan Disaster-Resilient Backbone and Access Networks Shigeki Yamada (shigeki@nii.ac.jp)
More information2004 Networks UK Publishers. Reprinted with permission.
Riikka Susitaival and Samuli Aalto. Adaptive load balancing with OSPF. In Proceedings of the Second International Working Conference on Performance Modelling and Evaluation of Heterogeneous Networks (HET
More informationPerformance Evaluation of Mobile Agent-based Dynamic Load Balancing Algorithm
Performance Evaluation of Mobile -based Dynamic Load Balancing Algorithm MAGDY SAEB, CHERINE FATHY Computer Engineering Department Arab Academy for Science, Technology & Maritime Transport Alexandria,
More informationEvaluation And Implementation Of The Open Shortest Path First (OSPF) Routing Protocol
Evaluation And Implementation Of The Open Shortest Path First (OSPF) Routing Protocol G.C NWALOZIE 1, V.N OKOROGU 2, A.C OKAFOR 3, A.O UMEH 4 1, 2, 3,4 Electronic and Computer Engineering Department, Nnamdi
More informationA Catechistic Method for Traffic Pattern Discovery in MANET
A Catechistic Method for Traffic Pattern Discovery in MANET R. Saranya 1, R. Santhosh 2 1 PG Scholar, Computer Science and Engineering, Karpagam University, Coimbatore. 2 Assistant Professor, Computer
More informationMAXIMIZING RESTORABLE THROUGHPUT IN MPLS NETWORKS
MAXIMIZING RESTORABLE THROUGHPUT IN MPLS NETWORKS 1 M.LAKSHMI, 2 N.LAKSHMI 1 Assitant Professor, Dept.of.Computer science, MCC college.pattukottai. 2 Research Scholar, Dept.of.Computer science, MCC college.pattukottai.
More informationBehavior Analysis of TCP Traffic in Mobile Ad Hoc Network using Reactive Routing Protocols
Behavior Analysis of TCP Traffic in Mobile Ad Hoc Network using Reactive Routing Protocols Purvi N. Ramanuj Department of Computer Engineering L.D. College of Engineering Ahmedabad Hiteishi M. Diwanji
More informationANALYSIS OF LONG DISTANCE 3-WAY CONFERENCE CALLING WITH VOIP
ENSC 427: Communication Networks ANALYSIS OF LONG DISTANCE 3-WAY CONFERENCE CALLING WITH VOIP Spring 2010 Final Project Group #6: Gurpal Singh Sandhu Sasan Naderi Claret Ramos (gss7@sfu.ca) (sna14@sfu.ca)
More informationProactive self-healing mechanisms for IP networks. IETF89/NMRG33 London Bruno Vidalenc, Laurent Ciavaglia
Proactive self-healing mechanisms for IP networks IETF89/NMRG33 London Bruno Vidalenc, Laurent Ciavaglia 1 Overview Goal: extra-resilient IP networks How: new autonomic capability Proactive and adaptive
More informationImplementing VPN over MPLS
IOSR Journal of Electronics and Communication Engineering (IOSR-JECE) e-issn: 2278-2834,p- ISSN: 2278-8735.Volume 10, Issue 3, Ver. I (May - Jun.2015), PP 48-53 www.iosrjournals.org Implementing VPN over
More informationFlexible SDN Transport Networks With Optical Circuit Switching
Flexible SDN Transport Networks With Optical Circuit Switching Multi-Layer, Multi-Vendor, Multi-Domain SDN Transport Optimization SDN AT LIGHT SPEED TM 2015 CALIENT Technologies 1 INTRODUCTION The economic
More informationOverlay Routing and the Future of Communication
Intra Autonomous System Overlay Dedicated to Communication Resilience Simon Delamare and Gwendal Le Grand TELECOM ParisTech (ENST) LTCI UMR 5141 CNRS, 46 rue Barrault, 75634 Paris Cedex, France. delamare@telecom-paristech.fr
More informationPerformance Evaluation of AODV, OLSR Routing Protocol in VOIP Over Ad Hoc
(International Journal of Computer Science & Management Studies) Vol. 17, Issue 01 Performance Evaluation of AODV, OLSR Routing Protocol in VOIP Over Ad Hoc Dr. Khalid Hamid Bilal Khartoum, Sudan dr.khalidbilal@hotmail.com
More informationMulti Protocol Label Switching (MPLS) is a core networking technology that
MPLS and MPLS VPNs: Basics for Beginners Christopher Brandon Johnson Abstract Multi Protocol Label Switching (MPLS) is a core networking technology that operates essentially in between Layers 2 and 3 of
More informationLecture 2.1 : The Distributed Bellman-Ford Algorithm. Lecture 2.2 : The Destination Sequenced Distance Vector (DSDV) protocol
Lecture 2 : The DSDV Protocol Lecture 2.1 : The Distributed Bellman-Ford Algorithm Lecture 2.2 : The Destination Sequenced Distance Vector (DSDV) protocol The Routing Problem S S D D The routing problem
More informationWhat Applications Can be Deployed with Software Defined Elastic Optical Networks?
What Applications Can be Deployed with Software Defined Elastic Optical Networks? Yongli Zhao State Key Laboratory of Information Photonics and Optical Communications, Beijing University of Posts and Telecommunications
More informationCROSS LAYER BASED MULTIPATH ROUTING FOR LOAD BALANCING
CHAPTER 6 CROSS LAYER BASED MULTIPATH ROUTING FOR LOAD BALANCING 6.1 INTRODUCTION The technical challenges in WMNs are load balancing, optimal routing, fairness, network auto-configuration and mobility
More informationUsing OSPF in an MPLS VPN Environment
Using OSPF in an MPLS VPN Environment Overview This module introduces the interaction between multi-protocol Border Gateway Protocol (MP-BGP) running between Provider Edge routers (s) and Open Shortest
More informationKeywords- manet, routing protocols, aodv, olsr, grp,data drop parameter.
Volume 5, Issue 3, March 2015 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Evaluation of
More informationCHAPTER 8 CONCLUSION AND FUTURE ENHANCEMENTS
137 CHAPTER 8 CONCLUSION AND FUTURE ENHANCEMENTS 8.1 CONCLUSION In this thesis, efficient schemes have been designed and analyzed to control congestion and distribute the load in the routing process of
More informationThe Economics of Cisco s nlight Multilayer Control Plane Architecture
The Economics of Cisco s nlight Multilayer Control Plane Architecture Executive Summary Networks are becoming more difficult to plan and optimize because of high traffic growth, volatile traffic patterns,
More informationDisaster Recovery Design Ehab Ashary University of Colorado at Colorado Springs
Disaster Recovery Design Ehab Ashary University of Colorado at Colorado Springs As a head of the campus network department in the Deanship of Information Technology at King Abdulaziz University for more
More informationEnhanced Variable Splitting Ratio Algorithm for Effective Load Balancing in MPLS Networks
Journal of Computer Science 4 (3): 232-238, 2008 ISSN 1549-3636 2008 Science Publications Enhanced Variable Splitting Ratio Algorithm for Effective Load Balancing in MPLS Networks 1 G. Murugesan, 2 A.M.
More informationMeasurement of V2oIP over Wide Area Network between Countries Using Soft Phone and USB Phone
The International Arab Journal of Information Technology, Vol. 7, No. 4, October 2010 343 Measurement of V2oIP over Wide Area Network between Countries Using Soft Phone and USB Phone Mohd Ismail Department
More informationLoop-Free Convergence using Ordered FIB Updates: Analysis and Routing Optimization
Loop-Free Convergence using Ordered FIB Updates: Analysis and Routing Optimization David Hock, Matthias Hartmann, Tim Neubert, Michael Menth University of Würzburg, Institute of Computer Science, Würzburg,
More informationKT The Value Networking Company
KT The Value Networking Company IRIMS (Internet Routing Information Management System) 2005. 9 Y.D. KIM, G.E.KIM, C.K.Hwang, J.H.YOO (webman, gekim, ckhwang, styoo@kt kt.co..co.kr) Abstract An AS (Autonomous
More informationPerformance advantages of resource sharing in polymorphic optical networks
R. J. Durán, I. de Miguel, N. Merayo, P. Fernández, R. M. Lorenzo, E. J. Abril, I. Tafur Monroy, Performance advantages of resource sharing in polymorphic optical networks, Proc. of the 0th European Conference
More informationMPLS - A Choice of Signaling Protocol
www.ijcsi.org 289 MPLS - A Choice of Signaling Protocol Muhammad Asif 1, Zahid Farid 2, Muhammad Lal 3, Junaid Qayyum 4 1 Department of Information Technology and Media (ITM), Mid Sweden University Sundsvall
More informationRouter Scheduling Configuration Based on the Maximization of Benefit and Carried Best Effort Traffic
Telecommunication Systems 24:2 4, 275 292, 2003 2003 Kluwer Academic Publishers. Manufactured in The Netherlands. Router Scheduling Configuration Based on the Maximization of Benefit and Carried Best Effort
More informationQoSIP: A QoS Aware IP Routing Protocol for Multimedia Data
QoSIP: A QoS Aware IP Routing Protocol for Multimedia Data Md. Golam Shagadul Amin Talukder and Al-Mukaddim Khan Pathan* Department of Computer Science and Engineering, Metropolitan University, Sylhet,
More informationNew QOS Routing Algorithm for MPLS Networks Using Delay and Bandwidth Constraints
New QOS Routing Algorithm for MPLS Networks Using Delay and Bandwidth Constraints Santosh Kulkarni 1, Reema Sharma 2,Ishani Mishra 3 1 Department of ECE, KSSEM Bangalore,MIEEE, MIETE & ISTE 2 Department
More informationPART III. OPS-based wide area networks
PART III OPS-based wide area networks Chapter 7 Introduction to the OPS-based wide area network 7.1 State-of-the-art In this thesis, we consider the general switch architecture with full connectivity
More informationAnalysis of IP Network for different Quality of Service
2009 International Symposium on Computing, Communication, and Control (ISCCC 2009) Proc.of CSIT vol.1 (2011) (2011) IACSIT Press, Singapore Analysis of IP Network for different Quality of Service Ajith
More informationAn Efficient Fault Tolerance Model for Path Recovery in MPLS Networks
An Efficient Fault Tolerance Model for Path Recovery in MPLS Networks Arunkumar C K M.Tech student, Dept. of ECE, Dayananda Sagar College of Engineering, VTU, Banglore, India ABSTRACT: Increasing demand
More informationRing Protection: Wrapping vs. Steering
Ring Protection: Wrapping vs. Steering Necdet Uzun and Pinar Yilmaz March 13, 2001 Contents Objectives What are wrapping and steering Single/dual fiber cut Comparison of wrapping and steering Simulation
More informationDistance Vector Routing Protocols. Routing Protocols and Concepts Ola Lundh
Distance Vector Routing Protocols Routing Protocols and Concepts Ola Lundh Objectives The characteristics of distance vector routing protocols. The network discovery process of distance vector routing
More informationMPLS Traffic Engineering in ISP Network
MPLS Traffic Engineering in ISP Network Mohsin Khan Birmingham City University, England ABSTRACT Multi Protocol Label Switching (MPLS) is an innovative and vibrant technology. The most famous applications
More informationA Survey: High Speed TCP Variants in Wireless Networks
ISSN: 2321-7782 (Online) Volume 1, Issue 7, December 2013 International Journal of Advance Research in Computer Science and Management Studies Research Paper Available online at: www.ijarcsms.com A Survey:
More informationPath Selection Methods for Localized Quality of Service Routing
Path Selection Methods for Localized Quality of Service Routing Xin Yuan and Arif Saifee Department of Computer Science, Florida State University, Tallahassee, FL Abstract Localized Quality of Service
More informationPosition and Velocity Aided Routing Protocol in Mobile Ad Hoc Networks
Position and Velocity Aided Routing Protocol in Mobile Ad Hoc Networks 1 Taifei Zhao, 2 Xizheng Ke, 3 Peilin Yang *1,Corresponding Author Department of Electronics Engineering, Xi an University of Technology,
More informationChapter 10 Link-State Routing Protocols
Chapter 10 Link-State Routing Protocols CCNA2-1 Chapter 10 Note for Instructors These presentations are the result of a collaboration among the instructors at St. Clair College in Windsor, Ontario. Thanks
More informationPerformance Comparison of Mixed Protocols Based on EIGRP, IS-IS and OSPF for Real-time Applications
Middle-East Journal of Scientific Research 12 (11): 1502-1508, 2012 ISSN 1990-9233 IDOSI Publications, 2012 DOI: 10.5829/idosi.mejsr.2012.12.11.144 Performance Comparison of Mixed Protocols Based on EIGRP,
More informationCan Forwarding Loops Appear when Activating ibgp Multipath Load Sharing?
Can Forwarding Loops Appear when Activating ibgp Multipath Load Sharing? Simon Balon and Guy Leduc Research Unit in Networking EECS Department- University of Liège (ULg) Institut Montefiore, B28 - B-4000
More informationMultiple Layer Traffic Engineering in NTT Network Service
Multi-layer traffic engineering in photonic-gmpls-router networks Naoaki Yamanaka, Masaru Katayama, Kohei Shiomoto, Eiji Oki and Nobuaki Matsuura * NTT Network Innovation Laboratories * NTT Network Service
More informationCOMPARATIVE ANALYSIS OF ON -DEMAND MOBILE AD-HOC NETWORK
www.ijecs.in International Journal Of Engineering And Computer Science ISSN:2319-7242 Volume 2 Issue 5 May, 2013 Page No. 1680-1684 COMPARATIVE ANALYSIS OF ON -DEMAND MOBILE AD-HOC NETWORK ABSTRACT: Mr.Upendra
More informationResearch on Video Traffic Control Technology Based on SDN. Ziyan Lin
Joint International Mechanical, Electronic and Information Technology Conference (JIMET 2015) Research on Video Traffic Control Technology Based on SDN Ziyan Lin Communication University of China, Beijing
More informationInternet Firewall CSIS 4222. Packet Filtering. Internet Firewall. Examples. Spring 2011 CSIS 4222. net15 1. Routers can implement packet filtering
Internet Firewall CSIS 4222 A combination of hardware and software that isolates an organization s internal network from the Internet at large Ch 27: Internet Routing Ch 30: Packet filtering & firewalls
More informationWHITEPAPER MPLS: Key Factors to Consider When Selecting Your MPLS Provider
WHITEPAPER MPLS: Key Factors to Consider When Selecting Your MPLS Provider INTRODUCTION Multiprotocol Label Switching (MPLS), once the sole domain of major corporations and telecom carriers, has gone mainstream
More informationTable of Contents. Cisco How Does Load Balancing Work?
Table of Contents How Does Load Balancing Work?...1 Document ID: 5212...1 Introduction...1 Prerequisites...1 Requirements...1 Components Used...1 Conventions...1 Load Balancing...1 Per Destination and
More informationAN INTERWORKING IMPLEMENTATION AND PERFORMANCE EVALUATION IN IEEE 802.11S BASED CAMPUS MESH NETWORKS
AN INTERWORKING IMPLEMENTATION AND PERFORMANCE EVALUATION IN IEEE 802.11S BASED CAMPUS MESH NETWORKS G.MERLIN SHEEBA Electronics and Telecommunication Department, Sathyabama University Chennai, TamilNadu,
More informationCurrent Trends of Topology Discovery in OpenFlow-based Software Defined Networks
1 Current Trends of Topology Discovery in OpenFlow-based Software Defined Networks Leonardo Ochoa-Aday, Cristina Cervello -Pastor, Member, IEEE, and Adriana Ferna ndez-ferna ndez Abstract The explosion
More informationNetwork Level Multihoming and BGP Challenges
Network Level Multihoming and BGP Challenges Li Jia Helsinki University of Technology jili@cc.hut.fi Abstract Multihoming has been traditionally employed by enterprises and ISPs to improve network connectivity.
More informationPartial Path Protection for WDM Networks: End-to-End Recovery Using Local Failure Information
Partial Path Protection for WDM Networks: End-to-End Recovery Using Local Failure Information Hungjen Wang, Eytan Modiano, Muriel Médard Laboratory for Information and Decision Systems Massachusetts Institute
More informationAdministrative Distance
RIP is a distance vector routing protocol. It shares routing information through the local broadcast in every 30 seconds. In this tutorial we will explain RIP routing fundamentals with examples such as
More informationFlexible Deterministic Packet Marking: An IP Traceback Scheme Against DDOS Attacks
Flexible Deterministic Packet Marking: An IP Traceback Scheme Against DDOS Attacks Prashil S. Waghmare PG student, Sinhgad College of Engineering, Vadgaon, Pune University, Maharashtra, India. prashil.waghmare14@gmail.com
More informationA Hybrid Electrical and Optical Networking Topology of Data Center for Big Data Network
ASEE 2014 Zone I Conference, April 3-5, 2014, University of Bridgeport, Bridgpeort, CT, USA A Hybrid Electrical and Optical Networking Topology of Data Center for Big Data Network Mohammad Naimur Rahman
More informationChapter 4. Distance Vector Routing Protocols
Chapter 4 Distance Vector Routing Protocols CCNA2-1 Chapter 4 Note for Instructors These presentations are the result of a collaboration among the instructors at St. Clair College in Windsor, Ontario.
More informationThe Affects of Different Queuing Algorithms within the Router on QoS VoIP application Using OPNET
The Affects of Different Queuing Algorithms within the Router on QoS VoIP application Using OPNET Abstract: Dr. Hussein A. Mohammed*, Dr. Adnan Hussein Ali**, Hawraa Jassim Mohammed* * Iraqi Commission
More informationLink-State Routing Protocols
Link-State Routing Protocols Malin Bornhager Halmstad University Session Number 2002, Svenska-CNAP Halmstad University 1 Objectives Link-state routing protocol Single-area OSPF concepts Single-area OSPF
More informationResearch on Errors of Utilized Bandwidth Measured by NetFlow
Research on s of Utilized Bandwidth Measured by NetFlow Haiting Zhu 1, Xiaoguo Zhang 1,2, Wei Ding 1 1 School of Computer Science and Engineering, Southeast University, Nanjing 211189, China 2 Electronic
More informationCommunication Networks. MAP-TELE 2011/12 José Ruela
Communication Networks MAP-TELE 2011/12 José Ruela Network basic mechanisms Introduction to Communications Networks Communications networks Communications networks are used to transport information (data)
More informationCHAPTER 6. VOICE COMMUNICATION OVER HYBRID MANETs
CHAPTER 6 VOICE COMMUNICATION OVER HYBRID MANETs Multimedia real-time session services such as voice and videoconferencing with Quality of Service support is challenging task on Mobile Ad hoc Network (MANETs).
More informationAll Rights Reserved - Library of University of Jordan - Center of Thesis Deposit
iii DEDICATION To my parents, my wife, my brothers and sisters, and my son for their encouragement, and help during this thesis. iv ACKNOWLEDGEMENT I would like to thank my supervisor prof. Jameel Ayoub
More informationA Wheeling and Steering based route reconstruction approach in congested MPLS network
www.ijecs.in International Journal Of Engineering And Computer Science ISSN:2319-7242 Volume 3 Issue 8 August, 2014 Page No. 7959-7965 A Wheeling and Steering based route reconstruction approach in congested
More informationAN OVERVIEW OF QUALITY OF SERVICE COMPUTER NETWORK
Abstract AN OVERVIEW OF QUALITY OF SERVICE COMPUTER NETWORK Mrs. Amandeep Kaur, Assistant Professor, Department of Computer Application, Apeejay Institute of Management, Ramamandi, Jalandhar-144001, Punjab,
More informationTraffic Engineering Management Concepts
3 CHAPTER This chapter includes an overview of Cisco Prime Fulfillment and of some of the concepts used in this guide. This chapter includes the following sections: Prime Fulfillment TEM Overview, page
More informationAchieving Energy Efficiency in MANETs by Using Load Balancing Approach
International Journal of Computer Networks and Communications Security VOL. 3, NO. 3, MARCH 2015, 88 94 Available online at: www.ijcncs.org E-ISSN 2308-9830 (Online) / ISSN 2410-0595 (Print) Achieving
More informationMPLS: Key Factors to Consider When Selecting Your MPLS Provider Whitepaper
MPLS: Key Factors to Consider When Selecting Your MPLS Provider Whitepaper 2006-20011 EarthLink Business Page 1 EXECUTIVE SUMMARY Multiprotocol Label Switching (MPLS), once the sole domain of major corporations
More informationIntroduction to Dynamic Routing Protocols
CHAPTER 3 Introduction to Dynamic Routing Protocols Objectives Upon completion of this chapter, you should be able to answer the following questions: Can you describe the role of dynamic routing protocols
More informationPerformance Analysis of Routing Protocols for Real Time Application
Performance Analysis of Routing Protocols for Real Time Application Archana Kudtarkar 1, Reena Sonkusare 2, Dayanand Ambawade 3 Student-ME, Department of EXTC, SPIT, Mumbai, India 1 Associate Professor,
More informationA Comparative Study of Tree-based and Mesh-based Overlay P2P Media Streaming
A Comparative Study of Tree-based and Mesh-based Overlay P2P Media Streaming Chin Yong Goh 1,Hui Shyong Yeo 1, Hyotaek Lim 1 1 Dongseo University Busan, 617-716, South Korea cgnicky@gmail.com, hui_shyong@hotmail.com,
More informationRouter and Routing Basics
Router and Routing Basics Malin Bornhager Halmstad University Session Number 2002, Svenska-CNAP Halmstad University 1 Routing Protocols and Concepts CCNA2 Routing and packet forwarding Static routing Dynamic
More informationInfluence of Load Balancing on Quality of Real Time Data Transmission*
SERBIAN JOURNAL OF ELECTRICAL ENGINEERING Vol. 6, No. 3, December 2009, 515-524 UDK: 004.738.2 Influence of Load Balancing on Quality of Real Time Data Transmission* Nataša Maksić 1,a, Petar Knežević 2,
More informationRSVP- A Fault Tolerant Mechanism in MPLS Networks
RSVP- A Fault Tolerant Mechanism in MPLS Networks S.Ravi Kumar, M.Tech(NN) Assistant Professor Gokul Institute of Technology And Sciences Piridi, Bobbili, Vizianagaram, Andhrapradesh. Abstract: The data
More informationO 10.16.1.0/27 [110/129] via 192.168.1.5, 00:00:05, Serial0/0/1
1 Which two statements are true regarding the advantages of the use of static routes? (Choose increased security reduced effort in configuring routes the administrator maintains control over routing easier
More informationTraffic Engineering. Traffic Engineering
MPLS Traffic Engineering George Swallow swallow@cisco.com Traffic Engineering 1999, Cisco Systems, Inc. 1 What is Traffic Engineering Taking control of how traffic flows in your network in order to - Improve
More informationTOPOLOGIES NETWORK SECURITY SERVICES
TOPOLOGIES NETWORK SECURITY SERVICES 1 R.DEEPA 1 Assitant Professor, Dept.of.Computer science, Raja s college of Tamil Studies & Sanskrit,Thiruvaiyaru ABSTRACT--In the paper propose about topology security
More information