STATIC & DYNAMIC ROUTING

Jaringan banyak dibutuhkan oleh suatu perusahaan atau instansi dikarenakan dilihat dari segi keefektifan dan kefisiensianya. Maka dari itu penulis memilih judul " Pengembangan Jaringan Komputer Dengan Metode Static Routing pada Warnet TiazNet " dikarenakan kebutuhan warnet tersebut untuk mengembangkan jaringan dengan jangkauan yang lebih besar. Penyebab harusnya dilakukan pengembangan pada warnet tersebut ialah penggabungan 2 jaringan yang berbeda secara fisik yang dipisahkan oleh 2 tempat yang berbeda. Dan pada kasus ini penulis menggunakan topologi star untuk pengembangannya dimana 2 ruangan yang dipisahkan secara fisik tersebut sama sama menggunakan topologi star yang nantinya kedua jaringan tersebut digabungkan dengan router menggunakan metode static routing Pengimplementasiannya penulis menggunakan sebagian kecil dari fitur fitur yang ada pada aplikasi cisco packet tracer untuk membuat gambaran jaringan yang akan dikembangkan pada warnet tersebut. Penulis memilih aplikasi cisco packet tracer dalam pengembangan jaringan warnet TiazNet dikarenakan aplikasi ini lebih mudah digunakan dalam hal perancangan suatu topologi jaringan dan juga penempatan perangkat jaringan dapat diatur dan ditentukan dengan baik inilah keunggulan yang tidak semua aplikasi simulasi perancangan jaringan miliki.

Key : Static Routing, Simulasi Routing

In mobile ad hoc networks (MANETs), links are created and destroyed in an unpredictable way, which makes quite challenging the determination of routes between each pair of nodes. In this paper, we propose a formulation of the routing problem in multi-services MANETs, as well as the implementation of an adaptation of the dynamic source routing (DSR) protocol.

Apa itu Static Routing (router statik)?
Apa ciri-ciri Static Routing (router statik)?
Kelebihan dan Kekurangan Apa yang dimiliki Static Routing (router statik)?
Bagaimana Konfigurasi Static Routing (router statik) pada Cisco Packet Tracer?
temukan jawabannya pada modul ini, semoga bermanfaat tengkyu :)
Format File : PDF

Apa itu Dynamic Routing (router dinamis)?
Apa ciri-ciri Dynamic Routing (router dinamis)?
Kelebihan dan Kekurangan Apa yang dimiliki Dynamic Routing (router dinamis)?
Bagaimana Konfigurasi Dynamic Routing (router dinamis) pada Cisco Packet Tracer?
temukan jawabannya pada modul ini, semoga bermanfaat tengkyu :)
Format File : PDF
Support :  https://trakteer.id/herikarta/tip

Routing protocol adalah komunikasi antara router-router. Routing protocol mengijinkan routerrouter untuk sharing informasi tentang jaringan dan koneksi antar router. Yang salah satunya menggunakan RIP (Routing Information Protocol ),Merupakan IP routing dynamic untuk  Distance vector protocol – merawat daftar jarak tempuh ke network-network lain berdasarkan jumlah hop, yakni jumlah router yang harus lalui oleh paket-paket untuk mencapai address tujuan dan untuk RIP ini didalamnya mempunyai kelebihan dan kekurangannya.

... established. Zeleny (8) and Steuer (9) provide a thorough introduction to the theory of multiple-criteria decision making. ... decisions. List and Mirchandani (12) have done multiple-objective routing and siting for hazardous materials and waste. Turnquist ...

The performance of a distributed system is affected by the various functions of its components. The interaction between components such as network nodes, computer systems and system programs is examined with special interest accorded to its effect on system reliability. At affordable time and space costs, the analytic hierarchy process (AHP) is used to determine how the reliability of a distributed system may be controlled by appropriately assigning weights to its components. Illustrative case studies, that display the system structure, the assignment of weights and the AHP handling are presented.

In Wireless Sensor Network (WSN), the sensors have limitations like energy-constrained nodes, unreliable links, and frequent topology change. In this paper we are trying to propose a routing protocol, which gives better results than any other conventional protocols. The protocol based on Logical Network Abridgement (LNA), used to measure the underlying path diversity and intrinsic network resiliency to congestion, failures and attacks. The proposed protocol focuses on vulnerability index and energy awareness of the node. Using both analysis and extensive simulations, we show that the proposed dynamic routing help achieve the desired system performance under the dynamically changing network conditions.

