Lorne G. Mason

A framework for bandwidth management in ATM networks—aggregate equivalent bandwidth estimation approach

A unified framework for traffic control and bandwidth management in ATM networks is proposed. It bridges algorithms for real-time and data services. The central concept of this framework is adaptive connection admission. It employs an estimation of the aggregate equivalent bandwidth required by connections carried in each output port of the ATM switches. The estimation process takes into account both the traffic source declarations and the connection superposition process measurements in the switch output ports. This is done in an optimization framework based on a linear Kalman filter. To provide a required quality of service guarantee, bandwidth is reserved for possible estimation error. The algorithm is robust and copes very well with unpredicted changes in source parameters, thereby resulting in high bandwidth utilization while providing the required quality of service. The proposed approach can also take into account the influence of the source policing mechanism. The tradeoff between strict and relaxed source policing is discussed.

Fair-efficient call admission control policies for broadband networks—a game theoretic framework

A fundamental problem in connection oriented multiservice networks (ATM and STM) is finding the optimal policy for call acceptance. One seeks an admission control policy that efficiently utilizes network resources while at the same time being fair to the various call classes being supported. The theory of cooperative games provides a natural and precise framework for formulating such multicriterion problems as well as solution concepts. The authors describe how this framework can be used for analysis and synthesis of call admission strategies in broadband networks. In particular they investigate the Nash (1950), Raiffa-Kalai-Smorodinsky (Raiffa, 1953; Kalai and Smorodinsky, 1975), and modified Thomson (Cao, 1982) arbitration solutions from game theory. The performance of all solutions is evaluated by applying the value iteration algorithm from Markov decision theory. The approach is illustrated on a one-link network example for which the exact solutions can be achieved. The results indicate that the arbitration schemes from game theory provide some attractive features especially when compared to traditional control objectives: blocking equalization and traffic maximization. The authors also compare the optimal solutions with some simplified policies belonging to four different classes: complete sharing, coordinate convex, trunk reservation, and dynamic trunk reservation. The comparison indicates that in many cases, the trunk reservation and dynamic trunk reservation policies can provide fair, efficient solutions, close to the optimal ones.

Topological design and dimensioning of Agile All-Photonic Networks

We present the design and analysis of an Agile All-Photonic Network (AAPN); in the context of our study, the agility is derived from sub-microsecond photonic switching and global network synchronization. We have articulated a set of circuit design alternatives in terms of switch configurations referred to as symmetric and asymmetric designs, and two-layer and three-layer designs and discuss the implications of these alternatives in terms of transmitter and receiver design and synchronization requirements. In order to evaluate performance and cost of this range of design alternatives, we developed a set of software tools and methodologies for designing and dimensioning our vision of an AAPN. The topological design problem consists of determining the optimal number, size and placement of edge nodes, selector/ multiplexers and core switches as well as the placement of the DWDM links so as to minimize network costs while satisfying performance requirements of the supported traffic. A new mixed integer linear programming formulation is presented for core node placement and link connectivity. A methodology has been developed for two-layer and three-layer network topology design and implemented in software. These tools were exercised under a wide variety of equipment cost assumptions for both a metropolitan network and a long-haul network assuming a gravity model for traffic distribution and a fiat community of interest factor. Key findings include the determination of near cost optimal designs for both metropolitan (two-layer design) and a Canadian wide area network (WAN, three-layer design). We also show the cost and topology sensitivity to the selector switch size and the preferred size in terms of port count and number of switches.

Admission control and routing in ATM networks

Abstract Different approaches for effective bandwidth allocation in an ATM link are investigated. The results can be useful in constructing some simple admission models. A framework for flow control and routing in ATM networks is proposed. It is based on methods developed for circuit-switched networks.

Restoration strategies and spare capacity requirements in self-healing ATM networks

This paper studies the capacity and flow assignment problem arising in the design of self-healing ATM networks using the virtual path (VP) concept. The problem is formulated as a linear programming problem which is solved using standard methods. The objective is to minimize the spare capacity cost for the given restoration requirement. The spare cost depends on the restoration strategies used in the network. We compare several restoration strategies, notably, global versus failure-oriented reconfiguration, path versus link based restoration and state-dependent versus state-independent restoration, quantitatively in terms of spare cost. The advantages and disadvanages of various restoration strategies are also highlighted. Such comparisons provide useful guidance for real network design. Further, a new heuristic algorithm is developed for the design of large self-healing ATM networks using path based restoration. Numerical results illustrate that the heuristic algorithm is efficient and can give near-optimal solutions for spare capacity allocation and flow assignment.

