The Experts below are selected from a list of 35541 Experts worldwide ranked by ideXlab platform

Nirwan Ansari - One of the best experts on this subject based on the ideXlab platform.

  • Adaptive QoS provisioning by pricing incentive QoS routing for next generation networks
    Computer Communications, 2008
    Co-Authors: Gang Cheng, Nirwan Ansari, Symeon Papavassiliou
    Abstract:

    In this paper, we present an integrated solution for enabling the next generation Internet to achieve the differentiated service and availability guarantee. In particular, we utilize a recent proposed service architecture, referred to as Service Vector (SV), to enhance the QoS granularity and flexibility offered in the Diffserv network model and improve both the network resource utilization and user benefits. In order to efficiently and effectively use network resources, we investigate the issue of integrating pricing into QoS routing and propose a PRicing InCEntive QoS Routing (PRICER) mechanism. PRICER consists of two components: a novel routing-oriented State update (ROSE) scheme and an efficient Pricing Incentive Routing Algorithm (PIRA). ROSE performs the task of exchanging Link State Information throughout the network, and PIRA is a routing algorithm used to find paths meeting the QoS requirements of applications. By theoretical analysis and extensive simulations, we show that ROSE greatly outperforms the State of the arts in terms of both protocol overhead and the accuracy of Link State Information, and PIRA can guarantee finding the QoS constrained path with fairly low average computational complexity. The most distinguished property of PIRA is its progressive property, which is very useful in practice: it can self-adaptively minimize its computational complexity without sacrificing its performance. Another contribution of this paper is the introduction of a method to numerically evaluate the staleness of Link State Information.

  • Routing-oriented update schEme (ROSE) for Link State updating
    IEEE Transactions on Communications, 2008
    Co-Authors: Nirwan Ansari, Gang Cheng, Nan Wang
    Abstract:

    Few works have been reported to address the issue of updating Link State Information in order to effectively facilitate quality-of-service (QoS) routing. The idea of modeling the QoS Link State Information as random variables has been reported, but none of the existing works have provided a comprehensive probabilistic approach to Link State update that takes the probability density functions of both the user's QoS requirements and the network's QoS measurements into account. We propose the routing-oriented update scheme (ROSE) that utilizes the knowledge of the history of network operations and user's QoS requirements to improve the efficiency of Link State update without increasing the network overhead. ROSE is a new class-based Link State update scheme which intelligently determines class sizes to minimize the impact of inaccurate Link State Information. Through theoretical analysis and extensive simulations, we demonstrate that ROSE outperforms other class- based Link State update policies.

  • ICC - ROSE II for Updating Additive Link State Information
    2006 IEEE International Conference on Communications, 2006
    Co-Authors: Nirwan Ansari, Gang Cheng, Nan Wang
    Abstract:

    Many works have been reported to address the issue of updating Link State Information in order to effectively facilitate Quality-of-Service (QoS) routing. However, most of them, if not all, only consider concave metrics, e.g., bandwidth. In this paper, we first observe that due to the inherently different nature of additive and concave QoS metrics, directly applying existing Link State update policies cannot provide satisfactory performance. As such, it is essential to consider the additive metrics of Link State update for the purpose of reducing the protocol overhead and improving the accuracy of Link State Information. By applying the central limit theorem, the additive QoS constraint imposed on each Link can be modeled as a normal random variable. Then, based on our previous proposal, ROSE, we present a high performance Link State update policy, ROSE II. Via theoretical analysis and extensive simulations, we show that ROSE II greatly outperforms the State of the arts in terms of protocol overhead and the accuracy of the Link State Information for additive metrics.

  • rate distortion based Link State update
    Computer Networks, 2006
    Co-Authors: Gang Cheng, Nirwan Ansari
    Abstract:

    Finding paths that satisfy the performance requirements of applications according to the Link State Information in a network is known as the quality-of-service (QoS) routing problem and has been extensively studied. However, distributing the Link State Information may introduce a significant protocol overhead on network resources. In this paper, based on rate-distortion analysis, we investigate the issue on how to update the Link State Information efficiently and effectively. A theoretical framework is presented, and a high performance Link State policy that is capable of minimizing the false blocking probability of connections under a given update rate constraint is proposed. Through theoretical analysis and extensive simulations, we show that the proposed policy outperforms the current State of the art in terms of the update rate and false blocking probability of connections.

  • ROSE II for Updating Additive Link State Information
    2006 IEEE International Conference on Communications, 2006
    Co-Authors: Nirwan Ansari, Gang Cheng, Nan Wang
    Abstract:

    Many works have been reported to address the issue of updating Link State Information in order to effectively facilitate Quality-of-Service (QoS) routing. However, most of them, if not all, only consider concave metrics, e.g., bandwidth. In this paper, we first observe that due to the inherently different nature of additive and concave QoS metrics, directly applying existing Link State update policies cannot provide satisfactory performance. As such, it is essential to consider the additive metrics of Link State update for the purpose of reducing the protocol overhead and improving the accuracy of Link State Information. By applying the central limit theorem, the additive QoS constraint imposed on each Link can be modeled as a normal random variable. Then, based on our previous proposal, ROSE, we present a high performance Link State update policy, ROSE II. Via theoretical analysis and extensive simulations, we show that ROSE II greatly outperforms the State of the arts in terms of protocol overhead and the accuracy of the Link State Information for additive metrics.