The provision of very high data rates in a ubiquitous manner throughout the service area is a great challenge for 4G and beyond-4G wireless networks. Towards that end, the deployment of fixed relays by the operators has become an accepted radio access network concept in various standardization activities including LTE-A and 802.16j. It is envisaged that next-generation networks will comprise a plethora of wireless relay stations. Worthy of mention is the plug-and-play type of relay known as nomadic relay. We devise novel radio resource management (RRM) schemes to facilitate the operation of fixed relay stations (FRSs) and nomadic relay stations (NRSs) in OFDMA-based multicellular networks. Two schemes of different decentralization levels are devised and classified as distributed and semi-centralized. A novel user-based dynamic routing or link selection that significantly reduces the feedback overhead is employed. We develop methods by which the NRSs act autonomously to acquire radio resources without relying on a central entity. NRS operation is the same in the two schemes and can be extended to any other OFDMA-based RRM scheme. Through the asynchronous opportunistic medium access of the NRSs, smart and opportunistic intra-cell channel reuse is attained. This is different from the static intra-cell reuse patterns often adopted in literature. Furthermore, we introduce a method to enable the cooperation between an NRS and a serving FRS to assist a troubled wireless terminal (WT). We thus establish the concept of nomadic relay-augmented fixed relay networks. To the extent of our knowledge of the literature, no other work has undertaken this task so far.

A wireless sensor network consists of light-weight, low power, small size sensor nodes. Routing in wireless sensor networks is a demanding task. This demand has led to a number of routing protocols which efficiently utilize the limited resources available at the sensor nodes. Most of these protocols are either based on single hop routing or multi hop routing and typically find the minimum energy path without addressing other issues such as time delay in delivering a packet, load balancing, and redundancy of data. Response time is very critical in environment monitoring sensor networks where typically the sensors are stationary and transmit data to a base station or a sink node. In this paper a faster load balancing routing protocol based on location with a hybrid approach is proposed

Wavelength routed optical networks have emerged as a technology that can effectively utilize the enormous bandwidth of the optical fiber. Wavelength converters play an important role in enhancing the fiber utilization and reducing the overall call blocking probability of the network. Placement of wavelength converters is an NP-complete problem (K.C. Lee, V.O.K. Li, IEEE Journal of Lightwave Technology 11(5/6) (1993) 962–970) in an arbitrary mesh network. In this paper, new Integer Linear Program (ILP) formulations have been proposed for the static and dynamic routing and wavelength assignment problem to reduce the number of conversions. We use Genetic Algorithms (GAs) for placing limited range wavelength converters in arbitrary mesh wavelength routed optical networks. The objective is to achieve near optimal placement of full and limited range wavelength converters resulting in reduced blocking probabilities and low distortion of the optical signal. Certain heuristics are used to obtain starting solutions for the GAs to enable it to converge faster. The results obtained using GAs are compared with the heuristic method of placement. We study the range of loads for which converters are useful. We observe that limited range converters placed near optimally at a few nodes can provide almost the same blocking probability as full range wavelength converters placed at all the nodes and that increasing the number of converters yields only a marginal improvement in blocking probability. We also observe that uniform placement of converters can be adopted in ring networks at low offered loads. We study the effect of uniform placement at higher loads and suggest that when used with reservation in the routing algorithm, converters ensure fairness to all nodes. Simulations have been carried out on a 12-node ring network and 14-node NSFNET.

Dynamic routing of point-to-point connections in a waveband selective linear lightwave network is addressed. Linear lightwave networks are all optical networks in which only linear operations are performed on signals in a waveband selective manner. Special constraints arise because of the linearity in the linear lightwave network. The overall problem of finding a path satisfying all the routing constraints for point-to-point connections is shown to be very complex. Owing to the complexity, the overall routing problem is decomposed into several subproblems. In particular, given a request for a point-to-point connection a waveband is first chosen for the call. Two heuristics, MAXBAND which allocates the most used band to a call and another MINBAND (least used band) are studied. Then, the problem of routing in a given waveband is further divided into smaller subproblems of finding a path in the waveband, checking for feasibility of the path in the chosen waveband and channel allocation (within the waveband). For finding paths in a waveband, K-SP, BLOW-UP and MIN-INT algorithms are proposed. A recursive algorithm checks for feasibility of the path on the waveband. Two channel allocation schemes (within a single waveband) MIN and MAX are presented. Simulations show that using MAXBAND (waveband), MIN-INT (path on waveband) and MIN (channel within waveband) policies resulted in the best performance (least blocking)