...CALL ROUTING IN TELEPHONE NETWORKS INTRODUCTION ROUTING is a process of finding a path from a source to every destination in the network. A routing protocol sets up a routing table in routers and switch controllers. A node makes a local choice depending on global topology Telephone calls must be routed across a network of multiple exchanges, potentially owned by different telephone carriers. The exchanges are all connected using trunks. Each exchange has many "neighbours", some of which are also owned by the same telephone operator, and some of which are owned by different operators. When neighbouring exchanges are owned by different operators, they are known as interconnect points. This means that there is really only one virtual network in the world that enables any phone to call any other phone. This virtual network comprises many interconnected operators, each with their own exchange network. Every operator can then route calls directly to their own customers, or pass them on to another operator if the call is not for one of their customers. Call Routing When a call is received by an exchange, there are two treatments that may be applied: • Either the destination terminal is directly connected to that exchange, in which case the call is placed down that connection and the destination terminal rings. • Or the call must be placed to one of the neighboring exchanges through a connecting trunk for onward routing. Each exchange in the chain uses pre-computed routing...
Words: 820 - Pages: 4
...Linux Advanced Routing & Traffic Control HOWTO Bert Hubert Netherlabs BV Gregory Maxwell Remco van Mook Martijn van Oosterhout Paul B Schroeder Jasper Spaans Revision History Revision 1.1 DocBook Edition 2002−07−22 A very hands−on approach to iproute2, traffic shaping and a bit of netfilter. Linux Advanced Routing & Traffic Control HOWTO Table of Contents Chapter 1. Dedication.........................................................................................................................................1 Chapter 2. Introduction ......................................................................................................................................2 2.1. Disclaimer & License.......................................................................................................................2 2.2. Prior knowledge................................................................................................................................2 2.3. What Linux can do for you...............................................................................................................3 2.4. Housekeeping notes..........................................................................................................................3 2.5. Access, CVS & submitting updates..................................................................................................3 2.6. Mailing list..............................................
Words: 28706 - Pages: 115
...American International University–Bangladesh Continuing Education Center (CEC) 02 8816173 Ext 406 www.cec.aiub.edu CCNA Routing and Switching Course Outline CCENT Introduction to Networks Routing & Switching Essentials Scaling Networks Connecting Networks CCNA CCNA 1 – Introduction to Networks This course introduces the architecture, structure, functions, components, and models of the Internet and other computer networks. The principles and structure of IP addressing and the fundamentals of Ethernet concepts, media, and operations are introduced to provide a foundation for the curriculum. By the end of the course, students will be able to build simple LANs, perform basic configurations for routers and switches, and implement IP addressing schemes. Chapter 1 2 3 4 5 6 7 8 9 10 11 Topic Exploring the Network Configuring a Network Operating System Network Protocols and Communications Network Access Ethernet Network Layer Transport Layer IP Addressing Subnetting IP Networks Application Layer It’s a Network Students who complete Introduction to Networks will be able to perform the following functions: Understand and describe the devices and services used to support communications in data networks and the Internet Understand and describe the role of protocol layers in data networks Understand and describe the importance of addressing and naming schemes at various layers of data networks in IPv4 and IPv6 environments Design, calculate, and apply subnet...
Words: 1022 - Pages: 5
...for Traffic Routing Robert Collazo Rasmussen College Author Note This research is being submitted on August 30, 2013, for Christine Stagnetto-Zweig’s N235/CET2629 Section 02 Cisco Networking Fundamentals and Routing course. OSPF for Traffic Routing The OSPF dynamic routing protocol is probably the most popular LAN routing protocol today. OSPF can scale to the largest LANs but can also start out small. With OSPF, every router has its own unique "picture" (topology map) of the network. Routers use "HELLO" packets to periodically check with routers to ensure they are still there. Every router in OSPF is identified with a "router ID". The router ID can be manually entered or OSPF will automatically choose the IP address with the highest number. To configure OSPF, Set the bandwidth on your interfaces using the bandwidth command Router (config-if)# bandwidth XX (where XX signifies the bandwidth of the WAN connection). Router (config)# router ospf {process-ID#} Next, instruct the router to advertise the networks that are directly linked to it by entering network statements with the area ID number for that network, Router (config-router)# network {X.X.X.X} {Y.Y.Y.Y} area {z} X.X.X.X = Network ID of Network Y.Y.Y.Y = the wildcard mask for the network (the wildcard mask is the inverse mask of the subnet mask). Z = the area ID number (For small networks, this can always be zero (0) but for larger networks, the area IDs need to be properly planned as all routing updates must...
Words: 347 - Pages: 2
...EIGRP and OSPF Comparison For Client Sponsor Prepared By Scott Hogg Project Number 02 Date March 14, 2002 |Distribution List | |Name |Title/Duties |Company | |John Vogt-Nilsen |Manager – Network Operations | | |Sammy Hutton |Principal Systems Analyst | | |Scott Hogg |Principal Consultant |Lucent | |Phil Colon |Managing Consultant |Lucent | |Revision History | |Version |Date |Author |Comments | |1.0 |03/14/2002 |Scott Hogg |Initial Draft | | | | | | |...
Words: 8531 - Pages: 35
...OPTIMAL PACKET ROUTING Abstract- The optimal routing is the determination of the optimal routing policy that is the set of routes on which packets need to be transmitted in order to reduce the delay, cost and throughput. The routing optimization problem is an important tool in the optimization of both the operational capabilities and the design of large scale commuter communications networks. Resource requirements are not taken into account for conventional routing algorithms. The problem of finding optimal routes in a packet switched computer can be done using non linear multi commodity flow problem. The mathematical programming technique which is applied for the solution of routing problem for large networks is inefficient output. By using Heuristic methods satisfactory results can be obtained. But using Heuristic technique the results are not always optimal and may have some limitations. To overcome all this we can use decomposition method which is very efficient for computation and results are nearly exact. Introduction- Routers are basically classified into two types- Oblivious and Adaptive. In oblivious routing the path is completely determined by the sources and destination. Whereas Deterministic routing is the same path is chosen between a source and destination. The nature of deterministic routing is distributed that is each node makes its routing decisions independent of others which make routing simple and fast and this is widely used in most of the networks...
Words: 1064 - Pages: 5
...Routing in Wireless Sensor Networks: application on Fire Detection Abstract: this paper is about fire detection in building using a modified APTEEN routing protocol. Here we design a system called iFireControl which is a smart detection system for buildings, which is more water efficient than many current systems, while keeping its robustness. introduction A Wireless Sensor network (WSN) consists of spatially distributed autonomous sensors to monitor physical or environmental conditions, such as temperature, sound, vibration, pressure, motion or pollutants and to cooperatively pass their data through the network to a main location. The more modern networks are bi-directional, also enabling control of sensors activity. The development of wireless sensor networks was motivated by military applications such as battlefield surveillance; nowadays such networks are used in many industrial and consumer applications, such as industrial process monitoring and control, machine health monitoring, Agriculture, Area Monitoring, Smart Home Monitoring, Seismic Monitoring etc. Wireless Sensor Networks provide a bridge between the real physical and virtual worlds; allow the ability to observe the previously unobservable at a fine resolution over large spatio-temporal scales. The WSN is built of “nodes” from a few to several hundreds or even thousands, where each node is connected to one (or sometimes several) sensors. Each such sensor network node has typically several parts: a...
Words: 4845 - Pages: 20
...EIGRP and OSPF Comparison For Client Sponsor Prepared By Scott Hogg Project Number 02 Date March 14, 2002 |Distribution List | |Name |Title/Duties |Company | |John Vogt-Nilsen |Manager – Network Operations | | |Sammy Hutton |Principal Systems Analyst | | |Scott Hogg |Principal Consultant |Lucent | |Phil Colon |Managing Consultant |Lucent | |Revision History | |Version |Date |Author |Comments | |1.0 |03/14/2002 |Scott Hogg |Initial Draft | | | | | | |...
Words: 8531 - Pages: 35
...for Traffic Routing Robert Collazo Rasmussen College Author Note This research is being submitted on August 30, 2013, for Christine Stagnetto-Zweig’s N235/CET2629 Section 02 Cisco Networking Fundamentals and Routing course. OSPF for Traffic Routing The OSPF dynamic routing protocol is probably the most popular LAN routing protocol today. OSPF can scale to the largest LANs but can also start out small. With OSPF, every router has its own unique "picture" (topology map) of the network. Routers use "HELLO" packets to periodically check with routers to ensure they are still there. Every router in OSPF is identified with a "router ID". The router ID can be manually entered or OSPF will automatically choose the IP address with the highest number. To configure OSPF, Set the bandwidth on your interfaces using the bandwidth command Router (config-if)# bandwidth XX (where XX signifies the bandwidth of the WAN connection). Router (config)# router ospf {process-ID#} Next, instruct the router to advertise the networks that are directly linked to it by entering network statements with the area ID number for that network, Router (config-router)# network {X.X.X.X} {Y.Y.Y.Y} area {z} X.X.X.X = Network ID of Network Y.Y.Y.Y = the wildcard mask for the network (the wildcard mask is the inverse mask of the subnet mask). Z = the area ID number (For small networks, this can always be zero (0) but for larger networks, the area IDs need to be properly planned as all routing updates must...
Words: 374 - Pages: 2
...©2010 International Journal of Computer Applications (0975 - 8887) Volume 1 – No. 17 Routing Approaches in Delay Tolerant Networks: A Survey R. J. D'Souza National Institute of Technology Karnataka, Surathkal, India Johny Jose National Institute of Technology Karnataka, Surathkal, India ABSTRACT Delay Tolerant Networks (DTNs) have evolved from Mobile Ad Hoc Networks (MANET). It is a network, where contemporaneous connectivity among all nodes doesn’t exist. This leads to the problem of how to route a packet from one node to another, in such a network. This problem becomes more complex, when the node mobility also is considered. The researchers have attempted to address this issue for over a decade. They have found that communication is possible in such a challenged network. The design of routing protocol for such networks is an important issue. This work surveys the literature and classifies the various routing approaches. discontinuity in the network. There are also methods that have employed additional mobile nodes, to provide better message delivery. Researchers are even exploring how the social interaction of humans can be utilized for routing in a DTN. This survey has made an extensive study of the various routing strategies taken by the researchers in the past few years. We have classified them based on the type of knowledge used for routing. 2. FLOODING BASED APPROACHES Knowledge about the network helps in deciding the best next hop. It can happen that the...
Words: 6818 - Pages: 28
...Dynamic Source Routing (DSR) DSR was first introduced and described by David B. Johnson, David A. Maltz and Josh Broch in 1994. The protocol is specifically designed for use in multi-hop wireless ad hoc networks. The protocol does not require any existing network infrastructure or administration and is completely self-organizing and self-configuring. The protocol basically consists of the two mechanisms: Route Discovery and Route Maintenance, where the Route Discovery mechanism handles establishment of routes and the Route Maintenance mechanism keeps route information updated. Assumptions Some assumptions concerning the behavior of the nodes that participate in the ad hoc network are made. The most important assumptions are the following: A1. All nodes that participate in the network are willing to participate fully in the protocols of the network. A2. The diameter of an ad hoc network is the minimum number of hops necessary for a packet to reach from any node located at one extreme edge of the ad hoc network to another node located at the opposite extreme. We assume that this diameter will often be small (e.g., perhaps 5 or 10 hops), but it may often be greater than 1. A3. Nodes can detect the error through a standard link-layer checksum or Cyclic Redundancy Check (CRC), and discard corrupted packages . A4. The speed at which nodes move is moderate with respect to packet transmission latency and wireless transmission range of the particular underlying network hardware...
Words: 1841 - Pages: 8
...Stochastic Vehicle Routing Problem with Restocking Professor : O.Univ.Prof.Dr. Richard Hartl Vienna,2014 Student: Shkodran Ahmeti 0851254 Table of contents Table of contents List of figures 1.Introduction 1.2. Problem Presentation 2. Stochastic Vehicle Routing Problem With Optimal Restocking 3. Single Vehicle Routing Problem 4. Multiple Vehicle Routing 4.1. Heuristic Algorithms 4.1.1. Route-First-Cluster-Next Heuristic Algorithm 4.1.2. Cluster-First- Route- Second Algorithm 4.1.3. Improving the Heuristic Solution 5. Computational Study and Results 5.1. Set – partitioning problem formulation 5.2.Test of Algorithms over Problem Sizes and Expected Route Length Limits 5.3. Comparison of the Algorithms over Demand Variations 5.4. Comparison with a Deterministic Method 6. Summary References List of figures Figure 1 A desired truck route with restocking action of returning to the depot when a stockout occurs or in anticipation of a stockout Figure 2 The two updating Strategies a and b Figure 3 Defined or particular route of a single vehicle Figure 4 Expected costs of going directly to the next node Figure 5 Expected costs of the restocking action Figure 6 Monotonicity of function fj(q) Figure 7 Choosing the unused vehicle Figure 8 Forming the clusters Figure 9 Routing through the clusters Figure 10 Cyclic transfer Figure 11 String cross Figure 12 String exchange Figure 13 String relocation ABSTRACT This paper presents a Stochastic Vehicle Routing Problem SVRP, where...
Words: 5634 - Pages: 23
...2013 Implementation and Evaluation of Wireless Mesh Networks on MANET Routing Protocols Shashi Bhushan1,Anil Saroliya2 ,Vijander Singh3 Research Scholar, Computer Science, Amity University, Jaipur, India 1 Assistant Professor, Computer Science, Amity University, Jaipur, India 2 Senior Lecturer, Computer Science, Amity University, Jaipur, India 3 Abstract—Wireless Mesh Network (WMN) is a kind of network which is made up of Mesh router and Mesh clients where Mesh router having lesser mobility and form the heart of WMNs. In this paper, Wireless Mesh Network over MANET implemented using routing protocols such as AODV, DSR. In this work NS-2.34 simulator is used for simulations. Various measurements and calculations were figure out in this work like throughput, Average end-end delay, PDR, NRL and Routing packets in Random way point mobility model. WMN have features such as self configuration, self healing and low cost of equipment. This work specifically aims to study the performance of routing protocols in a wireless mesh network, where static mesh routers and mobile clients participate together to implement networks functionality such as routing and packet forwarding in different mobility scenarios Keywords- Ad hoc Network, Routing Protocols, Wireless Mesh Network, Performance, Throughput, PDR, NRL and Routing packets in Random way point mobility model, Simulation on Network simulator NS-2, AODV,DSR , Routing Overhead. I. INTRODUCTION A Mobile Ad-hoc network (MANET) is an autonomous...
Words: 4335 - Pages: 18
...A Distributed Joint Channel-Assignment, Scheduling and Routing Algorithm for Multi-Channel Ad Hoc Wireless Networks Xiaojun Lin and Shahzada Rasool School of Electrical and Computer Engineering, Purdue University West Lafayette, IN 47907, U.S.A. {linx,srasool}@ecn.purdue.edu Abstract— The capacity of ad hoc wireless networks can be substantially increased by equipping each network node with multiple radio interfaces that can operate on multiple non-overlapping channels. However, new scheduling, channelassignment, and routing algorithms are required to fully utilize the increased bandwidth in multi-channel multi-radio ad hoc networks. In this paper, we develop a fully distributed algorithm that jointly solves the channel-assignment, scheduling and routing problem. Our algorithm is an online algorithm, i.e., it does not require prior information on the offered load to the network, and can adapt automatically to the changes in the network topology and offered load. We show that our algorithm is provably efficient. That is, even compared with the optimal centralized and offline algorithm, our proposed distributed algorithm can achieve a provable fraction of the maximum system capacity. Further, the achievable fraction that we can guarantee is larger than that of some other comparable algorithms in the literature. I. I NTRODUCTION Multi-channel multi-radio ad hoc wireless networks have recently received a substantial amount of interest, especially under...
Words: 8961 - Pages: 36
...Impact of MAC Layer on the Performance of ODMRP, Fisheye, AODV and DSR, Routing Protocols in Mobile Ad hoc Networks A. Sravani, G. Srinu, and A.Venkataramana Abstract— Mobile Ad hoc Network is an emerging area. Its standards are defined by IETF. MANET is a self generated, self organized and self handled network consisting of collection of independent nodes. MANETs Presents several desirable properties like dynamic topology, Easy of deployment and robustness, which are qualify them as an attractive topic for the research community. Providing QoS routing is a major issue in MANETs. Media Access Control layer plays crucial role in Ad hoc networks. Several routing protocols have already been proposed for MANETs. This paper describes the impact of MAC layer protocols like 802.11 and CSMA on the various routing protocols like AODV, DSR, ODMRP and Fisheye. Numbers of simulation scenarios were carried out by using Glomosim-2.03. The QoS parameters used are Throughput, Delay and PDR. Simulation results found that AODV performs better in 802.11 and CSMA, DSR and ODMRP performs better in only under 802.11. Keywords— MANET, AODV, DSR, FSR, GloMoSim, ODMRP I. INTRODUCTION Wireless communication networks are basically two types as shown in Fig.1. One is infrastructure based and other one is infrastructure less. Infrastructure based is cellular communications whereas infrastructure less is ad hoc networks. Fig.1 Classification of wireless communication networks A. Cellular...
Words: 2917 - Pages: 12