The Experts below are selected from a list of 270 Experts worldwide ranked by ideXlab platform
K Suzuki - One of the best experts on this subject based on the ideXlab platform.
-
making qos aware multicast scalable in terms of link state advertisement
International Conference on Network Protocols, 2001Co-Authors: T Kato, S Ueno, S Mukaiyama, K SuzukiAbstract:Recently routing protocols for QoS aware multicast have been actively studied, but there are few studies focusing on the scalability of link state advertisement when the available bandwidth of a link is updated along with the QoS aware multicast tree construction. This paper proposes a new QoS aware multicast routing protocol that is scalable in terms of the link state advertisement exchange. Our protocol has the following features: (1) a multicast network is divided into domains, and the advertisement of information on links within a domain is limited within the domain; (2) among the border multicast routers, only the link state information of interdomain links is advertised, so that the number of link state advertisement messages is drastically reduced; (3) when a multicast tree spreads over multiple domains, the tree construction needs to be performed without information on links in other domains, and it is possible that the construction may fail. In order to cope with this problem, the crank back mechanism of tree construction is introduced. This paper describes the detailed procedures and the message formats of our protocol. It also describes the evaluation of the number of exchanged link state advertisement messages and shows that our protocol can reduce the number by the order of 1/(number of domains) compared with conventional protocols.
-
ICNP - Making QoS aware multicast scalable in terms of link state advertisement
Proceedings Ninth International Conference on Network Protocols. ICNP 2001, 1Co-Authors: T Kato, S Ueno, S Mukaiyama, K SuzukiAbstract:Recently routing protocols for QoS aware multicast have been actively studied, but there are few studies focusing on the scalability of link state advertisement when the available bandwidth of a link is updated along with the QoS aware multicast tree construction. This paper proposes a new QoS aware multicast routing protocol that is scalable in terms of the link state advertisement exchange. Our protocol has the following features: (1) a multicast network is divided into domains, and the advertisement of information on links within a domain is limited within the domain; (2) among the border multicast routers, only the link state information of interdomain links is advertised, so that the number of link state advertisement messages is drastically reduced; (3) when a multicast tree spreads over multiple domains, the tree construction needs to be performed without information on links in other domains, and it is possible that the construction may fail. In order to cope with this problem, the crank back mechanism of tree construction is introduced. This paper describes the detailed procedures and the message formats of our protocol. It also describes the evaluation of the number of exchanged link state advertisement messages and shows that our protocol can reduce the number by the order of 1/(number of domains) compared with conventional protocols.
T. Al-khasib - One of the best experts on this subject based on the ideXlab platform.
-
Performance of new link state advertisement mechanisms in routing protocols with traffic engineering extensions
IEEE Communications Magazine, 2004Co-Authors: Hussein Alnuweiri, L.y.k. Wong, T. Al-khasibAbstract:The prevalent use of best-effort topology driven IP routing protocols with shortest path calculations can often lead to serious imbalance of packet traffic distribution when least cost paths converge on the same set of links, leading to unacceptable delays or packet loss even in the presence of feasible paths over less utilized links. Recently proposed enhancements to common routing protocols are promising to overcome such shortcomings by providing the means to distribute link state information that is more pertinent to traffic engineering in routed networks. This article presents several key results on the performance of the recently proposed OSPF-TE, with particular emphasis on OSPF-TE protocol traffic overhead and the impact of new link state advertisement triggering mechanisms on traffic-engineered routing accuracy.
T Kato - One of the best experts on this subject based on the ideXlab platform.
-
making qos aware multicast scalable in terms of link state advertisement
International Conference on Network Protocols, 2001Co-Authors: T Kato, S Ueno, S Mukaiyama, K SuzukiAbstract:Recently routing protocols for QoS aware multicast have been actively studied, but there are few studies focusing on the scalability of link state advertisement when the available bandwidth of a link is updated along with the QoS aware multicast tree construction. This paper proposes a new QoS aware multicast routing protocol that is scalable in terms of the link state advertisement exchange. Our protocol has the following features: (1) a multicast network is divided into domains, and the advertisement of information on links within a domain is limited within the domain; (2) among the border multicast routers, only the link state information of interdomain links is advertised, so that the number of link state advertisement messages is drastically reduced; (3) when a multicast tree spreads over multiple domains, the tree construction needs to be performed without information on links in other domains, and it is possible that the construction may fail. In order to cope with this problem, the crank back mechanism of tree construction is introduced. This paper describes the detailed procedures and the message formats of our protocol. It also describes the evaluation of the number of exchanged link state advertisement messages and shows that our protocol can reduce the number by the order of 1/(number of domains) compared with conventional protocols.
-
ICNP - Making QoS aware multicast scalable in terms of link state advertisement
Proceedings Ninth International Conference on Network Protocols. ICNP 2001, 1Co-Authors: T Kato, S Ueno, S Mukaiyama, K SuzukiAbstract:Recently routing protocols for QoS aware multicast have been actively studied, but there are few studies focusing on the scalability of link state advertisement when the available bandwidth of a link is updated along with the QoS aware multicast tree construction. This paper proposes a new QoS aware multicast routing protocol that is scalable in terms of the link state advertisement exchange. Our protocol has the following features: (1) a multicast network is divided into domains, and the advertisement of information on links within a domain is limited within the domain; (2) among the border multicast routers, only the link state information of interdomain links is advertised, so that the number of link state advertisement messages is drastically reduced; (3) when a multicast tree spreads over multiple domains, the tree construction needs to be performed without information on links in other domains, and it is possible that the construction may fail. In order to cope with this problem, the crank back mechanism of tree construction is introduced. This paper describes the detailed procedures and the message formats of our protocol. It also describes the evaluation of the number of exchanged link state advertisement messages and shows that our protocol can reduce the number by the order of 1/(number of domains) compared with conventional protocols.
Acee Lindem - One of the best experts on this subject based on the ideXlab platform.
-
OSPFv3 link state advertisement (LSA) Extensibility
2018Co-Authors: Fred Baker, Acee Lindem, Dirk Goethals, Abhay Roy, Veerendranatha VallemAbstract:OSPFv3 requires functional extension beyond what can readily be done with the fixed-format link state advertisement (LSA) as described in RFC 5340. Without LSA extension, attributes associated with OSPFv3 links and advertised IPv6 prefixes must be advertised in separate LSAs and correlated to the fixed-format LSAs. This document extends the LSA format by encoding the existing OSPFv3 LSA information in Type-Length- Value (TLV) tuples and allowing advertisement of additional information with additional TLVs. Backward-compatibility mechanisms are also described. This document updates RFC 5340, "OSPF for IPv6", and RFC 5838, "Support of Address Families in OSPFv3", by providing TLV-based encodings for the base OSPFv3 unicast support and OSPFv3 address family support.
-
OSPF Extensions for Flow Specification
2015Co-Authors: Wu Nan, Keyur Patel, Peng Fan, Jianjie You, Qiandeng Liang, Acee LindemAbstract:Dissemination of the Traffic flow information was first introduced in the BGP protocol [RFC5575]. FlowSpec routes are used to distribute traffic filtering rules that are used to filter Denial-of-Service (DoS) attacks. For the networks that only deploy an IGP (Interior Gateway Protocol) (e.g., OSPF), it is required that the IGP is extended to distribute Flow Specification or FlowSpec routes. This document discusses the use cases for distributing flow specification (FlowSpec) routes using OSPF. Furthermore, this document defines a OSPF FlowSpec Opaque link state advertisement (LSA) encoding format that can be used to distribute FlowSpec routes, its validation procedures for imposing the filtering information on the routers, and a capability to indicate the support of FlowSpec functionality.
-
Network Working Group Internet-Draft Intended status: Standards Track
2014Co-Authors: Acee Lindem, Fred Baker, Abhay Roy, S. Mirtorabi, Ospfv Lsa ExtendibilityAbstract:draft-acee-ospfv3-lsa-extend-02.txt OSPFv3 requires functional extension beyond what can readily be done with the fixed-format link state advertisement (LSA) as described in RFC 5340. Without LSA extension, attributes associated with OSPFv3 links and advertised IPv6 prefixes must be advertised in separate LSAs and correlated to the fixed-format LSA. This document extends the LSA format by allowing the optional inclusion of Type-Length-Value (TLV) tuples in the LSAs. Backward compatibility mechanisms are also described. Status of this Memo This Internet-Draft is submitted in full conformance with the provisions of BCP 78 and BCP 79. Internet-Drafts are working documents of the Internet Engineering Task Force (IETF). Note that other groups may also distribute working documents as Internet-Drafts. The list of current Internet-Drafts is a
-
OSPFv3 LSA Extendibility
2013Co-Authors: Fred Baker, Acee Lindem, Dirk Goethals, Abhay Roy, Veerendranatha VallemAbstract:OSPFv3 requires functional extension beyond what can readily be done with the fixed-format link state advertisement (LSA) as described in RFC 5340. Without LSA extension, attributes associated with OSPFv3 links and advertised IPv6 prefixes must be advertised in separate LSAs and correlated to the fixed-format LSA. This document extends the LSA format by allowing the optional inclusion of Type-Length- Value (TLV) tuples in the LSAs. Backward compatibility mechanisms are also described.
-
Extensions to OSPF for Advertising Optional Router Capabilities
2007Co-Authors: Scott Shaffer, Acee Lindem, Naiming Shen, Rahul AggarwalAbstract:It is useful for routers in an OSPFv2 or OSPFv3 routing domain to know the capabilities of their neighbors and other routers in the routing domain. This document proposes extensions to OSPFv2 and OSPFv3 for advertising optional router capabilities. A new Router Information (RI) link state advertisement (LSA) is proposed for this purpose. In OSPFv2, the RI LSA will be implemented with a new opaque LSA type ID. In OSPFv3, the RI LSA will be implemented with a new LSA type function code. In both protocols, the RI LSA can be advertised at any of the defined flooding scopes (link, area, or autonomous system (AS)). [STANDARDS-TRACK]
Lathifah Fatharani - One of the best experts on this subject based on the ideXlab platform.
-
ANALISIS PERBANDINGAN link state advertisement (LSA) TRAFFIC PADA OSPFV3 SINGLE AREA DAN MULTI AREA
[Yogyakarta] : Universitas Gadjah Mada, 2014Co-Authors: Lathifah Fatharani, Sri Suning Kusumawardani, S.t. M.t.Abstract:Exhaustion of IPv4 address made a new addressing mechanism called IPv6. Those new mechanism also made new routing protocol, for example: OSPFv3. OSPFv3 is well-known and scalable routing protocol. Router in OSPFv3 use link state advertisement (LSA) to communicate with each other. But, if the topology getting large, it can cause enormous LSA flooding and make convergence time more slowly. OSPFv3 with multiple area (multi area) topology is designed to overcome those problem. This research will consider LSA traffic when the topology is configured in single area and multi area. The result is reduction of LSA number. Number of LSA reduction for an internal router which has non-summarized Area Border Router (ABR) is 37,93%. While number of LSA reduction for an internal router which has summarized ABR is 68,1%. It is proved that OSPFv3 multi area topology can reduce the number of LSA traffic
-
ANALISIS PERBANDINGAN link state advertisement (LSA) TRAFFIC PADA OSPFV3 SINGLE AREA DAN MULTI AREA
2014Co-Authors: Lathifah Fatharani, S.t. Sri Suning KusumawardaniAbstract:Mulai terbatasnya jumlah alamat IPv4 menyebabkan munculnya mekanisme pengalamatan baru dengan IPv6. Adanya sistem pengalamatan baru tersebut juga memunculkan protokol routing baru, salah satunya adalah OSPFv3. OSPFv3 ini dikenal sebagai protokol routing yang handal. Dalam berkomunikasi, router saling mempertukarkan link state advertisement (LSA). Namun, apabila topologi yang dirancang semakin besar, akan menimbulkan LSA flooding yang tidak terkendali dan berefek pada lamanya waktu konvergensi. Untuk mengatasi masalah tersebut, dirancang topologi OSPFv3 yang dikonfigurasi dengan banyak area (multi area). Penulis akan membandingkan LSA traffic ketika topologi dikonfigurasi dengan hanya OSPFv3 single area saja dan dikonfigurasi dengan OSPFv3 multi area. Dari penelitian ini didapatkan hasil penurunan jumlah LSA. Untuk internal router yang ABR-nya tidak melakukan summarize, penurunan LSA sebesar 37,93%. Sedangkan untuk internal router yang ABR-nya melakukan summarize, penurunan LSA sebesar 68,1%. Terbukti dengan topologi multi area dapat mengurangi jumlah LSA traffic pada OSPFv3. Exhaustion of IPv4 address made a new addressing mechanism called IPv6. Those new mechanism also made new routing protocol, for example: OSPFv3. OSPFv3 is well-known and scalable routing protocol. Router in OSPFv3 use link state advertisement (LSA) to communicate with each other. But, if the topology getting large, it can cause enormous LSA flooding and make convergence time more slowly. OSPFv3 with multiple area (multi area) topology is designed to overcome those problem. This research will consider LSA traffic when the topology is configured in single area and multi area. The result is reduction of LSA number. Number of LSA reduction for an internal router which has non-summarized Area Border Router (ABR) is 37,93%. While number of LSA reduction for an internal router which has summarized ABR is 68,1%. It is proved that OSPFv3 multi area topology can reduce the number of LSA traffic.