A multiserver queue with narrow- and wide-band customers and wide-band restricted access

A multiserver queueing system with two classes of customers is considered: a type-1 (narrowband, NB) customer requires a single server, while each type-2 (wideband, WB) customer requests n of the m servers (n is not random). Severs allocated to a type-2 customer are seized and released simultaneously. Service times are exponentially distributed with mean 1//sub mu i/ for type i customers (i=1, 2). Blocked type-1 customers are cleared while blocked type-2 customers may be delayed in an infinite waiting room. A type-1 customer enters service immediately upon arrival if at least one server is free, irrespective of the status of the type-2 queue. WB customers have restricted access to the service facility; a cutoff parameter specifies the maximum number of type-2 customers that can be in service at the same time. Two approaches, moment-generating functions and matrix-geometric techniques, are considered for the computation of the system performance, that is, the mean waiting time in queue and the probability of delay (i.e. nonzero waiting time) for type-2 customers, as well as the probability of blocking for type-1 customers. >

Managing Traffic Performance in Converged Networks

Invited Presentations.- Game-Theoretic Models of ISP-ISP and ISP-Customer Interactions.- Towards Autonomic Communications.- Topics in Networking Research.- Path Towards Network Convergence and Challenges.- IPTV Planning and Modeling.- Dimensioning Multicast-Enabled Networks for IP-Transported TV Channels.- Video-on-Demand Server Selection and Placement.- Analysis of the Influence of Video-Aware Traffic Management on the Performance of the Dejittering Mechanism.- Modeling of H.264 High Definition Video Traffic Using Discrete-Time Semi-Markov Processes.- Network Performance.- Initial Simulation Results That Analyze SIP Based VoIP Networks Under Overload.- Recovery, Routing and Load Balancing Strategy for an IP/MPLS Network.- Performability Analysis of Multi-layer Restoration in a Satellite Network.- Adaptive Congestion Control Under Dynamic Weather Condition for Wireless and Satellite Networks.- Routing.- Distributed Path Computation Without Transient Loops: An Intermediate Variables Approach.- A Robust Routing Plan to Optimize Throughput in Core Networks.- Stable and Robust Multipath Oblivious Routing for Traffic Engineering.- Modeling BGP Table Fluctuations.- Server/Switch Performance.- Performance Evaluation of a Reliable Content Mediation Platform in the Emerging Future Internet.- Fair Scheduling in Optical Burst Switching Networks.- Optical Packet Switches Enhanced with Electronic Buffering and Fixed Wavelength Conversion.- Impact of Complex Filters on the Message Throughput of the ActiveMQ JMS Server.- Service Overlay Networks.- Bio-inspired Analysis of Symbiotic Networks.- Hierarchical Infrastructure-Based Overlay Network for Multicast Services.- Network Capacity Allocation in Service Overlay Networks.- Hybrid Topology for Multicast Support in Constrained WDM Networks.- Traffic Source and Aggregate Models.- Understanding IP Traffic Via Cluster Processes.- State-Space Modeling of Long-Range Dependent Teletraffic.- Generating LRD Traffic Traces Using Bootstrapping.- On the Flexibility of M/G/? Processes for Modeling Traffic Correlations.- Mesh Networks - Performance Optimization - I.- Analytic Modeling of Ad Hoc 802.11 Networks with Hidden Nodes Applied to a Split Channel Solution for Performance Improvement.- Providing QoS in Ad Hoc Networks with Distributed Resource Reservation.- Fluid-Flow Modeling of a Relay Node in an IEEE 802.11 Wireless Ad-Hoc Network.- An Upper Bound on Multi-hop Wireless Network Performance.- QoS in Converged Networks.- On the Use of Accounting Data for QoS-Aware IP Network Planning.- Quantification of Quality of Experience for Edge-Based Applications.- A Comparative Study of Forward Error Correction and Frame Accumulation for VoIP over Congested Networks.- Performance Optimization of Single-Cell Voice over WiFi Communications Using Quantitative Cross-Layering Analysis.- Traffic Engineering.- A Cross-Layer Approach for Evaluating the Impact of Single NEXT Interferer in DMT Based ADSL Systems.- A Statistical Bandwidth Sharing Perspective on Buffer Sizing.- Approximating Flow Throughput in Complex Data Networks.- Improving RED by a Neuron Controller.- Mesh Networks - Performance Optimization - II.- BFGSDP: Bloom Filter Guided Service Discovery Protocol for MANETs.- Opportunistic Medium Access Control in MIMO Wireless Mesh Networks.- A Delay Based Multipath Optimal Route Analysis for Multi-hop CSMA/CA Wireless Mesh Networks.- Load Balancing by Joint Optimization of Routing and Scheduling in Wireless Mesh Networks.- End-to-End Delay in Converged Networks.- Network Calculus Delay Bounds in Queueing Networks with Exact Solutions.- Simple Approximations of Delay Distributions and Their Application to Network Modeling.- Modeling and Predicting End-to-End Response Times in Multi-tier Internet Applications.- Delay Bounds in Tree Networks with DiffServ Architecture.- Queuing Models - I.- Polling Models with Two-Stage Gated Service: Fairness Versus Efficiency.- On a Unifying Theory on Polling Models in Heavy Traffic.- Performance Analysis of a Fluid Queue with Random Service Rate in Discrete Time.- Performance of a Partially Shared Priority Buffer with Correlated Arrivals.- Performance of Peer-to-Peer Networks.- Unfairness in the e-Mule File Sharing System.- On Uncoordinated File Distribution with Non-altruistic Downloaders.- TCPeer: Rate Control in P2P over IP Networks.- Estimating Churn in Structured P2P Networks.- Performance Analysis of Peer-to-Peer Storage Systems.- Traffic Measurements and Demand Forecast.- Traffic Matrix Estimation Based on Markovian Arrival Process of Order Two (MAP-2).- Survey on Traffic of Metro Area Network with Measurement On-Line.- Deterministic Versus Probabilistic Packet Sampling in the Internet.- Simple and Accurate Forecasting of the Market for Cellular Mobile Services.- Queuing Models - II.- Performance Analysis of FEC Recovery Using Finite-Buffer Queueing System with General Renewal and Poisson Inputs.- Queueing Model with Time-Phased Batch Arrivals.- A Performance Analysis of Tandem Networks with Markovian Sources.- Queues with Message Discard at Non-zero Cost.- Impact of Convergence and Divergence Forces on Network Performance and Provisioning.- Uniform Approximations for Multirate Loss Systems with State Dependent Arrival Rates.- Power Control and Rate Adaptation in Multi-hop Access Networks - Is It Worth the Effort?.- Random Multi-access Algorithms in Networks with Partial Interaction: A Mean Field Analysis.- A Phase-Type Based Markov Chain Model for IEEE 802.16e Sleep Mode and Its Performance Analysis.- The Impact of Interference on Optimal Multi-path Routing in Ad Hoc Networks.- Modeling IEEE 802.11 in Mesh Networks.- Self-tuning Optimal PI Rate Controller for End-to-End Congestion With LQR Approach.- Quality-of-Service Provisioning for Multi-service TDMA Mesh Networks.- Provisioning Dedicated Class of Service for Reliable Transfer of Signaling Traffic.- An Algorithmic Framework for Discrete-Time Flow-Level Simulation of Data Networks.- Loss/Blocking Probability.- On the Application of the Asymmetric Convolution Algorithm in Modeling of Full-Availability Group with Bandwidth Reservation.- Analysis and Provisioning of a Circuit-Switched Link with Variable-Demand Customers.- An Approximation Method for Multiservice Loss Performance in Hierarchical Networks.- Analysis of Losses in a Bufferless Transmission Link.- Traffic Management in Wireless Networks.- Adaptive Admission Control in Mobile Cellular Networks with Streaming and Elastic Traffic.- Queueing Analysis of Mobile Cellular Networks Considering Wireless Channel Unreliability and Resource Insufficiency.- A Novel Performance Model for the HSDPA with Adaptive Resource Allocation.- Traffic Measurements and Characterization.- On the Interaction Between Internet Applications and TCP.- Measurement Based Modeling of eDonkey Peer-to-Peer File Sharing System.- Internet Data Flow Characterization and Bandwidth Sharing Modelling.- Measurement and Characteristics of Aggregated Traffic in Broadband Access Networks.- Network Design for Capacity and Performance.- Revisiting the Optimal Partitioning of Zones in Next Generation Cellular Networks: A Network Capacity Impact Perspective.- Distributed Dynamic Load Balancing in Wireless Networks.- Algorithms for Designing WDM Networks and Grooming the Traffic.- Performance Analysis of Traffic-Groomed Optical Networks Employing Alternate Routing Techniques.- Performance of Wireless Networks.- Approximating the Admission Region for Multi-resource CAC in Wireless Networks.- Co-MAC: Energy Efficient MAC Protocol for Large-Scale Sensor Networks.- Performance Evaluation of IEEE 802.11 DCF Networks.- Scheduling.- Impact of Size-Based Scheduling on Flow Level Performance in Wireless Downlink Data Channels.- A Resource Scheduling Scheme for Radio Access in Portable Internet.- Opportunistic Scheduling of Wireless Links.- Reversible Fair Scheduling: The Teletraffic Theory Revisited.- Plenary Session - Contributed Papers.- Is ALOHA Causing Power Law Delays?.- Peer-to-Peer vs. Client/Server: Reliability and Efficiency of a Content Distribution Service.- Globally Optimal User-Network Association in an 802.11 WLAN & 3G UMTS Hybrid Cell.

