Network dimensioning and performance of multiservice, multirateloss networks with dynamic routing

We address a multiservice, multirate loss network environment with dynamic routing. In this setting, we consider multiple traffic load periods (multihour) during the day, and by observing network dynamics, we present a network dimensioning model that consists of two steps: a bandwidth estimation step, followed by a multicommodity flow model for multiple services and traffic loads. For network operations, we discuss a probabilistic admission control policy and three multiservice routing schemes. We have used a ten-node network with multiple asymmetric traffic data sets (partially extracted from an actual network) for our study. It was found that the capacity obtained using the analytic network dimensioning model provides a good estimate of network capacity required for meeting the grade-of-service goal for each service type in each traffic load period; this observation is based on a simulated network environment that uses the proposed admission control and the dynamic routing schemes. Our observation suggests that it may not be not necessary for the dimensioning model to explicitly incorporate an admission control policy, but admission control is needed for network operation to provide desirable grade-of-service     

M-architecture: a structural model of traffic managementand control in broadband ISDNs

A model of multiservice network architecture (M-architecture) is presented. An attempt is made to describe the traffic management and control schemes in a systematic way. The basic concepts are developed, and examples are given that indicate how the proposed framework can be used to solve multiplexing, routing, and flow control problems in the ISDN. The emphasis is on the traffic control schemes. The M-architecture can be regarded as either a reference architecture for future multiservice networks or an abstract model of traffic management and control in currently used networks     

Architecture design,performance analysis and VLSI implementation of a reconfigurable shared buffer for high‐speed switch/router

Modern switches and routers require massive storage space to buffer packets. This becomes more significant as link speed increases and switch size grows. From the memory technology perspective, while DRAM is a good choice to meet capacity requirement, the access time causes problems for high‐speed applications. On the other hand, though SRAM is faster, it is more costly and does not have high storage density. The SRAM/DRAM hybrid architecture provides a good solution to meet both capacity and speed requirements. From the switch design and network traffic perspective, to minimize packet loss, the buffering space allocated for each switch port is normally based on the worst‐case scenario, which is usually huge. However, under normal traffic load conditions, the buffer utilization for such configuration is very low. Therefore, we propose a reconfigurable buffer‐sharing scheme that can dynamically adjust the buffering space for each port according to the traffic patterns and buffer saturation status. The target is to achieve high performance and improve buffer utilization, while not posing much constraint on the buffer speed. In this paper, we study the performance of the proposed buffer‐sharing scheme by both a numerical model and extensive simulations under uniform and non‐uniform traffic conditions. We also present the architecture design and VLSI implementation of the proposed reconfigurable shared buffer using the 0.18 µm CMOS technology. Our results manifest that the proposed architecture can always achieve high performance and provide much flexibility for the high‐speed packet switches to adapt to various traffic patterns. Furthermore, it can be easily integrated into the functionality of port controllers of modern switches and routers. Copyright © 2008 John Wiley & Sons, Ltd.     

The performance analysis and implementation of an input accessscheme in a high-speed packet switch

The performance analysis of an input access scheme in a high-speed packet switch for broadband ISDN is presented. In this switch, each input port maintains a separate queue for each of the outputs, thus n ² input queues in an (n×n) switch. Using synchronous operation, at most one packet per input and output will be transferred in any slot. We derive lower and upper bounds for the throughput which show close to optimal performance. The bounds are very tight and approach to unity for switch sizes on the order of a hundred under any traffic load, which is a significant result by itself. Then the mean packet delay is derived and its variance is bounded. A neural network implementation of this input access scheme is given. The energy function of the network, its optimized parameters and the connection matrix are determined. Simulation results of the neural network fall between the theoretical throughput bounds     

Traffic theory and the Internet

We argue that traffic theory, an essential component in the design of traditional telecommunications networks, should be increasingly applied in the development of the multiservice Internet. We discuss the statistical characteristics of Internet traffic at different time scales. Modeling is facilitated on identifying the notion of flow and distinguishing the categories of streaming and elastic traffic. We review mathematical modeling approaches useful for predicting the relationship between demand, capacity and performance for both streaming and elastic flows. Derived results indicate the limitations of service differentiation as a means for guaranteeing QoS and highlight the importance of traditional traffic engineering approaches in ensuring that the network has sufficient capacity to handle offered demand     

