R. Perlman, \Interconnections: Bridges, Routers, Switches, and Internetworking Protocols (2nd edition)," Addison-Wesley, 1999.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....LSAs are flooded only in the area, rather than the whole AS. ABRs flood internal LSAs to other areas as Summary LSAs. This scales flooding of LSAs. Also, routing among Backbone Routers happen based on address prefixes, which scales routing tables. More details about OSPF can be found in [19], 20] B. OSPF Optimizations We performed several optimizations to the OSPF part of ROSSNet in order to scale the simulation. So far, we have developed models for single area OSPF simulation. The OSPF messages can get fairly large (for example, in case of Database Description packet exchange ....

R. Perlman, Interconnections: Bridges, Routers, Switches, and Internetworking Protocols, Addison-Wesley, 1999.

....to highlight this advantage. However, one issue that is yet to be addressed in literature is the impact of IP subnets on cross domain MPLS over WDM routing. Subnets are a mechanism to reduce routing overheads of IP networks by grouping a set of addresses under a single subnet identifier [4] [5]. In turn, the routing protocols route to subnets and not to individual hosts. For example, an interface with address 10.3.2.1 24 is on the subnet 10.3.2.0 (i.e. a 24 bit subnet mask) A key restriction of the IP subnet model is that two routers can send packets via their connected interfaces if ....

R. Perlman, Interconnections: Bridges, Routers, Switches, and Internetworking Protocols. Addison-Wesley, 1999.

....its destination. The routing of the information is thus done locally, hop by hop. Routing decisions are independent of other decisions in the past and in other routers; however, they are based on network state and topology information that is exchanged among routers using BGP, IS IS or OSPF [148]. The network does not need to keep any state to operate, other than the routing tables. The forwarding mechanism is called store and forward because IP packets are completely received, stored in the router while being processed, and then transmitted. Additionally, packets may need to be buffered ....

Radia Perlman. Interconnections: Bridges, Routers, Switches, and Internetworking Protocols (2nd edition). Addison-Wesley, 1999.

....is a bipartite causality graph with host to host and end to end service failures at the tails and at the heads of the edges, respectively. The simulation study presented in this paper uses tree shaped network topologies, which result, for example, from the usage of the Spanning Tree Protocol [12] as the data link layer routing protocol. The usage of tree shaped topologies greatly simplifies their random generation, while it does not affect the validity of the results presented in this section. We focus on diagnosing Byzantine types of problems, for which the usage of a non deterministic ....

R. Perlman. Interconnections, Second Edition: Bridges, Routers, Switches, and Internetworking Protocols. Addison Wesley, 1999.

....nodes by adding bitmaps indicating repeated values in a multi bit node. Bitmap compression can reduce memory needs considerably, at the cost of a increased memory accesses per node to read the bitmaps. However, our wide word architecture provides us with a simple alternative first described in [18]. We can represent all the prefixes (and their corresponding pointers to other nodes) that lie within a multi bit trie node without expansion. Assuming a node fits in a wide word, the entire node can be read in one memory access and the destination address can be compared in parallel with all the ....

Radia Perlman. Interconnections: Bridges, Routers, Switches, and Internetworking Protocols. Addison-Wesley, 2nd edition, October 1999.

....a more conventional denialof service attack against their intended targets in any event probably without ever needing to subvert the routing system. 8. RELATED WORK There have been several pieces of work on making Internet routing protocols robust against attacks by malicious entities. Perlman [9, 10] presents an approach for sabotageproof routing. The key idea is to use robust ooding to distribute link state packets (LSPs) and the public keys of all nodes throughout the network. Robust data routing is then accomplished by having end hosts construct digitally signed source routes using ....

R. Perlman, \Interconnections: Bridges, Routers, Switches, and Internetworking Protocols", Addison-Wesley Professional Computing Series, Second edition, 1999.

....to highlight this advantage. However, one issue that is yet to be addressed in literature is the impact of IP subnets on cross domain MPLS over WDM routing. Subnets are a mechanism to reduce routing overheads of IP networks by grouping a set of addresses under a single subnet identifier [4] [5]. In turn, the routing protocols route to subnets and not to individual hosts. For example, an interface with address 10.3.2.1 24 is on the subnet 10.3.2.0 (i.e. a 24 bit subnet mask) A key restriction of the IP subnet model is that two routers can send packets via their connected interfaces if ....