An analysis of near optimal call admission and routing model for multi-service loss networks

A state-dependent call admission and routing policy for a multiservice circuit-switched network is analyzed. The policy is based on decomposition of the Markov decision problem into a set of separable link problems. To provide an exact link analysis model a value iteration algorithm was offered. This allows examination of the accuracy of several approximations used to reduce the complexity of the problem. The numeral study showed that the convergence of the analyzed strategy is achieved in at most two iterations. The study also showed the good traffic efficiency of the approach and confirmed the predicted ability to control the distribution of call classes grade of service. The approach, together with its sensitivity analysis with respect to the arrival rates, provides a very general framework for studying, constructing, and optimizing other call admission and routing strategies. The results of sensitivity analysis are used to compare the proposed decomposition approach with the decomposition approach developed by F.P. Kelly (1988) for optimization of a load sharing policy. Also, the relationship to other routing strategies based on Markov decision theory is investigated.<<ETX>>

A discrete-time single server queue with a two-level modulated input and its applications

A discrete-time, single-server system with a two-level modulated input is considered. The time axis is divided into equal-length slots, and the service time is deterministic and equal to one slot. The probability-generating function of the number of calls in the system is derived. A special case of this queuing system with a two-level Markov modulated Poisson input is studied in detail. Some numerical results concerning the mean and the variance of waiting time of an arbitrary call are given. The MMPP (Markov modulated Poisson process) approach is used to study some cases other than that of the packetized voice system. An alternative to the determination of the four parameters of the MMPP is also presented. This approach produces better results than the method presented for the cases with long burst length and high source peak rate (broadband integrated services digital network). This queuing model can be applied to performance analysis of a discrete-time ATM (asynchronous transfer mode) system and can be used as an approximation for a continuous-time MMPP/D/1 system.<<ETX>>

An approximate performance model for a multislot integrated services system

An approximate model (with finite or infinite waiting room) is presented for an integrated service system with three types of traffic: a first-offered narrowband traffic, an overflow narrowband traffic, and a wideband traffic. A narrowband call requires a single server, while the number of servers required to serve a wideband call is N. The blocked narrowband calls are lost while the blocked wideband calls are delayed in a finite or infinite waiting room. Based on two assumptions with regard to the characteristics of the system, the system is resolved by decomposition. The corresponding improvements in numerical efficiency as well as in computational storage requirements are significant enough to enable use of the model within network optimization algorithms. The model provides a very good approximation for the system performance, i.e. the blocking probabilities of the two narrowband traffics, the loss probability (in the case of finite waiting room), the probability of nonwaiting, and the average waiting time of wideband traffic. >