20,867 research outputs found

    Selective Flooding for Better QoS Routing

    Get PDF
    Quality-of-service (QoS) requirements for the timely delivery of real-time multimedia raise new challenges for the networking world. A key component of QoS is QoS routing which allows the selection of network routes with sufficient resources for requested QoS parameters. Several techniques have been proposed in the literature to compute QoS routes, most of which require dynamic update of link-state information across the Internet. Given the growing size of the Internet, it is becoming increasingly difficult to gather up-to-date state information in a dynamic environment. We propose a new technique to compute QoS routes on the Internet in a fast and efficient manner without any need for dynamic updates. Our method, known as Selective Flooding, checks the state of the links on a set of pre-computed routes from the source to the destination in parallel and based on this information computes the best route and then reserves resources. We implemented Selective Flooding on a QoS routing simulator and evaluated the performance of Selective Flooding compared to source routing for a variety of network parameters. We find Selective Flooding consistently outperforms source routing in terms of call-blocking rate and outperforms source routing in terms of network overhead for some network conditions. The contributions of this thesis include the design of a new QoS routing algorithm, Selective Flooding, extensive evaluation of Selective Flooding under a variety of network conditions and a working simulation model for future research

    QoS multicast tree construction in IP/DWDM optical internet by bio-inspired algorithms

    Get PDF
    Copyright @ Elsevier Ltd. All rights reserved.In this paper, two bio-inspired Quality of Service (QoS) multicast algorithms are proposed in IP over dense wavelength division multiplexing (DWDM) optical Internet. Given a QoS multicast request and the delay interval required by the application, both algorithms are able to find a flexible QoS-based cost suboptimal routing tree. They first construct the multicast trees based on ant colony optimization and artificial immune algorithm, respectively. Then a dedicated wavelength assignment algorithm is proposed to assign wavelengths to the trees aiming to minimize the delay of the wavelength conversion. In both algorithms, multicast routing and wavelength assignment are integrated into a single process. Therefore, they can find the multicast trees on which the least wavelength conversion delay is achieved. Load balance is also considered in both algorithms. Simulation results show that these two bio-inspired algorithms can construct high performance QoS routing trees for multicast applications in IP/DWDM optical Internet.This work was supported in part ny the Program for New Century Excellent Talents in University, the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/1, the National Natural Science Foundation of China under Grant no. 60673159 and 70671020, the National High-Tech Reasearch and Development Plan of China under Grant no. 2007AA041201, and the Specialized Research Fund for the Doctoral Program of Higher Education under Grant no. 20070145017

    ANALISA PERBANDINGAN PENGARUH ROUTING PROTOCOL IPV4 DENGAN IPV6 STUDI KASUS JARINGAN DATA PT.PERTAMINA RU II DUMAI

    Get PDF
    The use of data networks increased significantly, both for industry, education, and personal needs. With the development of network usage, it is necessary to also develop system addressing and routing. Users Addressing cannot be fulfilled with the number of IPv4 (Internet Protocol Version 4).IETF (Internet Engineering Task Force) presented a new addressing standard called IPv6 (Internet Protocol version 6), which is intended also to meet the need for an IP address. In this research has been analyzed the process of routing RIPv1, RIPv2, RIPng between IPv4 and IPv6 on Network Data of PT. Pertamina RU II Dumai. Parameters that tested in the form of QoS(Quality of Service). The research was conducted using GNS3 and wireshark software. The results ofresearch showed that the routing protocol RIPng average delay smaller 19.4% than RIPv2 and smaller 28.5% than RIPv1 , The rounting protocol RIPng packet loss is smaller 5.2% than the RIPv2 and 20.3% smaller than the RIPv1 . The QoS of routing protocols RIPng in IPv6 is better than RIPv1 and RIPv2 in IPv4. Routing protocol RIPng using IPv6 have better traffic management compared with the routing protocol RIPv1 and RIPv2 using IPv4

    An Analysis of flow-based routing

    Get PDF
    Since their development in the early 1970\u27s, the underlying function of IP routers has not changed - they still support a best effort delivery method in order to pass frames from source to destination. With the advent of newer, bandwidth intensive Internet-based services and applications, such as video conferencing and telemedicine, many individuals wonder if the current approach to routing is the most practical. The Internet needs to provide quality of service ( QoS ) as predictably as conventional circuit switching networks. Although some QoS capabilities in an isolated environment have been demonstrated, providing end-to-end QoS at a large scale across the Internet remains an unsolved problem [1]. The alternative to the traditional method of IP routing is a concept known as flow-based routing, whereas traffic is sent across the network as part of a common flow, rather than individually inspecting each packet. As part of this thesis, the differences between flow-based routing and the current standard of IP routing will be investigated. There are many benefits to be had from routing based on flows, for both routers and applications. Some research has already been done on specific aspects of flow-based routing, but because the concept is so cutting-edge, resources are scarce. This study delves into the benefits and obstacles of flow-based routing, and analyzes characteristics such as practicality and security, along with the benefits of this model

    Investigating the Potential of the Inter-IXP Multigraph for the Provisioning of Guaranteed End-to-End Services

    Full text link
    In this work, we propose utilizing the rich connectivity between IXPs and ISPs for inter-domain path stitching, supervised by centralized QoS brokers. In this context, we highlight a novel abstraction of the Internet topology, i.e., the inter-IXP multigraph composed of IXPs and paths crossing the domains of their shared member ISPs. This can potentially serve as a dense Internet-wide substrate for provisioning guaranteed end-to-end (e2e) services with high path diversity and global IPv4 address space reach. We thus map the IXP multigraph, evaluate its potential, and introduce a rich algorithmic framework for path stitching on such graph structures.Comment: Proceedings of ACM SIGMETRICS '15, pages 429-430, 1/1/2015. arXiv admin note: text overlap with arXiv:1611.0264

    Mobile IP: state of the art report

    Get PDF
    Due to roaming, a mobile device may change its network attachment each time it moves to a new link. This might cause a disruption for the Internet data packets that have to reach the mobile node. Mobile IP is a protocol, developed by the Mobile IP Internet Engineering Task Force (IETF) working group, that is able to inform the network about this change in network attachment such that the Internet data packets will be delivered in a seamless way to the new point of attachment. This document presents current developments and research activities in the Mobile IP area

    A QoS-Driven ISP Selection Mechanism for IPv6 Multi-homed Sites

    Get PDF
    A global solution for the provision of QoS in IPng sites must include ISP selection based on per-application requirements. In this article we present a new site-local architecture for QoS-driven ISP selection in multi-homed domains, performed in a per application basis. This architecture proposes the novel use of existent network services, a new type of routing header, and the modification of address selection mechanisms to take into account QoS requirements. This proposal is an evolution of current technology, and therefore precludes the addition of new protocols, enabling fast deployment. The sitelocal scope of the proposed solution results in ISP transparency and thus in ISP independency.This research was supported by the LONG (Laboratories Over the Next Generation Networks) project IST-1999-20393.Publicad

    Should QoS routing algorithms prefer shortest paths?

    Get PDF
    Multimedia traffic and real-time e-commerce applications can experience quality degradation in traditional networks such as the Internet. These difficulties can be overcome in networks which feature dynamically set up paths with bandwidth and delay guarantees. The problem of selecting such constrained paths is the task of quality of service (QoS) routing. This paper considers link-state routing, and the choice of cost metric used to implement QoS routing. There are two schools of thought regarding the choice of link cost. It is commonly assumed that QoS routing algorithms should limit hop count so as to conserve resources for future connections. Others advocate load balancing mechanisms so as to increase overall network utilisation. This paper investigates which of these approaches gives the better performance. We show that there is no one general answer to this question. We also point out the dangers of drawing general conclusions about routing algorithm performance based on the study of only a limited set of network topologies
    • 

    corecore