...Universidad de Santiago de ChileFacultad de IngenieríaDepartamento de Ingeniería InformáticaIngeniería de Ejecución en Computación e InformáticaRedes Computacionales | Redes Computacionales | Laboratorio Nº 2 | Integrantes: Profesor: * Ayudantes: Fecha de entrega: 06/06/2012 Tabla de contenido 1. RESUMEN EJECUTIVO 1 2. INTRODUCCIÓN 2 3. OBJETIVOS DEL LABORATORIO 3 3.1. Objetivo general 3 3.2. Objetivos específicos 3 4. DESARROLLO 4 4.1. Descripción del problema 4 4.2. Desarrollo del problema 4 4.2.1. Experiencia 1: Capas del modelo OSI 4 4.2.1.1. Nivel Físico 4 4.2.1.2. Nivel de enlace de datos 5 4.2.1.3. Nivel de red 5 4.2.1.4. Nivel de aplicación 6 4.2.1.5. Nivel de presentación 7 4.2.1.6. Nivel de sesión 7 4.2.1.7. Nivel de transporte 8 4.2.2. Experiencia 2 10 4.2.2.1. Router: 10 4.2.2.2. Switch 11 4.2.2.3. Hub y Repeater 12 4.2.2.4. Access Point 12 4.2.3. Experiencia 3 13 4.2.4. Experiencia 4 17 4.2.4.1. Red 1 17 4.2.4.2. Red 2 18 5. CONCLUSIÓN 20 6. REFERENCIAS 21 1. RESUMEN EJECUTIVO Se da a conocer la forma de implementación de redes virtuales en Packet Tracer, especificando características de los modelos y funcionalidades de cada dispositivo que en la plataforma se puede utilizar para montar redes. Posteriormente se presenta el Modelo OSI, donde se describe las funciones claras y específicas, de cada una de las capas existentes en el modelo...
Words: 3576 - Pages: 15
...Universidad Interamericana, Recinto de Guayama | Diseño de una Red Mediana | | Luis Lugo 16 de enero de 2013 | Introducción En este trabajo estaré diseñando una red mediana para un colegio técnico el cual contiene pocos estudiantes. Este diseño usa conmutadores en las capas 2 y 3 proveyendo servicios a usuarios y a la misma vez seguridad para toda la red. La organización tiene alrededor de 700 usuarios y existen diferentes dominios dentro de esta red. Diseño Este diseño debe tener varios requerimientos específicos para poder completar lo que es una red mediana segura. Uno de estos requerimientos y el mayor de estos es que la red debe de proveer conectividad para tres servidores y alrededor de 700 clientes. De la misma manera, la red va a permitir que si en alguna ocasión alguno de estos equipos necesita separarse el otro, esto sea posible. En esta red otro de los requerimientos importantes es el de evitar ataques, ya que como la red va a estar comunicándose entre dos edificios, esta es más susceptible a ataques que provengan de afuera. El centro o “core” de esta red es un solo conmutador de capa 3 con interfaz de “Ethernet” este conmutador “core” le provee los servicios de índole de ambas capas (2 y 3) hacia los equipos necesarios. La red tiene 4 sub redes diferentes, una de estas es para los servidores, otra para los clientes, otra para el sistema de red inalámbrico y la última para la administración. Se diseñó un NDIS para monitorear...
Words: 1290 - Pages: 6
...Computations 1. Using the following tree, name two vertices that are considered the following. Explain in your own words how you know: (a) parent-child (2 points). Answer: 202 - 401 Explanation: the parent of a vertex is the vertex connected to it on the path to the root, 202 is the parent and 401 is the child (b) sibling nodes (2 points): Answer: 301, 302, 303 Explanation: If two vertices are children of the same parent, then these two vertices are called siblings, 301, 302, 303 have the same parent that is 201 (c) leaf nodes (2 points) Answer: 301, 302, 303, 401 Explanation: the leaves are all terminal vertices 2. Determine if each of the following graphs is considered a tree. Explain why or why not, using what you learned in this unit. a. (2 points) Answer: not a tree Explanation: A tree is a connected graph with no cycles, and there is cycles in this graph b. (2 points) Answer: yes Explanation: A tree is a connected graph with no cycles, and there is no cycles in this graph c. (1 point) Answer: no Explanation: A tree is a connected graph with no cycles, and there a cycle in this graph 3. Determine and sketch two different spanning trees for this graph: a. (1 point) b. (1 point) 4. Consider this graph: a. Determine the total weight for this graph. Show your work. (1 point) Answer: 122 Explanation: 5 + 10 +5 +10 +17 +15 + 5 +4+4+8+5+6+13+7+8 b. Draw one spanning tree for this weighted graph and...
Words: 717 - Pages: 3
...are modular switches. New Cisco Catalyst 2960-C switches support PoE pass-through. They do not support an active switched virtual interface (SVI) with IOS versions prior to 15.x. _______________________________________________________________ 4 What are two functions of a router? (Choose two.) It manages the VLAN database. It increases the size of the broadcast domain. It determines the best path to send packets. It controls the flow of data via the use of Layer 2 addresses. It connects multiple IP networks. _______________________________________________________________ 5 Which technology is required when switched networks are designed to include redundant links? link aggregation virtual private networks virtual LANs Spanning Tree Protocol _______________________________________________________________ 6 What is a characteristic of in-band device management? It is used to monitor and make configuration...
Words: 861 - Pages: 4
...1. How often does RIP Broadcast updates? Every 30 seconds 2. Maximum Hops allowed in RIP? 15 3. What area is responsible for call failures? Inadequate switching processing 4. System recovery, software upgrades, routing information are the responsibility of the ? Central Processing System (or DTMF) 5. Link-state protocols limit changes by….? By segmenting the network into area hierarchies 6. Characteristics of OSPF. Hierarchical pen standard 7. Common problems with Bandwidth needed for signaling and calling? Single-Frequency (SF) Signaling 8. Problems associated with CAS A. inability to carry signaling messages with special feature information B. the need to turn off the robbed bit signaling function when transmitting high-speed data C. uses the trunk to carry the signaling information and eats up precious bandwidth 9. What message does RIP display in the debug output. Receiving a malformed packet 10. The command that shows packets sent and received show ip eigrp traffic 11. Four problems with VOIP. Choppiness Dead air Echo Talking over 12. MOS scores indicates what? 2 indicates the call is poor 13. Switching and bridging help bandwidth in what ways? Increases, dedicated 14. What OSI Layer are switches on? Layer 2 15. What connector terminates an 8 wire conductor? RJ-45 for ethernet / RJ-48 for T-1 16. How is refraction described? Core and cladding made of glass 17. What Layer of hierarchical...
Words: 521 - Pages: 3
...discussed problems that can occur if you have multiple links between bridges (switches) and how to solve these problems by using the Spanning Tree Protocol (STP). Finally, I covered detailed configuration of Cisco’s Catalyst switches, including verifying the configuration, setting the Cisco STP extensions, and changing the root bridge by setting a bridge priority. Exam Essentials Remember the three switch functions. Address learning, forward/filter decisions, and loop avoidance are the functions of a switch. Remember the command show mac address-table. The command show mac address-table will show you the forward/filter table used on the LAN switch. Understand the main purpose of the Spanning Tree Protocol in a switched LAN. The main purpose of STP is to prevent switching loops in a network with redundant switched paths. Remember the states of STP. The purpose of the blocking state is to prevent the use of looped paths. A port in listening state prepares to forward data frames without populating the MAC address table. A port in learning state populates the MAC address table but doesn’t forward data frames. A port in forwarding state sends and receives all data frames on the bridged port. Last, a port in the disabled state is virtually nonoperational. Remember the command show spanning-tree. You must be familiar with the command show spanning-tree and how to determine who the root bridge is. Written Lab 10 Write the answers to the following questions: 1. What command will...
Words: 2465 - Pages: 10
...Network Security Planning By: Marticia Goodwin CIS 532 / Professor Danielle Babb August 19, 2012 Strayer University SAFE is a reference architecture that network designers can use to simplify the complexity of a large internetwork in which the architecture lets you apply a modular approach to network design. Traditional point security tools are limited in their ability to support and securing a business transformation, either leaving critical new resources unprotected or preventing the deployment of new services as they do not secure new processes and protocols. At the same time, organizations are facing a host of new threats that target many of these new services and impact network and service availability (Lippis, 2012). With SAFE, you can analyze the functional, logical, and physical components of a network and thus simplify the process of designing an overall enterprise network, but CISCO SAFE architecture is especially concerned with security. SAFE takes a defense in-depth-approach in which multiple layers of protection are strategically located throughout the network and the layers are under unified strategy for protecting the entire network and the various components of the network, including individual network segments, infrastructure devices, network services, endpoints, and applications (Oppenheimer, 2011). SAFE architecture is comprised of the following major modules: core, data center, campus, management, WAN Edge, Internet Edge, branches, extranet, partner...
Words: 974 - Pages: 4
...Here is the complete list of the 21 Frame Relay configuration scenarios included in this package: 1. Frame-Relay Back-to-Back (no Frame Switch) 2. Frame-Relay Inverse-ARP 3. Frame-Relay Static Mapping 4. Frame-Relay Inverse-ARP & Static Mappings 5. Frame-Relay Multipoint Interfaces: Inverse-ARP 6. Frame-Relay Multipoint Interfaces: Static Mappings 7. Frame-Relay Multipoint Interfaces: Inverse-ARP & Static Mappings 8. Frame-Relay Point-to-Point (P-to-P) Subinterfaces 9. Frame-Relay P-to-P Subinterfaces and Main Interfaces: Inverse-ARP 10. Frame-Relay P-to-P Subinterfaces and Main Interfaces: Static Mappings 11. Frame-Relay P-to-P Subinterfaces and Multipoint Subinterfaces: Inverse-ARP 12. Frame-Relay P-to-P Subinterfaces and Multipoint Subinterfaces: Static Mapping 13. Frame-Relay Multipoint Subinterface, Inverse-ARP and Main Interface, Inverse-ARP 14. Frame-Relay Multipoint Subinterface, Inverse-ARP and Main Interface, Static Mapping 15. Frame-Relay Multipoint Subinterface, Static Mapping and Main Interface, Inverse-ARP 16. Frame-Relay Multipoint Subinterface, Static Mapping and Main Interface, Static Mapping 17. Frame-Relay Hub-and-Spoke, Main Interfaces with Inverse-ARP 18. Frame-Relay Hub-and-Spoke, Main Interfaces with Inverse-ARP & Static Mappings 19. Frame-Relay Hub-and-Spoke, Main Interfaces with Static Mappings 20. Frame-Relay Hub-and-Spoke, Main Interfaces with Inverse-ARP & P-2-P Subinterfaces 21. Frame-Relay Hub-and-Spoke,...
Words: 580 - Pages: 3
...WAN Implementation with SOHO Skills Configuration Prepared for: University of Maryland University College Prepared by: Nathan Poole Table of Contents I. Springfield Site Device and STP Configurations II. Worchester Site Subnetting Configurations III. Boston Site Routing Protocol, Route Summarization and Topology Improvements IV. Sacramento Site VLAN, Routing on a Stick (ROS) and DHCP Implementation V. Los Angeles Site Management Technologies VI. xACME WAN - WAN Implementation and Secure Communications VII. Bibliography WAN Implementation with SOHO Skills Configuration I. Springfield Site Device and STP Configurations Problem Statement: The device hostnames on each switch are generic and default. They do not match the network topology device hostnames as delivered with the network architecture. Each switch and router must have the correct hostname configured per device. Switch>en Switch#config t Enter configuration commands, one per line. End with CNTL/Z. Switch(config)#Hostname SpringfieldSwitch1 SpringfieldSwitch1(config)# Switch>en Switch#config t Enter configuration commands, one per line. End with CNTL/Z. Switch(config)#Hostname SpringfieldSwitch2 SpringfieldSwitch2(config)# Switch>en Switch#config t Enter configuration commands, one per line. End with CNTL/Z. Switch(config)#Hostname SpringfieldSwitch3 SpringfieldSwitch3(config)# Switch>en Switch#config t Enter configuration commands, one per line. End with CNTL/Z...
Words: 1180 - Pages: 5
...destination/consumer points. Location of the distribution and destination points described in their (x,y) co-ordinates. The measure of cost is the distance metric (length of the route). Output The output of the problem would be, which distribution center would serve which destination points and how the packet would be routed to minimize cost. Note: If the routes are represented as a graph then the graph would be a disconnected graph, depending on what destination nodes are served by which distribution center node. What is known? The general case of this problem, without any restrictions, can be modeled as Steiner Tree problem. It is a well known problem and its computation has been shown to be NPHard, by Garey, Graham and Johnson (1976). Approach In this analysis, I am considering the following 3 problems. 1. Multiple source Minimum Spanning Tree (M ST) 2. Multiple source Steiner Tree 3. Multiple source Traveling Salesman Problem (TSP) Multiple source TSP problem refers to the case where we have only one vehicle per distribution center, and it has to cover all the customers or destination points. The other two problems refer to the case where we have...
Words: 2950 - Pages: 12
...network? •Usable bandwidth is shared among all the devices connected to the LAN •ALL devices connected within a LAN can hear ALL the packets irrespective of whether the packet is meant for that device or not. It is possible for some unscrupulous node listening to data packets not meant for that. •Suppose, your organization has different departments. Using a traditional LAN, when any changes take place within the organization, physical cables and devices need to be moved to reorganize the LAN infrastructure. •A LAN cannot extend beyond its physical boundary across a WAN as in VLANs. Management is complex Possible problems in interoperability A VLAN cannot forward traffic to another VLAN (need a router to communicate 802.1D Spanning Tree Protocol (STP) has a drawback of slow convergence. 3. What mode must VTP is set on a switch in order to extend a VLAN definition? The mode is VTP Transparent Mode. The VTP Transparent mode is something between a...
Words: 848 - Pages: 4
...GREEDY ALGORITHM A greedy algorithm is a mathematical process that looks for simple, easy-to-implement solutions to complex, multi-step problems by deciding which next step will provide the most obvious benefit. Greedy algorithms are similar to dynamic programming algorithms in that the solutions are both efficient and optimal if the problem exhibits some particular sort of substructure. A greedy algorithm builds a solution by going one step at a time through the feasible solutions, applying a heuristic to determine the best choice. A heuristic applies an insight to solving the problem, such as always choose the largest, smallest, etc. Such algorithms are called greedy because while the optimal solution to each smaller instance will provide an immediate output, the algorithm doesn’t consider the larger problem as a whole. Once a decision has been made, it is never reconsidered. Greedy algorithms work by recursively constructing a set of objects from the smallest possible constituent parts. Recursion is an approach to problem solving in which the solution to a particular problem depends on solutions to smaller instances of the same problem. Advantages of greed algorithm * Always taking the best available choice is usually easy. * It usually requires sorting the choices. * Solutions to smaller instances of the problem can be straightforward and easy to understand. * Repeatedly taking the next available best choice is usually linear work. * But don't...
Words: 387 - Pages: 2
...VLAN Virtual Local Area Network Introduction: A VLAN (Virtual Local Network) is a network of computers that behave as though they are connected to the same wire even though physically they may be located on different segments of the LAN. VLAN are configured through software rather than hardware. This is a big advantage to VLAN because that makes it flexible and when moved physically it can stay on the same VLAN without any hardware configuration. (http://www.webopedia.com) A VLAN has three major functions: 1. Limited the size of broadcast domains. 2. Improves network performance. 3. Provides a level of security. VLAN Switched Port and Configuration: Using a switched VLAN will allow you to create groups of logically network devices that act as though they are on their own independent network. And this includes if they share a common infrastructure with other VLANs. When you configure a VLAN, you must sign it a number ID and you also have the option of name it. The purpose of VLAN implementations is to associate ports with particular VLANs. You configure the port to forward a frame to a specific VLAN. A port can be configured to support these VLAN types: Static VLAN, Dynamic VLAN, and, Voice VLAN. (http://www.orbit-computer-solutions.com) VLAN Trunking: VLAN trunking enables the movement of traffic to different parts of the network configured in a VLAN. A trunk is a point-to-point link between...
Words: 572 - Pages: 3
...Topic: Minimum Spanning Trees of Graph theory and its real life application into the tourism Industry. Abstract: My research question for this extended essay is: Minimum Spanning Trees of Graph theory and its real life application into the tourism Industry. The purpose of this research report is to show how some simple mathematical concepts can also be used as a tool for big scale applications. My extended essay opens up with an introduction on why this topic was chosen and my personal approach. Following the introduction, the next section gives background information about Graph Theory and narrowing down to the concepts of Trees. The research was then narrowed into the theory of Minimum Spanning Trees. 2 crucial algorithms for finding the Minimum Spanning Tree of a network, namely Kruskal’s Algorithm and Prim’s Algorithm were used. These algorithms are used to solve for the shortest path that visits each point at least once or a path of minimum cost, in a given set of vertices and edges. The application of these algorithms into the tourism industry of Singapore involved two different sets of networks, with vertices representing the different attractions. Each network contains 5 different attractions. Following which, raw data such as the distances between each and every attraction were collected before plotting the network. Both algorithms were then compared and contrasted in terms of their effectiveness and identify which is more preferable to be used, in terms of providing...
Words: 9581 - Pages: 39
...A Scalable Method for Multiagent Constraint Optimization Adrian Petcu and Boi Faltings {adrian.petcu, boi.faltings}@epfl.ch http://liawww.epfl.ch/ Artificial Intelligence Laboratory Ecole Polytechnique F´ d´ rale de Lausanne (EPFL) e e IN (Ecublens), CH-1015 Lausanne, Switzerland Abstract We present in this paper a new, complete method for distributed constraint optimization, based on dynamic programming. It is a utility propagation method, inspired by the sum-product algorithm, which is correct only for tree-shaped constraint networks. In this paper, we show how to extend that algorithm to arbitrary topologies using a pseudotree arrangement of the problem graph. Our algorithm requires a linear number of messages, whose maximal size depends on the induced width along the particular pseudotree chosen. We compare our algorithm with backtracking algorithms, and present experimental results. For some problem types we report orders of magnitude fewer messages, and the ability to deal with arbitrarily large problems. Our algorithm is formulated for optimization problems, but can be easily applied to satisfaction problems as well. 1 Introduction Distributed Constraint Satisfaction (DisCSP) was first studied by Yokoo [Yokoo et al., 1992] and has recently attracted increasing interest. In distributed constraint satisfaction each variable and constraint is owned by an agent. Systematic search algorithms for solving DisCSP are generally derived from depth-first search algorithms based on...
Words: 5452 - Pages: 22