R. Perlman, Interconnections: Bridges, Routers, Switches, and Internetworking Protocols. Addison-Wesley, 1999.

....concludes the paper. II. ROUTING LOOP EVOLUTION A router in today s Internet belongs to an AS (Autonomous System) and different ASs typically correspond to different administrative domains. Routing information within an AS is distributed via intra domain routing protocols such as OSPF and IS IS [2], 3] Routing information between ASs is distributed via inter domain routing protocols, of which BGP is the only currently deployed example [4] Finally, BGP is also used to propagate external routing information within an AS. When used for the former purpose, it is referred to as E BGP, and ....

R. Perlman. Interconnections: Bridges, Routers, Switches, and Internetworking Protocols. Addison-Wesley Professional Computing Series, 1999.

....reversing the edges of the dependency graph shows which entities may fail because of the failure of another entity [8] It may be observed that failure symptoms propagate along both dependency and impact graph edges. For example, layer two s ability to form a spanning tree (Spanning Tree Protocol [22]) depends on the quality of the Ethernet links connecting the bridges. Failure of one of these links necessitates the rebuilding of the spanning tree, i.e. the failure at the Ethernet Link layer caused the failure at the Spanning Tree layer. On the other hand, a spanning tree loop can increase ....

....Consider the configuration of network devices shown in the small customer segment depicted in Figure 3. This segment contains one back end database server (number 47) and three front end web servers (numbers 11, 12, and 13) The front end servers and back end server are connected through VLAN [22] 462 using network adapters 36, 39, 42, and 144 respectively. Front end servers receive requests from a load balancer (Network Dispatcher [7] via VLAN 461 using network adapters 35, 38, and 41. Front end Server 12 Front end Server 11 Front end Server 13 Back end Server 47 VLAN 461 NIC ....

R. Perlman. Interconnections, Second Edition: Bridges, Routers, Switches, and Internetworking Protocols. Addison Wesley, 1999.

....failure mode F j service function X is in failure mode F i , where F j F Y and F i FX . To model end to end services one needs to determine the set of host to host services on which an end to end service depends. Because of the dynamic routing protocols (such as Spanning Tree Protocol [26] in the data link layer or any dynamic routing protocol in the network layer) an end to end service may depend on different sets of host tohost services at different times. Current dependencies may be obtained using network management protocols such as SNMP [3] which provide the means to ....

.... C Bridge D H 1 H 2 Figure 2: a) Example bridge topology with the current spanning tree marked in bold; b) Dependency graph built based on the spanning tree in (a) Figure 2 presents a dependency graph for data link layer services in the network topology composed of four spanning tree bridges [26]. The current spanning tree is marked in bold lines. In the dependency graph, we distinguish between links, which provide bridge to bridge delivery service, and paths, which provide delivery service from the first to the last bridge on the packet route from the source node to the destination node. ....

[Article contains additional citation context not shown here]

R. Perlman. Interconnections, Second Edition: Bridges, Routers, Switches, and Internetworking Protocols. Addison Wesley, 1999.

....end to end services and host to host services are determined using routing information. There exists a bijective mapping of onto . The simulation study presented in this paper uses tree shaped network topologies, which result, for example, from the usage of the Spanning Tree Protocol [21] as the data link layer routing protocol. The usage of tree shaped topologies greatly simplifies their random generation, while not having any significant impact on the accuracy of the results presented in this section. We focus on diagnosing performance problems, e.g. excessive delay or high ....

R. Perlman, Interconnections, Second Edition: Bridges, Routers, Switches, and Internetworking Protocols, Addison Wesley, 1999.