J.j. Garcia-luna-aceves - One of the best experts on this subject based on the ideXlab platform.

  • ICN - A New Approach to Name-Based Link-State Routing for Information-Centric Networks
    Proceedings of the 2nd ACM Conference on Information-Centric Networking, 2015
    Co-Authors: Ehsan Hemmati, J.j. Garcia-luna-aceves
    Abstract:

    The Link State Content Routing (LSCR) protocol is presented, which supports routing over multiple paths to named content using Link-State Information. LSCR uses two types of Link-State advertisements (LSAs): a RouterLSA that contains Information about Links connected to each router, and an AnchorLSA that carries Information regarding a name prefix and the router that advertises being attached to that name prefix, also called an anchor of the prefix. AnchorLSAs are propagated selectively based on a diffusing mechanism. In contrast to prior content routing solutions based on Link- State Information, LSCR allows routers to establish multiple routes to name prefixes, without requiring each router to know about all the instantiations of each prefix. LSCR is shown to avoid permanent routing loops and to have better performance compared to traditional Link-State routing protocols when a name prefix is replicated at multiple sites in the network.

  • On-demand Link-State routing in ad hoc networks
    2003
    Co-Authors: Soumya Roy, J.j. Garcia-luna-aceves
    Abstract:

    Abstract : This thesis explores the challenges, merits and demerits of using Link-State Information for on-demand routing in ad hoc networks, such that routers maintain path Information for only those destinations for which they have data traffic. We first present the source tree on-demand adaptive routing (SOAR) protocol, in which each router exchanges with its neighbors a "source tree" containing paths to only those destinations for which the router is the source or relay of data packets. The main advantage of SOAR is that it is more scalable and better performing than current State-of-the-art on-demand routing protocols. However, a limitation of SOAR is that it requires data packets to specify the paths they traverse to detect loops. To eliminate the need for source routing or path traversal Information in data packets, we introduce the on-demand Link-vector (OLIVE) protocol, which prevents temporary loops for each destination by synchronizing relevant Link-State Information among neighbors. In OLIVE, the advertised paths combine to form a source graph, rather than a source tree. OLIVE is shown to outperform the current routing protocols proposed for mobile ad-hoc networks in terms of control overhead, throughput and network delay.

  • MOBIWAC - Node-centric hybrid routing for ad hoc networks
    International Mobility and Wireless Access Workshop, 2002
    Co-Authors: Soumya Roy, J.j. Garcia-luna-aceves
    Abstract:

    We present node-centric approaches to hybrid routing for ad hoc networks in which normal nodes are distinguished from special nodes, called netmarks, hosting popular network services or functioning as points of attachment to the Internet. With node-centric hybrid routing, netmarks force common nodes to maintain routing Information for them by either sending routing updates proactively, or by requiring nodes to maintain on-demand routing entries towards them for extended periods of time. Routes between peer nodes are set up on-demand. Two node-centric routing solutions are presented based on partial Link-State Information. Simulation results using ns2 show that maintaining table-driven routing for netmarks and on-demand routing for common nodes performs much better than purely on-demand routing protocols based on distance vectors, path Information, or Link-State Information.

  • Transmission-Efficient Routing in Wireless Networks Using Link-State Information
    Mobile Networks and Applications, 2001
    Co-Authors: J.j. Garcia-luna-aceves, Marcelo Spohn
    Abstract:

    The efficiency with which the routing protocol of a multihop packet-radio network uses transmission bandwidth is critical to the ability of the network nodes to conserve energy. We present and verify the source-tree adaptive routing (STAR) protocol, which we show through simulation experiments to be far more efficient than both table-driven and on-demand routing protocols proposed for wireless networks in the recent past. A router in STAR communicates to its neighbors the parameters of its source routing tree, which consists of each Link that the router needs to reach every destination. To conserve transmission bandwidth and energy, a router transmits changes to its source routing tree only when the router detects new destinations, the possibility of looping, or the possibility of node failures or network partitions. Simulation results show that STAR is an order of magnitude more efficient than any topology-broadcast protocol proposed to date and depending on the scenario is up to six times more efficient than the Dynamic Source Routing (DSR) protocol, which has been shown to be one of the best performing on-demand routing protocols.

  • Distributed, scalable routing based on vectors of Link States
    IEEE Journal on Selected Areas in Communications, 1995
    Co-Authors: J.j. Garcia-luna-aceves, J. Behrens
    Abstract:

    We have present a new method for distributed routing in computer networks and internets using Link-State Information. Link vector algorithms (LVA) are introduced for the distributed maintenance of routing Information in large networks and internets.

