The Experts below are selected from a list of 75 Experts worldwide ranked by ideXlab platform
S. Z. Shaikh - One of the best experts on this subject based on the ideXlab platform.
-
A simple adaptive routing scheme for congestion control in ShuffleNet multihop lightwave networks
IEEE Journal on Selected Areas in Communications, 1991Co-Authors: Mark J. Karol, S. Z. ShaikhAbstract:The authors describe a simple adaptive routing scheme for datagram (Connectionless) and Virtual Circuit (Connection-oriented) transmission that relieves congestion resulting from nonuniform traffic patterns and network failures. The authors describe a fixed-routing algorithm for dedicated channel ShuffleNets. Based on the fixed routing algorithm, an adaptive routing scheme for datagram transmission is presented followed by performance results for uniform and nonuniform traffic patterns and fault tolerance. The adaptive routing of datagrams uses only the local queue size information available at the network interface units (NIUs) and redistributes the load as congestion develops. Since datagrams are individually routed through the network, they may not arrive at their destination in the order they were generated and may need to be resequenced. The authors compute an upper estimate on the resequencing buffer size for stream traffic. A Virtual Circuit version of the adaptive routing algorithm eliminates the need for resequencing buffers. >
Mark J. Karol - One of the best experts on this subject based on the ideXlab platform.
-
A simple adaptive routing scheme for congestion control in ShuffleNet multihop lightwave networks
IEEE Journal on Selected Areas in Communications, 1991Co-Authors: Mark J. Karol, S. Z. ShaikhAbstract:The authors describe a simple adaptive routing scheme for datagram (Connectionless) and Virtual Circuit (Connection-oriented) transmission that relieves congestion resulting from nonuniform traffic patterns and network failures. The authors describe a fixed-routing algorithm for dedicated channel ShuffleNets. Based on the fixed routing algorithm, an adaptive routing scheme for datagram transmission is presented followed by performance results for uniform and nonuniform traffic patterns and fault tolerance. The adaptive routing of datagrams uses only the local queue size information available at the network interface units (NIUs) and redistributes the load as congestion develops. Since datagrams are individually routed through the network, they may not arrive at their destination in the order they were generated and may need to be resequenced. The authors compute an upper estimate on the resequencing buffer size for stream traffic. A Virtual Circuit version of the adaptive routing algorithm eliminates the need for resequencing buffers. >
-
A simple adaptive routing scheme for ShuffleNet multihop lightwave networks
IEEE Global Telecommunications Conference and Exhibition. Communications for the Information Age, 1Co-Authors: Mark J. Karol, S. ShaikhAbstract:The authors describe a simple, adaptive routing scheme for datagram (Connectionless) and Virtual Circuit (Connection-oriented) transmission that relieves congestion resulting from nonuniform traffic patterns and network failures. It is a distributed algorithm that uses only local state information available at the user locations. When the network is congestion free, the routing scheme delivers packets in the minimum number of hops. However, as a channel becomes overloaded, some of the traffic is distributed over less busy channels by automatically bumping packets in nonoptimal directions. The ShuffleNet connectivity makes it possible to disperse packets away from congested portions of the network quickly. Simulations of the adaptive routing scheme for datagram transmission demonstrates that it supports nonuniform traffic patterns, reduces the mean queue sizes and variances, and requires small resequencing buffers. >
Kirk Pruhs - One of the best experts on this subject based on the ideXlab platform.
-
WAOA - Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling
Approximation and Online Algorithms, 2013Co-Authors: Anupam Gupta, Ravishankar Krishnaswamy, Kirk PruhsAbstract:We give a principled method to design online algorithms (for potentially non-linear problems) using a mathematical programming formulation of the problem, and also to analyze the competitiveness of the resulting algorithm using the dual program. This method can be viewed as an extension of the online primal-dual method for linear programming problems, to nonlinear programs. We show the application of this method to two online speed-scaling problems: one involving scheduling jobs on a speed scalable processor so as to minimize energy plus an arbitrary sum scheduling objective, and one involving routing Virtual Circuit Connection requests in a network of speed scalable routers so as to minimize the aggregate power or energy used by the routers. This analysis shows that competitive algorithms exist for problems that had resisted analysis using the dominant potential function approach in the speed-scaling literature, and provides alternate cleaner analysis for other known results. This gives us another tool in the design and analysis of primal-dual algorithms for online problems.
-
Online Primal-Dual For Non-linear Optimization with Applications to Speed Scaling
2013Co-Authors: Anupam Gupta, Ravishankar Krishnamurthy, Kirk PruhsAbstract:We give a principled method to design online algorithms (for potentially non-linear problems) using a mathematical programming formulation of the problem, and also to analyze the competitiveness of the resulting algorithm using the dual program. This method can be viewed as an extension of the online primal-dual method for linear programming problems, to nonlinear programs. We show the application of this method to two online speed-scaling problems: one involving scheduling jobs on a speed scalable processor so as to minimize energy plus an arbitrary sum scheduling objective, and one involving routing Virtual Circuit Connection requests in a network of speed scalable routers so as to minimize the aggregate power or energy used by the routers. This analysis shows that competitive algorithms exist for problems that had resisted analysis using the dominant potential function approach in the speed-scaling literature, and provides alternate cleaner analysis for other known results. This gives us another tool in the design and analysis of primal-dual algorithms for online problems.
M. El Zarki - One of the best experts on this subject based on the ideXlab platform.
-
Performance analysis of Virtual Circuit Connections for bursty data sources in ATM networks
Annals of Operations Research, 1992Co-Authors: Ness Shroff, M. El ZarkiAbstract:ATM is a packet-like transmission mode that has been proposed for BISDN. It is characterized by an asynchronous slotted transmission mechanism that provides a high bandwidth, low delay Connection-oriented transport service to the end user. In this paper, we provide an analytical approach for determining the performance of a Virtual Circuit Connection for data transmission in a high-speed ATM network with finite buffers at the network nodes. The analysis assumes that the network operates using the best effort delivery strategy and that the end-to-end Virtual Circuit is responsible for guaranteeing the integrity of the Connection. Since the normal Markovian assumptions do not apply, a concise exact solution is impossible to obtain. This provides motivation for developing approximate techniques such as those found in Whitt's QNA paper that allow us to use general distributions for the traffic streams and service times. However, even these techniques assume infinite buffer capacities and hence cannot model buffer overflow. We have therefore developed a hybrid model that allows us to incorporate finite buffers at the nodes. This enables us to study the effect on the performance of both link errors and buffer overflow in conjunction with an end-to-end packet loss recovery scheme.
-
INFOCOM - Performance analysis of a Virtual Circuit Connection in a high speed ATM WAN using the best effort delivery strategy
IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceeding, 1991Co-Authors: Ness B Shroff, M. El ZarkiAbstract:An analytical approach is provided for determining the performance of a Virtual Circuit Connection for data transmission in high speed asynchronous transfer mode (ATM) network buffers at wide area network (WAN) nodes. The analysis assumes that the network operates using the best effort delivery strategy and that the end-to-end Virtual Circuit is responsible for guaranteeing the integrity of the Connection. As the normal Markovian assumptions do not apply, a concise exact solution is impossible to obtain. A hybrid model incorporating finite buffers at the nodes was developed to study the effect on the performance of both link errors and buffer overflow in conjunction with an end-to-end packet loss recovery scheme. >
Sumit Ghosh - One of the best experts on this subject based on the ideXlab platform.
-
incremental dynamic Virtual Circuit Connection ivcc a new paradigm for routing in future high speed networks
International Conference on Communications, 2001Co-Authors: Q Razouqi, Tony Lee, Seongsoon Joo, Sumit GhoshAbstract:This paper presents a new routing strategy, termed incremental Virtual Circuit Connection (IVCC), that is ideally suited for a class of call requests that promise to underlie future high-speed networks. IVCC aims to reduce the idling of reserved resources, thereby improving the sharing of network resources among users and increasing call success rate. Under IVCC, the subsequent subpaths, starting at the source node, are computed, reserved, and utilized incrementally. Initially, the source node (SN) computes the entire path all the way to the destination node (DN), but propagates the call admission control (CAC) to reserve network resources only for a subset of the entire path, where the choice of the subpath is based on the organization and topology of the network. This paper hypothesizes that the efficient use of resources in IVCC will significantly reduce the probability of failures. Thus, IVCC's uniqueness consists of two key elements. First, the actual route for a source traffic is successively and dynamically refined, utilizing up-to-date information on the state of the network, but always keeping an "eye" towards the destination. Second, traffic cells are launched from the source node or any of the intermediate nodes only after the network resources along the subsequent subpath have been reserved. IVCC has been modeled for two representative ATM networks, a 15-node network spread over the continental US and a 50-node network extending throughout the world, and extensively simulated for a large number of realistic input traffic stimuli utilizing an asynchronous distributed simulation algorithm running on a network of workstations. For a comparative analysis, ATM Forum's P-NNI is also modeled and simulated for identical networks and under identical traffic conditions.
-
ICC - Incremental, dynamic, Virtual Circuit Connection (IVCC): a new paradigm for routing in future high-speed networks
ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240), 1Co-Authors: Q Razouqi, Tony Lee, Seongsoon Joo, Sumit GhoshAbstract:This paper presents a new routing strategy, termed incremental Virtual Circuit Connection (IVCC), that is ideally suited for a class of call requests that promise to underlie future high-speed networks. IVCC aims to reduce the idling of reserved resources, thereby improving the sharing of network resources among users and increasing call success rate. Under IVCC, the subsequent subpaths, starting at the source node, are computed, reserved, and utilized incrementally. Initially, the source node (SN) computes the entire path all the way to the destination node (DN), but propagates the call admission control (CAC) to reserve network resources only for a subset of the entire path, where the choice of the subpath is based on the organization and topology of the network. This paper hypothesizes that the efficient use of resources in IVCC will significantly reduce the probability of failures. Thus, IVCC's uniqueness consists of two key elements. First, the actual route for a source traffic is successively and dynamically refined, utilizing up-to-date information on the state of the network, but always keeping an "eye" towards the destination. Second, traffic cells are launched from the source node or any of the intermediate nodes only after the network resources along the subsequent subpath have been reserved. IVCC has been modeled for two representative ATM networks, a 15-node network spread over the continental US and a 50-node network extending throughout the world, and extensively simulated for a large number of realistic input traffic stimuli utilizing an asynchronous distributed simulation algorithm running on a network of workstations. For a comparative analysis, ATM Forum's P-NNI is also modeled and simulated for identical networks and under identical traffic conditions.