Capacity optimization in multiservice mobile wireless networks with multiple fractional channel reservation

In this paper, the multiple fractional channel reservation (MFCR) strategy for service differentiation is proposed. MFCR overcomes the "integer nature" of traditional channel reservation schemes (also referred to as guard channel, trunk reservation, or cutoff priority) that precludes them to achieve maximum system capacity in single- and multiservice environments. Contrary to the rest of the channel reservation schemes previously proposed in the literature on the topic, MFCR reserves, on average, real numbers of channels to prioritize new and/or handoff calls in multiple service environments. Given a set of requirements on new call blocking and forced termination probabilities for each service type, MFCR maximizes system capacity while meeting the quality of service (QoS) constraints in multiservice mobile cellular networks. It finely controls the communication service quality, by varying the average numbers of reserved channels by a fraction of one. Determining the right amount of resources (cutoff threshold or number of reserved channels) to prioritize each call type and to satisfy all QoS constraints in multiservice environments, however, is a difficult task. Selecting the optimal prioritization order is not an easy process either, as it is affected by QoS constraints, system characteristics, and resource sharing. Thus, an heuristic algorithm to determine the optimum numbers of reserved (resources) channels to achieve maximum system capacity when using the MFCR is also proposed. To our knowledge, the capacity optimization problem considering individual QoS constraints had only been addressed in single service environments. Also, a comprehensive survey on channel reservation strategies proposed in the literature has been included.     

Reservation-based contention resolution mechanism forBatcher-Banyan packet switches

The authors introduce a new method, called ring reservation, to design high-capacity packet switches. Input buffering is used with output port reservations to eliminate packet collisions. They describe a 32×32 prototype packet switch, built as a part of a broadband ISDN prototype, which has a per-port capacity of 30-55 Mbit/s     

Exact admission control for networks with a bounded delay service

To support the requirements for the transmission of continuous media, such as audio and video, multiservice packet-switching networks must provide service guarantees to connections, including guarantees on throughput, network delays, and network delay variations. For the most demanding applications, the network must offer a service which provides deterministically bounded delay guarantees, referred to as “bounded delay service.” The admission control functions in a network with a bounded delay service require `schedulability conditions' that detect violations of delay guarantees in a network switch. Exact schedulability conditions are presented for three packet scheduling methods: earliest-deadline-first (EDF), static-priority (SP), and a novel scheduling method, referred to as rotating-priority-queues (RPQ). By characterizing the worst-case traffic with general subadditive functions, the presented schedulability conditions can be applied to a large class of traffic models. Examples, which include actual MPEG video traces, are presented to demonstrate the trade-offs involved in selecting a packet scheduling method for a bounded delay service     

A simple bandwidth management scheme for multiservice ATM networks

In this paper we outline a simple strategy to manage bandwidth allocation and congestion control and to guarantee service requirements in a multiservice ATM (asynchronous transfer mode) network. We propose a network architecture based on a core network, making available a limited number of quality of service profiles, and an access network, made of edge adapters in charge to match the user's requirements with the network's available quality of service profiles and to shape input traffic to achieve high network throughput. The connection admission rule is presented, and edge adapter architecture and design examples are given. The effectiveness of the scheme is demonstrated by numerical results which report the network utilization performance when the proposed core network policies and edge adapter design apply.     

CCITT Recommendations on the ISDN: A Review

This paper gives a brief overview of the I-Series of Recommendations on the integrated services digital network (ISDN) developed by the International Telephone and Telegraph Consultative Committee (CCITT). This set of Recommendations is printed in the CCITT "Red Book." The I-Series Recommendations represent the first major step towards worldwide harmonization of the fast-growing digital network capabilities in support of multiservice (voice, data, and image) user applications. Over 25 different Recommendations set up standard guidelines and features for service capability, network architecture, and user-network interfaces in the ISDN.     

Adaptive configuration of elastic high speed multiclass networks

Network design is a compromise between two conflicting requirements: high network efficiency and high quality of service (QoS). High efficiency suggests full sharing of network resources. However, in a multiclass network, QoS differentiation among several traffic classes suggests traffic segregation and resource partitioning. High efficiency in a partitioned network can be realized by elastic time-varying partitioning of the network capacity. The network can be laterally divided into bands, and each band may be reconfigured frequently, under the constraint of the fixed total capacity. Rapid partitioning is facilitated by two main developments: the capability of high-speed transfer of control data, and the ease of dynamic partitioning of link capacity. This article describes how elastic network bands are used to realize an efficient network serving heterogeneous traffic. It also discusses the intraband management of independent connections and reserved end-to-end paths so that the connection-request processing load is reduced while a high transport-capacity utilization is maintained     

Switching System Software Design for ISDN

The ISDN offers various services through multipurpose digital subscriber lines. The switching program for the ISDN should be so designed as to realize the control of various voice and nonvoice services and provide for developing service enhancement. To attain the goal, the ISDN services are classified hierarchically and each category is allocated to appropriate network nodes for implementation. As a result, the local switching program provides an out-slot subscriber line signaling capability and call connection with appropriate compatibility checking including a check for access capability to communications processing nodes. The switching program modules specific to analog services and those specific to digital services are separated to allow the use of the existing program file and to afford easy program design and maintenance. Remote-controlled switching is a suitable means for an economical introduction of the ISDN services to low traffic density areas. Special routing and reliability arrangements as well as the program structure for a remote-controlled switch are discussed.     

A multiservice traffic allocation model for LEO satellite communication networks

Modern telecommunication networks are characterized by a heterogeneous mix of traffic classes, ranging from traditional telephone calls to video and data services. Therefore, there is a need to solve the traffic allocation problem with different quality-of-service (QoS) requirements, wherein each traffic demand is fulfilled. This paper investigates the possibility of allocating loaded traffic in a low earth orbital (LEO) satellite network by considering multiservice traffic. Both Poisson and Markov models are used for the incoming traffic, which includes multiservice requirements. By introducing a privilege parameter, a quantum of bandwidth can be reserved for high priority traffic and a better QoS can be given for this traffic. The algorithm performs well for both traffic patterns tested. Simulation results are presented.     

Engineering end-to-end IP resilience usingresilience-differentiated QoS

Network resilience is becoming a key issue in the design of IP-based multimedia and multiservice networks. The current discussion about IP network resilience centers around MPLS-based recovery mechanisms. Any well designed recovery strategy has to take into account the different resilience requirements of the single traffic flows in order to avoid excessive usage of bandwidth for standby links. Faced with multiple recovery options, an ISP or NSP must decide which flows to protect to what extent against network failures. In this article an extension to existing quality of service (QoS) architectures is presented that integrates the signaling of resilience requirements with the traditional QoS signaling. We refer to this extended QoS model as resilience-differentiated QoS (RD-QoS). At the border of MPLS domains, the resilience requirements can then be directly mapped to the appropriate MPLS recovery options. A traffic engineering process for the provisioning of the resilience classes is introduced, and a case study demonstrates the significant network capacity savings achievable via this approach     

Capacity analysis of MediaGrid: a P2P IPTV platform for fiber to the node (FTTN) networks

This paper studies the conditions under which P2P sharing can increase the capacity of IPTV services over FTTN networks. For a typical FTTN network, our study shows a) P2P sharing is not beneficial when the total traffic in a local video office is low; b) P2P sharing increases the load on FTTN switches and routers in local video offices; c) P2P sharing is the most beneficial when the network bottleneck is experienced in the southbound segment of a local video office (equivalently a northbound segment of an FTTN switch); and d) sharing among all FTTN serving communities is not needed when network congestion problems are solved by using some other technologies such as program pre-caching or replication. Based on the analytical results, design for IPTV services which monitors FTTN network conditions and decides when and how to share videos among peers to maximize the service capacity. Simulations and bounds both validate the potential benefits of the MediaGrid IPTV service platform     

Multiservice allocation for multiaccess wireless systems

This paper discusses principles for allocating multiple bearer services onto different subsystems in multiaccess wireless systems. Based on the included subsystem's multiservice capacities, under certain constraints near-optimum subsystem service allocations that maximize combined multiservice capacity are derived through simple optimization procedures. These favorable service allocations are either extreme points where services, as far as possible, are allocated to the subsystems best at supporting them, or they are characterized by the relative efficiency of supporting services being equal in all subsystems. The consequences of this include that services should typically be mixed in subsystems with convex capacity regions and isolated in subsystems with concave capacity regions. Simple user assignment algorithms based on this are also discussed. Additionally, illustrating the main findings of the analysis, some system examples are given, including a case study with combined global system for mobile communications (GSM) and wideband code-division multiple-access (WCDMA) systems. The gain of using the proposed service allocation principles compared to a reference case of maintaining equal service mixes in all subsystems depends on the shape of the subsystem capacity regions; the more different the capacity regions, the larger the gain. In the GSM and WCDMA case study, capacity gains of up to 100% in terms of supported data users for a fixed voice traffic load are achieved.     

Measurement-based performance evaluation of an ATM switch withexternal multicasting engine and multiple-priority classes

This paper uses measurement-based traffic models to evaluate a shared-memory ATM switch with 32×32 155 Mbit/s ports and an external multicasting engine; this is the design of Cisco System's next-generation ATM switch, the LightStream-1010 (LS-1010). Assuming that the multicast traffic can take approximately 30% of the total switch load, we find that an external multicasting engine requires a 32 (8) cell buffer at a replication rate of 16 (64) cells per cell service time. We discover that in a multimedia environment, the shared-memory architecture requires 10-30 times less total memory than the bus architecture; a 64 K cell buffer is sufficient to handle 90% utilization with the nonuniform traffic that we investigated. Multiple-priority classes are considered     

准静止状态下的高空平台实时业务信道分配

受平台准静止状态的影响,高空平台（ HAPS)通信网络内存在大量的切换呼叫,且业务量动态变化。 HAPS网络可传输多种业务,其中实时业务在切换过程中具有较高的时延要求。通过为切换呼叫预留信道可降低平台不稳定对服务质量（ QoS)造成的影响。在基于服务优先级的多业务信道分配算法基础上,重点对实时业务的信道分配算法进行改进,提出了一种基于概率的预留信道借用策略。该算法可根据网络内业务量的实时统计数据控制新呼叫业务的准入。仿真结果表明：与固定预留信道算法和门限预留信道算法相比,该算法能够适应网络内业务量的动态变化,在保证切换呼叫掉线率满足期望值的条件下提升系统的整体性能,降低平台不稳定造成的性能损失。     

Visionen zum Entwurf universeller Kommunikationsnetze von morgen

The design of conventional telecommunications is based on high reliability, availability, security and, most important scarcity, of resources. About 90% of switch software and hardware is needed to comply with these requirements. However, are these assumptions still valid in a world where one fibre can deliver all the traffic in the Austrian switching network, where processing power and storage capacity double every one to one and a half years and where Wi-Fi networks promise ubiquitous wireless broadband access? Internet is an option, but it is not designed for the particularities of voice traffic. This article revisits the underlying design assumptions for today’s telecommunications network and tries to answer the question: How would you design a telecom network if bandwidth, processing power, storage capacity and frequencies were abundant?     

ISDN protocol architecture

IT IS NOW widely recognized that the Integrated Services Digital Network (ISDN) concept is providing a useful framework for the development of future telecommunications networks and services. An ISDN can be regarded as a generalpurpose digital network capable of supporting (or integrating) a wide range of services (voice and non-voice) using a small set of standard multipurpose user-network interfaces. Relevant CCITT Recommendations (or standards) on ISDN interfaces were expected to be available in 1984, the final year of the current study period. This paper reviews CCITT progress on the architectural studies of protocols associated with ISDN's, in particular, the ISDN Protocol Reference Model being developed by Study Group XVIII. This Model, based on the concepts and principles of the ISO/CCITT Open Systems Interconnection (OSI) Reference Model, aims at providing a unified framework for modeling ISDN multiservice communications and capabilities. The new Model is applied to several possible ISDN communications configurations, enabling a number of technical issues to be easily identified.