Gang Cheng - One of the best experts on this subject based on the ideXlab platform.

  • Adaptive QoS provisioning by pricing incentive QoS routing for next generation networks
    Computer Communications, 2008
    Co-Authors: Gang Cheng, Nirwan Ansari, Symeon Papavassiliou
    Abstract:

    In this paper, we present an integrated solution for enabling the next generation Internet to achieve the differentiated service and availability guarantee. In particular, we utilize a recent proposed service architecture, referred to as Service Vector (SV), to enhance the QoS granularity and flexibility offered in the Diffserv network model and improve both the network resource utilization and user benefits. In order to efficiently and effectively use network resources, we investigate the issue of integrating pricing into QoS routing and propose a PRicing InCEntive QoS Routing (PRICER) mechanism. PRICER consists of two components: a novel routing-oriented State update (ROSE) scheme and an efficient Pricing Incentive Routing Algorithm (PIRA). ROSE performs the task of exchanging Link State Information throughout the network, and PIRA is a routing algorithm used to find paths meeting the QoS requirements of applications. By theoretical analysis and extensive simulations, we show that ROSE greatly outperforms the State of the arts in terms of both protocol overhead and the accuracy of Link State Information, and PIRA can guarantee finding the QoS constrained path with fairly low average computational complexity. The most distinguished property of PIRA is its progressive property, which is very useful in practice: it can self-adaptively minimize its computational complexity without sacrificing its performance. Another contribution of this paper is the introduction of a method to numerically evaluate the staleness of Link State Information.

  • Routing-oriented update schEme (ROSE) for Link State updating
    IEEE Transactions on Communications, 2008
    Co-Authors: Nirwan Ansari, Gang Cheng, Nan Wang
    Abstract:

    Few works have been reported to address the issue of updating Link State Information in order to effectively facilitate quality-of-service (QoS) routing. The idea of modeling the QoS Link State Information as random variables has been reported, but none of the existing works have provided a comprehensive probabilistic approach to Link State update that takes the probability density functions of both the user's QoS requirements and the network's QoS measurements into account. We propose the routing-oriented update scheme (ROSE) that utilizes the knowledge of the history of network operations and user's QoS requirements to improve the efficiency of Link State update without increasing the network overhead. ROSE is a new class-based Link State update scheme which intelligently determines class sizes to minimize the impact of inaccurate Link State Information. Through theoretical analysis and extensive simulations, we demonstrate that ROSE outperforms other class- based Link State update policies.

  • ICC - ROSE II for Updating Additive Link State Information
    2006 IEEE International Conference on Communications, 2006
    Co-Authors: Nirwan Ansari, Gang Cheng, Nan Wang
    Abstract:

    Many works have been reported to address the issue of updating Link State Information in order to effectively facilitate Quality-of-Service (QoS) routing. However, most of them, if not all, only consider concave metrics, e.g., bandwidth. In this paper, we first observe that due to the inherently different nature of additive and concave QoS metrics, directly applying existing Link State update policies cannot provide satisfactory performance. As such, it is essential to consider the additive metrics of Link State update for the purpose of reducing the protocol overhead and improving the accuracy of Link State Information. By applying the central limit theorem, the additive QoS constraint imposed on each Link can be modeled as a normal random variable. Then, based on our previous proposal, ROSE, we present a high performance Link State update policy, ROSE II. Via theoretical analysis and extensive simulations, we show that ROSE II greatly outperforms the State of the arts in terms of protocol overhead and the accuracy of the Link State Information for additive metrics.

  • rate distortion based Link State update
    Computer Networks, 2006
    Co-Authors: Gang Cheng, Nirwan Ansari
    Abstract:

    Finding paths that satisfy the performance requirements of applications according to the Link State Information in a network is known as the quality-of-service (QoS) routing problem and has been extensively studied. However, distributing the Link State Information may introduce a significant protocol overhead on network resources. In this paper, based on rate-distortion analysis, we investigate the issue on how to update the Link State Information efficiently and effectively. A theoretical framework is presented, and a high performance Link State policy that is capable of minimizing the false blocking probability of connections under a given update rate constraint is proposed. Through theoretical analysis and extensive simulations, we show that the proposed policy outperforms the current State of the art in terms of the update rate and false blocking probability of connections.

  • ROSE II for Updating Additive Link State Information
    2006 IEEE International Conference on Communications, 2006
    Co-Authors: Nirwan Ansari, Gang Cheng, Nan Wang
    Abstract:

    Many works have been reported to address the issue of updating Link State Information in order to effectively facilitate Quality-of-Service (QoS) routing. However, most of them, if not all, only consider concave metrics, e.g., bandwidth. In this paper, we first observe that due to the inherently different nature of additive and concave QoS metrics, directly applying existing Link State update policies cannot provide satisfactory performance. As such, it is essential to consider the additive metrics of Link State update for the purpose of reducing the protocol overhead and improving the accuracy of Link State Information. By applying the central limit theorem, the additive QoS constraint imposed on each Link can be modeled as a normal random variable. Then, based on our previous proposal, ROSE, we present a high performance Link State update policy, ROSE II. Via theoretical analysis and extensive simulations, we show that ROSE II greatly outperforms the State of the arts in terms of protocol overhead and the accuracy of the Link State Information for additive metrics.

Tee-hiang Cheng - One of the best experts on this subject based on the ideXlab platform.

  • BROADNETS - The Performance of Periodic Link-State Update in Wavelength-Routed Networks
    2006 3rd International Conference on Broadband Communications Networks and Systems, 2006
    Co-Authors: Shu Shen, Gaoxi Xiao, Tee-hiang Cheng
    Abstract:

    Distributed lightpath establishment in wavelength- routed networks requires up-to-date Link-State Information to achieve blocking performance target. Invalid routing and wavelength assignment decisions caused by inaccurate Link-State Information may degrade network performance significantly as the lightpaths become more and more dynamic. In this paper, we evaluate the performance of periodic Link-State update, where Link-State Information is exchanged between network nodes at regular intervals. By proposing an accurate analytical model as well as by carrying out extensive simulations, we show how different components of network blocking probability are affected by inaccurate Information under different traffic loads, and provide insights into the high sensitivity of blocking performance to Link- State update interval under light traffic loads. We demonstrate how the sensitivity could be affected by network connectivity as well.

  • A novel method of Link-State update in wavelength-routed networks
    Journal of Lightwave Technology, 2006
    Co-Authors: Shu Shen, Gaoxi Xiao, Tee-hiang Cheng
    Abstract:

    Link-State update is a critical component of the routing protocol in wavelength-routed networks. High-frequency updates impose heavy traffic on network control channels as well as excessive burden of electronic processing, while stale Link-State Information seriously degrades network performance. Therefore, a tradeoff has to be made between control overhead and network blocking probability. This paper proposes a novel Link-State update method. By actively regulating the Link-State update rate, the proposed method efficiently handles the inherent burstiness of Link-State changes without overloading control network with excessive update messages. To improve the blocking performance under limited control bandwidth, it assigns different types of updates with different priorities such that the stale Link-State Information of more negative impact has a higher chance to be removed. Comprehensive performance evaluations show that the method successfully enforces the control bandwidth quota while achieving much lower blocking probability than existing Link-State update methods

K.g. Shin - One of the best experts on this subject based on the ideXlab platform.

  • Evaluating the impact of stale Link State on quality-of-service routing
    IEEE ACM Transactions on Networking, 2001
    Co-Authors: A Shaikh, Jennifer Rexford, K.g. Shin
    Abstract:

    Quality-of-service (QoS) routing satisfies application performance requirements and optimizes network resource usage by selecting paths based on connection traffic parameters and Link load Information. However, distributing Link State imposes significant bandwidth and processing overhead on the network. This paper investigates the performance tradeoff between protocol overhead and the quality of the routing decisions in the context of the source-directed Link State routing protocols proposed for IP and ATM networks. We construct a detailed model of QoS routing that parameterizes the path-selection algorithm, Link-cost function, and Link State update policy. Through extensive simulation experiments with several network topologies and traffic patterns, we uncover the effects of stale Link State Information and random fluctuations in traffic load on the routing and setup overheads. We then investigate how inaccuracy of Link State Information interacts with the size and connectivity of the underlying topology. Finally, we show that tuning the coarseness of the Link-cost metric to the inaccuracy of underlying Link State Information reduces the computational complexity of the path-selection algorithm without significantly degrading performance. This work confirms and extends earlier studies, and offers new insights for designing efficient quality-of-service routing policies in large networks.

  • ICNP - Evaluating the overheads of source-directed quality-of-service routing
    Proceedings Sixth International Conference on Network Protocols (Cat. No.98TB100256), 1
    Co-Authors: A Shaikh, Jennifer Rexford, K.g. Shin
    Abstract:

    Quality-of-service (QoS) routing satisfies application performance requirements and optimizes network resource usage but effective path-selection schemes require the distribution of Link-State Information, which can impose a significant burden on the bandwidth and processing resources in the network. We investigate the fundamental trade-off between network overheads and the quality of routing decisions in the context of the source-directed Link-State routing protocols proposed for future IP and ATM networks. Through extensive simulation experiments with several representative network topologies and traffic patterns, we uncover the effects of stale Link-State Information, random fluctuations in traffic load, and variations of the Link-cost metric on the routing and signalling overheads. The paper concludes by summarizing our key results as a list of guidelines for designing efficient quality-of-service routing policies in large backbone networks.

  • DSN - Design and evaluation of routing schemes for dependable real-time connections
    Proceedings International Conference on Dependable Systems and Networks, 1
    Co-Authors: Songkuk Kim, Daji Qiao, S. Kodase, K.g. Shin
    Abstract:

    Dependability of service (DoS) has become an important requirement for real-time applications, such as remote medical services, business-critical network meetings and command-and-control applications. The Dependable Real-Time Protocol (DRTP), in which each dependable real-time connection is realized with one primary and one or more backup channels, has been shown to be an effective way of providing DoS. How to route both primary and backup channels for each dependable real-time connection is of vital importance to the success of failure recovery and to overhead reduction in providing DoS. In this paper, we propose and evaluate three different schemes for routing the primary and backup channels of each dependable real-time connection. Specifically, we present methods based on Link-State Information and bounded flooding to discover routes for the primary and backup channels while satisfying the required quality of service (QoS). The costs of the Link-State and flooding algorithms are reduced significantly by using the fact that the probability of success in failure recovery can be estimated with simple Link-State Information, and by bounding the flooded region within an ellipse with the two communication end-points as loci. Our in-depth simulations have shown that the proposed routing schemes are highly effective, providing a fault tolerance of 87% or higher with a network capacity overhead of less than 85%.