....a tree manager is no worse than that of requiring a few RP routers in PIM SM or a bandwidth broker in DiffServ[6] This discussion has its root in debate regarding centralized vs. decentralized multicast. In practices, however, centralized approach is indeed adopted in multicast in ATM networks[22], and centralized tree calculation is one possibility proposed in an MPLS multicast traffic engineering proposal[21] B. Fault Tolerance of Bi directional Aggregated Multicast Tree In some applications (e.g. battlefield communications, distributed visualization and control, etc. it is ....

Radia Perlman. Interconnections: Bridges, Routers, Switches, and Internetworking Protocols. Addison-Wesley Publishing Company, 2nd edition, October 1999.

....a tree manager is no worse than that of requiring a few RP routers in PIM SM or a bandwidth broker in DiffServ[2] This discussion has its root in debate regarding centralized vs. decentralized multicast. In practices, however, centralized approach is indeed adopted in multicast in ATM networks[7], and centralized tree calculation is one possibility proposed in an MPLS multicast traffic engineering proposal[6] Another concern with this approach is membership dynamics. The problem aries when a new exit node is added but it is not covered by the current tree, or when an exit node leaves ....

Radia Perlman. Interconnections: Bridges, Routers, Switches, and Internetworking Protocols. Addison-Wesley Publishing Company, 2nd edition, October 1999.

....be forwarded, and which not. To a certain 5 extent administrative messages are comparable to the distance vectors that are exchanged by certain routing protocols: distance vector PDUs are only exchanged between neighbours, but the routing information within these PDUs may be used to inform others [10]. In order to avoid loops, servers won t propagate MIB item information originated by them, nor information that was already forwarded by them. The remainder of this chapter will explain which administrative messages exist (Section 4.1) how these messages are processed (Section 4.2) as well as ....

R. Perlman: Interconnections: Bridges, Routers, Switches, and Internetworking Protocols, Addison Wesley Professional Computing Series, ISBN: 0

....approach based on distance vector routing. We choose the link state and distance vector routing approaches for comparison because these are the primary approaches being considered by the industry today. There has been some work comparing the performance of these routing protocols for IP traffic [5]. In this article we investigate the performance of these approaches in a multiwavelength network. The rest of the article is organized as follows. In the next section we discuss dynamic routing and wavelength assignment algorithms for WDM networks. Then we review various signaling protocols for ....

R. Perlman, Interconnections, Second Edition: Bridges, Routers, Switches, and Internetworking Protocols, Addison Wesley Prof. Comp. Series, Oct. 1999, pp. 320--25.

....be forwarded, and which not. To a certain extent administrative messages are comparable to the distance vectors that are exchanged by certain routing protocols: distance vector PDUs are only exchanged between neighbours, but the routing information within these PDUs may be used to inform others [10]. In order to avoid loops, servers won t propagate MIB item information originated by them, nor information that was already forwarded by them. The remainder of this chapter will explain which administrative messages exist (Section 4.1) how these messages are processed (Section 4.2) as well as ....

R. Perlman: Interconnections: Bridges, Routers, Switches, and Internetworking Protocols, Addison Wesley Professional Computing Series, ISBN: 0

....most methods currently deployed in the Internet for routing in a network are designed to forward packets along shortest paths. Indeed, current interior routing protocols, such as OSPF, RIP, and IEGP, are based on this premise, as are many exterior routing protocols, such as BGP and EGP (e.g. see [5, 9]) The algorithms that form the basis of these protocols are not secure, however, and have even been compromised by routers that did not follow the respective protocols correctly. Fortunately, all network malfunctions resulting from faulty routers have to date been shown to be the result of ....

....can be achieved in the application layer or by using services in the IPSec protocol (which does not address routing security, just end to end message authentication and confidentiality) 1. 2 Prior Related Work Routing security was first studied in the seminal work of Perlman [8] see also [9]) who studied flooding and shortest path routing algorithms that are resilient to faulty routers. Here schemes are based on using a public key infrastructure where each router x is given a public key private key pair and must sign each message that originates from x. Likewise, in her schemes, any ....

R. Perlman. Interconnections, Second Edition: Bridges, Routers, Switches, and Internetworking Protocols. Addison-Wesley, Reading, MA, USA, 2000.

No context found.

R. Perlman, \Interconnections: Bridges, Routers, Switches, and Internetworking Protocols (2nd edition)," Addison-Wesley, 1999.

No context found.

R. Perlman, Interconnections: Bridges, Routers, Switches, and Internetworking Protocols, AddisonWesley, 1999.

No context found.

R. Perlman. Interconnections - Bridges, Routers, Switches, and Internetworking Protocols. Addison-Wesley, second edition, 1999.

No context found.

R. Perlman. Interconnections - Bridges, Routers, Switches, and Internetworking Protocols. Addison-Wesley, second edition, 1999.

No context found.

R. Perlman, Interconnections: Bridges, Routers, Switches, and Internetworking Protocols, Addison-Wesley Professional Computing Series, (Second Edition), ISBN: 02016.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC