Virtual Circuit Blocking Probabilities in an ATM Banyan Network with b b Switching Elements
|
|
- Berniece Small
- 5 years ago
- Views:
Transcription
1 Proceedings of the Applied Telecommunication Symposium (part of Advanced Simulation Technologies Conference) Seattle, Washington, USA, April 22 26, 21 Virtual Circuit Blocking Probabilities in an ATM Banyan Network with b b Switching Elements Hongyuan Shi and Harish Sethu {hyshi@io.ece.drexel.edu, sethu@ece.drexel.edu} Department of Electrical and Computer Engineering Drexel University 3141 Chestnut Street, Philadelphia, PA Abstract This paper presents the trade-offs that exist between the blocking probability, the size of the switching elements, the offered load and the link capacities in an ATM-based Banyan multistage interconnection network for QoS-sensitive applications. We present a quasi-analytical study which indicates that, as the link capacity between switching elements is increased, the blocking probability reduces exponentially. We show that, in contrast to what is generally believed, larger switching elements are often, but not always the best design choice. Relevant design recommendations that arise from these results are discussed. The conclusions of this paper are also applicable in non-atm contexts such as in circuit-switched networks with link-dilated topologies, or photonic switching networks using WDM. Keywords ATM, blocking performance, Banyan networks, non-blocking networks, multistage interconnection networks. 1 INTRODUCTION Asynchronous Transfer Mode (ATM) is a connectionoriented data transfer technology, in which communication between any two end-points of the network is accomplished through the establishment of a virtual circuit that allows variable-rate full-duplex transfer of data between them. Each distinct data transfer application uses a separate virtual circuit for the transmission of cells between the communicating entities. For applications such as telephony, achieving good availability of service is a critical component of the overall design objective. For such applications, therefore, a primary goal is to max- This work was supported in part by U.S. Air Force Contract F imize the number of virtual circuits that can be established in the network in a manner that satisfies the performance and quality-of-service requirements of each connection. At the time a request is made for a connection, the network control has to determine if there is a route available with sufficient capacity for an appropriate level of quality of service required for the requested communication. If a connection cannot be established, we say that the request for the virtual circuit is blocked. This paper presents a quasi-analytic study of the dependence of the virtual circuit blocking probability on the sizes of the switching elements, the offered load and the capacity of the physical links in an ATM-based Banyan network. The blocking behavior and the conditions for nonblocking in ATM-based multistage interconnection networks have been analyzed for Clos, Benes and Cantor topologies [3, 5, 6]. The results of these studies validate the widely held belief that the larger the switching element used to construct the network, the smaller the blocking probability. This paper shows that, in Banyan networks, a larger switching element is often, but not always the better design choice as far as blocking probabilities are concerned. Relevant design recommendations that arise from these results are discussed. Section 2 presents the problem statement and derives the minimum link capacity required in an ATM Banyan network to ensure a zero blocking probability. Section 3 describes the quasi-analytic simulation technique, first used recently in an analysis of blocking performance of photonic switching networks [1]. Section 4 presents our simulation results with interpretations. Finally, Section 5 concludes the paper with a brief discussion of the relevance of this work to other contexts in which switchbased multistage interconnection networks are used.
2 networks used in videoservers for video-on-demand applications. The following theorem, a special case of the result in [3], specifies the link capacity, C, required to ensure that the network is non-blocking. Theorem 1 Consider an N N Banyan network using b b switching elements, and physical links of capacity equivalent to C virtual circuits. The network is nonblocking if and only if C K, where, (a) (c) Figure 1: Banyan with (a) 2 2 and (b) 4 4 switching elements; (c) A subset of the Banyan network 2 REQUIREMENT FOR ZERO BLOCKING Given b b switching elements, one can build an N N network using the Banyan topology, if N = b s, where s is the number of stages in the network. For purposes of illustration, Figures 1(a) and (b) show a Banyan topology using 2 2 and 4 4 switching elements, respectively. In this paper, we use the baseline network as the representative banyan topology. We define capacity of a link as the number of virtual circuits that can be simultaneously supported on the physical link. This capacity is a function of the physical bandwidth that the link can support and the bandwidth requirements of each virtual circuit. Let C be the capacity of the physical links in an ATM network. When a switching element receives a virtual connection setup request over a certain physical link, it has to ensure that no more than C circuits have already been established. If C circuits are already established, the connection request is said to be blocked. We assume that each inlet link or outlet link can support only one connection at any given instant of time, which is the case in many implementations of ATM-based LANs and also in ATM-based (b) K = { N, if logb N is even. Nb, if log b N is odd. (1) Proof: A given physical link in the network will never block a connection request, if it is able to support all the virtual circuits that may possibly use this link. Define the weight of a link as the maximum number of connections that may use this link at any given instant. The minimum link capacity required for the non-blocking property is the largest weight of all the links in the network. When log b N is even, it is easily observed that links with the largest weights are those between the middle two stages of the network. When log b N is odd, the links with the largest weight are the ones connected to the middle stage switches. For example, the links shown with thicker lines in Figure 1(c) are two of the links with the largest weights in a Banyan network. This figure shows only the switches and links in the paths that may use these two links. Since only one connection can be established from an inlet to any outlet, the weight of a link is the smaller of the total number of inlets and the total number of outlets that can be reached from the link. It is obvious from this figure that the weight of the left one of the two links is just the total number of inlets in the network that can be reached from this link. Similarly, the weight of the right one of these two links is the total number of outlets of the network that can be reached from this link. Consider a tree with its root as one of the links with the largest weight in the network. Assume, without loss of generality, that the number of inlets reachable from this link is less than or equal to the number of outlets reachable from this link. Let the leaves of this tree be the inlets of the network that can be reached from this link. Let all the intermediate nodes in the network be the links on the paths between the inlets of the network and the link with the largest weight. Clearly, this is a tree in which the root and all the intermediate nodes have exactly b children. The partial network in Figure 1(c) provides a pictorial analogy with the tree for b = 2 and N = 128. Now, the minimum capacity required for the non-blocking property is the number of leaves in this tree.
3 Table 1: Capacity Requirements for a Nonblocking N N Network Using b b Switching Elements b N Not counting the root of the tree, the total number of levels of the tree is (log b N)/2 when log b N is even, and (log b N 1)/2 when log b N is odd. When log b N is even, therefore, the number of leaves in the tree is b (log b N)/2 = N. When log b N is odd, the number of leaves is b (log b N 1)/2 = N/b. Table 1 lists the minimum link capacities required for the non-blocking property for various values of N and b. Note from the table, that a network with link capacities equivalent to 4 virtual circuits, has zero blocking probability with 4 4 switching elements, but a non-zero blocking probability with 8 8 switching elements. A similar phenomenon of smaller switching elements leading to a lower blocking probability is observed in the network with 4 4 switching elements. In the above theorem, we have assumed the same link capacity at each stage of the network. This is because, in order to achieve cost-effectiveness with the least possible number of different parts, most commercial switching systems use identical switching elements and, therefore, also have the same link capacity at each stage. A few specific design recommendations are easily derived based on the entries in Table 1. For example, when the link capacities are equivalent to 4 virtual circuits, a network is best designed using 4 4 switching elements rather than 8 8 switching elements. When the link capacities are smaller, the size of switching elements to use is not quite obvious and can only be determined based on evaluations of blocking probabilities described in the next two sections. In the vast majority of cases, use of larger switching elements is a better design choice since it improves the throughput and thus the capacity of the links. However, as can be observed from Table 1 for and networks, a larger switching element as the building block is not always the better choice. 3 METHODOLOGY In this section, we describe the quasi-analytic simulation technique, first used in [1], to evaluate the blocking probabilities. We model connection setup requests by a Poisson process with an arrival rate of λ from each source. The utilization factor, ρ, of the network is given by (λ/µ)(1 P B ), where µ is the service rate, and P B is the blocking probability of the network. In our study, we use a normalized service rate equal to 1, i.e., µ = 1. The offered load, λ/µ, therefore is equal to λ. For an N N network, P B = N 1 k= P B k P k where, P k is the probability that k virtual circuits are established in the network, and P B k is the conditional probability that a connection is blocked while k virtual circuits are already established. The quantity P k is given by, ( ) N P k = ρ k (1 ρ) N k, k < N k Random permutations of source-destination pairs are generated in random order. Two counters are maintained for each value of k, k < N. The pass counter, p k is incremented whenever a (k + 1)-th connection is established, and the reject counter, r k is incremented whenever a (k +1)-th connection request is rejected (i.e., blocked). The following equation then gives us the conditional blocking probability given k connections are already established. P B k = r k p k 1 As described in [1], P B and ρ can now be computed iteratively starting with an assumed value of ρ. 4 SIMULATION RESULTS This section presents simulation results using a interconnection network in a Banyan topology, using 2 2, 4 4 and 8 8 switching elements. Figure 2(a) plots the blocking probabilities in this network against the normalized offered load. This figure is plotted assuming that each physical link between switching elements can support no more than 2 virtual circuits. As can be observed from this figure, use of larger switching elements, in this case, reduces the blocking probabilities at all offered loads. Figure 2(b) plots the blocking probabilities
4 Blocking Probability Blocking Probability (a) Normalized Offered Load (b) Normalized Offered Load Figure 2: (a) P B vs. offered load, C = 2; (b) P B vs. offered load, C = 3. for the same Banyan network, but assuming link capacities of 3 virtual circuits per link. This figure is different from Figure 2(a) with respect to the relative performances of networks using 4 4 and 8 8 switching elements. The blocking probability using 4 4 switches, as indicated in this figure, is slightly better than that with 8 8 switch chips. This further illustrates the fact that the use of larger size switching elements does not necessarily lead to an improvement in the blocking probability. Figure 3 plots the blocking probabilities for the same Banyan network, against the link capacity, at an offered load of.7. Recall that we measure link capacity by the number of virtual circuits that can be supported on the link. As can be observed from Figure 3, the blocking probabilities decrease exponentially as the link capacity increases. For example, a network using 2 2 switches with link capacities equal to 5 virtual circuits has a blocking probability about 34 times as small as with link capacities equal to 4 virtual circuits. This fig- Blocking Probability Blocking probability of a 64 x 64 network based on is, with 4 VCs per link Number of VCs per link Figure 3: P B vs. link capacity, λ/µ =.7. ure suggests that increasing link capacities, as opposed to using larger switching elements, is almost always a better design choice (except when the switch size is increased to b b and log b N is odd). This is simply because using switch architectures that can be implemented in today s VLSI chips, high throughputs of 95% or more can already be achieved with 2 2 ATM switching elements [7]. A larger switching element therefore can only lead to a small increase in the throughput, resulting in only a small increase in the link capacity. 5 CONCLUDING REMARKS This paper shows that an N N ATM Banyan network using b b switching elements is non-blocking if and only if each physical link between the switching elements can support K virtual circuits, where K = N if log b N is even, and N/b otherwise. In blocking networks, using a recently developed quasi-analytic method, we have quantified the trade-offs between the blocking probability, the size of switching elements, the offered load and the link capacities for a representative network. These results can be used to develop design recommendations on the bandwidth of the links and the size of switching elements to use in the design of an ATM-based Banyan network. The most interesting aspect of these trade-offs is that the use of larger switching elements in the design of a network does not always guarantee a lower blocking probability. Finally, the work presented in this paper is also relevant in some non-atm contexts. For example, each link with capacity C may be thought of as multiple links of capacity 1. Thus, the results of this paper can also
5 be applied to circuit-switched networks with link-dilated topologies. In addition, these results are also valid in the analysis of blocking probabilities in optical Banyanbased networks using Wavelength Division Multiplexing (WDM) and switching devices that include wavelength converters. References [1] M. M. Vaez and C.-T. Lea, Blocking performance with crosstalk consideration of the photonic switching networks based on electro-optical directional couplers, Journal of Lightwave Technology, vol. 17, no. 3, pp , March [2] C.-T. Lea, Multi-log 2 N networks and their applications in high-speed electronic and photonic switching systems, IEEE Transactions on Communications, vol. 38, no. 1, pp , October 199. [3] R. Melen and J. S. Turner, Nonblocking Networks for Fast Packet Switching, Proceedings of IEEE INFOCOM, vol.2, [4] C. P. Kruskal and M. Snir, The performance of multistage interconnection networks for multiprocessors, IEEE Transactions on Computers, vol. 82, no. 12, pp , December [5] S. C. Liew, M.-H. Ng and C. W. Chan, Blocking and Nonblocking Multirate Clos Switching Networks, IEEE/ACM Transactions of Networking, vol. 6, no. 3, pp , June [6] E. Valdimarsson, Blocking in Multirate Interconnection Networks, IEEE/ACM Transactions on Communications, vol. 42, no. 2/3/4, pp , February/March/April [7] M. Katevenis, D. Serpanos and E. Spyridakis, Credit-Flow-Controlled ATM for MP Interconnection: The ATLAS I Single-Chip ATM Switch, Proceedings of 4th Int l Symp. High Performance Computer Architecture, [8] A. Pattavina, Switching Theory, John Wiley & Sons, Inc., New York, NY, 1998.
FB(9,3) Figure 1(a). A 4-by-4 Benes network. Figure 1(b). An FB(4, 2) network. Figure 2. An FB(27, 3) network
Congestion-free Routing of Streaming Multimedia Content in BMIN-based Parallel Systems Harish Sethu Department of Electrical and Computer Engineering Drexel University Philadelphia, PA 19104, USA sethu@ece.drexel.edu
More informationDesign of Optical Burst Switches based on Dual Shuffle-exchange Network and Deflection Routing
Design of Optical Burst Switches based on Dual Shuffle-exchange Network and Deflection Routing Man-Ting Choy Department of Information Engineering, The Chinese University of Hong Kong mtchoy1@ie.cuhk.edu.hk
More informationA Path Decomposition Approach for Computing Blocking Probabilities in Wavelength-Routing Networks
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 8, NO. 6, DECEMBER 2000 747 A Path Decomposition Approach for Computing Blocking Probabilities in Wavelength-Routing Networks Yuhong Zhu, George N. Rouskas, Member,
More informationPerformance of Multihop Communications Using Logical Topologies on Optical Torus Networks
Performance of Multihop Communications Using Logical Topologies on Optical Torus Networks X. Yuan, R. Melhem and R. Gupta Department of Computer Science University of Pittsburgh Pittsburgh, PA 156 fxyuan,
More informationA quasi-nonblocking self-routing network which routes packets in log 2 N time.
A quasi-nonblocking self-routing network which routes packets in log 2 N time. Giuseppe A. De Biase Claudia Ferrone Annalisa Massini Dipartimento di Scienze dell Informazione, Università di Roma la Sapienza
More informationUnavoidable Constraints and Collision Avoidance Techniques in Performance Evaluation of Asynchronous Transmission WDMA Protocols
1th WEA International Conference on COMMUICATIO, Heraklion, reece, July 3-5, 8 Unavoidable Constraints and Collision Avoidance Techniques in Performance Evaluation of Asynchronous Transmission WDMA Protocols
More informationA Heuristic Algorithm for Designing Logical Topologies in Packet Networks with Wavelength Routing
A Heuristic Algorithm for Designing Logical Topologies in Packet Networks with Wavelength Routing Mare Lole and Branko Mikac Department of Telecommunications Faculty of Electrical Engineering and Computing,
More informationA New Architecture for Multihop Optical Networks
A New Architecture for Multihop Optical Networks A. Jaekel 1, S. Bandyopadhyay 1 and A. Sengupta 2 1 School of Computer Science, University of Windsor Windsor, Ontario N9B 3P4 2 Dept. of Computer Science,
More informationLiterature Survey of nonblocking network topologies
Literature Survey of nonblocking network topologies S.UMARANI 1, S.PAVAI MADHESWARI 2, N.NAGARAJAN 3 Department of Computer Applications 1 Department of Computer Science and Engineering 2,3 Sakthi Mariamman
More informationComparative Study of blocking mechanisms for Packet Switched Omega Networks
Proceedings of the 6th WSEAS Int. Conf. on Electronics, Hardware, Wireless and Optical Communications, Corfu Island, Greece, February 16-19, 2007 18 Comparative Study of blocking mechanisms for Packet
More informationMULTICAST CONNECTION CAPACITY OF WDM SWITCHING NETWORKS WITHOUT WAVELENGTH CONVERSION
MULTICAST CONNECTION CAPACITY OF WDM SWITCHING NETWORKS WITHOUT WAVELENGTH CONVERSION B. CHIDHAMBARARAJAN a,1 K.KALAMANI a,2 N. NAGARAJAN b,2 S.K.SRIVATSA a,3 Department of Electronics and Communication
More informationA SIMULATION STUDY OF THE IMPACT OF SWITCHING SYSTEMS ON SELF-SIMILAR PROPERTIES OF TRAFFIC. Yunkai Zhou and Harish Sethu
Proceedings of the IEEE Workshop on Statistical Signal and Array Processing Pocono Manor, Pennsylvania, USA, August 14 16, 2000 A SIMULATION STUDY OF THE IMPACT OF SWITCHING SYSTEMS ON SELF-SIMILAR PROPERTIES
More informationReliability Analysis of Modified Irregular Augmented Shuffle Exchange Network (MIASEN)
www.ijcsi.org https://doi.org/10.20943/01201703.5964 59 Reliability Analysis of Modified Irregular Augmented Shuffle Exchange Network (MIASEN) Shobha Arya 1 and Nipur Singh 2 1,2 Department of Computer
More informationDelayed reservation decision in optical burst switching networks with optical buffers
Delayed reservation decision in optical burst switching networks with optical buffers G.M. Li *, Victor O.K. Li + *School of Information Engineering SHANDONG University at WEIHAI, China + Department of
More informationPrioritized Shufflenet Routing in TOAD based 2X2 OTDM Router.
Prioritized Shufflenet Routing in TOAD based 2X2 OTDM Router. Tekiner Firat, Ghassemlooy Zabih, Thompson Mark, Alkhayatt Samir Optical Communications Research Group, School of Engineering, Sheffield Hallam
More informationSIMULATION OF PACKET DATA NETWORKS USING OPNET
SIMULATION OF PACKET DATA NETWORKS USING OPNET Nazy Alborz, Maryam Keyvani, Milan Nikolic, and Ljiljana Trajkovic * School of Engineering Science Simon Fraser University Vancouver, British Columbia, Canada
More informationBROADBAND AND HIGH SPEED NETWORKS
BROADBAND AND HIGH SPEED NETWORKS ATM SWITCHING ATM is a connection-oriented transport concept An end-to-end connection (virtual channel) established prior to transfer of cells Signaling used for connection
More informationNetwork Topology Control and Routing under Interface Constraints by Link Evaluation
Network Topology Control and Routing under Interface Constraints by Link Evaluation Mehdi Kalantari Phone: 301 405 8841, Email: mehkalan@eng.umd.edu Abhishek Kashyap Phone: 301 405 8843, Email: kashyap@eng.umd.edu
More informationCS343: Data Communication Switched Communication Network
CS343: Data Communication Switched Communication Network by Dr. Manas Khatua Assistant Professor Dept. of CSE IIT Guwahati E-mail: manaskhatua@iitg.ac.in Switched Communication Network Broader aspect interconnecting
More informationAnalyzing the performance of optical multistage interconnection networks with limited crosstalk
Cluster Comput (007) 10: 1 50 DOI 10.1007/s10586-007-0018-7 Analyzing the performance of optical multistage interconnection networks with limited crosstalk Ajay K. Katangur Somasheker Akkaladevi Yi Pan
More informationOn-Line Routing in WDM-TDM Switched Optical Mesh Networks
On-Line Routing in WDM-TDM Switched Optical Mesh Networks Arun Vishwanath and Weifa Liang Department of Computer Science The Australian National University Canberra, ACT-0200, Australia Email: {arunv,wliang}@cs.anu.edu.au
More informationWAVELENGTH-DIVISION multiplexing (WDM) partitions
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 5, NO. 5, OCTOBER 1997 719 Channel Sharing in Multi-Hop WDM Lightwave Networks: Do We Need More Channels? Srini B. Tridandapani, Member, IEEE, Biswanath Mukherjee,
More informationAccurate modelling of the queueing behaviour of shared bu!er ATM switches
INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS Int. J. Commun. Syst. 12, 297}308 (1999) Accurate modelling of the queueing behaviour of shared bu!er ATM switches Mahmoud Saleh and Mohammed Atiquzzaman*
More informationPerformance analysis of realistic optical time division multiplexed wavelength routed networks. Creative Commons: Attribution 3.0 Hong Kong License
Title Performance analysis of realistic optical time division multiplexed wavelength routed networks Author(s) Li, CY; Li, G; Wai, PKA; Li, VOK Citation The 8th IEEE Annual Workshop on Computer Communications
More information3log 2 B Fiber Delay Lines
Constructing Optical LIFO Buffers of Size B with 3log 2 B Fiber Delay Lines Xiaoliang Wang, Xiaohong Jiang Graduate School of Information Sciences Tohoku University Sendai, Japan 980-8579 Email: {waxili,jiang}@ecei.tohoku.ac.jp
More informationSwitch Fabrics. Switching Technology S P. Raatikainen Switching Technology / 2006.
Switch Fabrics Switching Technology S38.3165 http://www.netlab.hut.fi/opetus/s383165 L4-1 Switch fabrics Basic concepts Time and space switching Two stage switches Three stage switches Cost criteria Multi-stage
More informationn = 2 n = 2 n = 1 n = 1 λ 12 µ λ λ /2 λ /2 λ22 λ 22 λ 22 λ n = 0 n = 0 λ 11 λ /2 0,2,0,0 1,1,1, ,0,2,0 1,0,1,0 0,2,0,0 12 1,1,0,0
A Comparison of Allocation Policies in Wavelength Routing Networks Yuhong Zhu a, George N. Rouskas b, Harry G. Perros b a Lucent Technologies, Acton, MA b Department of Computer Science, North Carolina
More informationMulticast Scheduling in WDM Switching Networks
Multicast Scheduling in WDM Switching Networks Zhenghao Zhang and Yuanyuan Yang Dept. of Electrical & Computer Engineering, State University of New York, Stony Brook, NY 11794, USA Abstract Optical WDM
More informationIntroduction to ATM Technology
Introduction to ATM Technology ATM Switch Design Switching network (N x N) Switching network (N x N) SP CP SP CP Presentation Outline Generic Switch Architecture Specific examples Shared Buffer Switch
More informationMulticonfiguration Multihop Protocols: A New Class of Protocols for Packet-Switched WDM Optical Networks
Multiconfiguration Multihop Protocols: A New Class of Protocols for Packet-Switched WDM Optical Networks Jason P. Jue, Member, IEEE, and Biswanath Mukherjee, Member, IEEE Abstract Wavelength-division multiplexing
More informationDistributed Traffic Adaptive Wavelength Routing in IP-Over- WDM networks
Distributed Traffic Adaptive Wavelength Routing in IP-Over- WDM networks Balaji Palanisamy, T. Siva Prasad, N.Sreenath 1 Department of Computer Science & Engineering and Information technology Pondicherry
More informationPerformance of Multi Hop Communications Using Logical Topologies on Optical Torus Networks
Performance of Multi Hop Communications Using Logical Topologies on Optical Torus Networks Xin Yuan Rami Melhem Rajiv Gupta Dept. of Computer Science Dept. of Computer Science Dept. of Computer Science
More informationSIMULATION OF PACKET DATA NETWORKS USING OPNET
Nazy Alborz Maryam Keyvani Milan Nikolic Ljiljana Trajkovic SIMULATION OF PACKET DATA NETWORKS USING OPNET TM Communication Networks Laboratory School of Engineering Science Simon Fraser University Road
More informationSwitching Technology S38.165
Switching Technology S38.165 Pertti Raatikainen VTT Information Technology pertti.raatikainen@vtt.fi L1-1 General Lecturer: Pertti Raatikainen, research professor /VTT email: pertti.raatikainen@vtt.fi
More informationThreats in Optical Burst Switched Network
Threats in Optical Burst Switched Network P. Siva Subramanian, K. Muthuraj Department of Computer Science & Engineering, Pondicherry Engineering College, Pondicherry, India siva.sarathy@pec.edu, muthuraj@pec.edu
More informationCost-Effective Traffic Grooming in WDM Rings
618 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 8, NO. 5, OCTOBER 2000 Cost-Effective Traffic Grooming in WDM Rings Ornan Gerstel, Member, IEEE, Rajiv Ramaswami, Fellow, IEEE, and Galen H. Sasaki, Member,
More informationModule 1. Introduction. Version 2, CSE IIT, Kharagpur
Module 1 Introduction Version 2, CSE IIT, Kharagpur Introduction In this module we shall highlight some of the basic aspects of computer networks in two lessons. In lesson 1.1 we shall start with the historical
More informationTerabit Burst Switching Progress Report (6/98 9/98)
Terabit Burst Switching Progress Report (/98 9/98) Jonathan S. Turner jst@cs.wustl.edu WUCS-98-3 December 9 1998 Department of Computer Science Campus Box 145 Washington University One Brookings Drive
More informationHigh-Speed Cell-Level Path Allocation in a Three-Stage ATM Switch.
High-Speed Cell-Level Path Allocation in a Three-Stage ATM Switch. Martin Collier School of Electronic Engineering, Dublin City University, Glasnevin, Dublin 9, Ireland. email address: collierm@eeng.dcu.ie
More informationEXAMINING OF RECONFIGURATION AND REROUTING APPROACHES: WDM NETWORKS
International Journal of Information Technology and Knowledge Management January-June 2012, Volume 5, No. 1, pp. 69-72 EXAMINING OF RECONFIGURATION AND REROUTING APPROACHES: WDM NETWORKS Sushil Chaturvedi
More informationARITHMETIC operations based on residue number systems
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II: EXPRESS BRIEFS, VOL. 53, NO. 2, FEBRUARY 2006 133 Improved Memoryless RNS Forward Converter Based on the Periodicity of Residues A. B. Premkumar, Senior Member,
More informationEquivalent Permutation Capabilities Between Time-Division Optical Omega Networks and Non-Optical Extra-Stage Omega Networks
518 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 9, NO. 4, AUGUST 2001 Equivalent Permutation Capabilities Between Time-Division Optical Omega Networks and Non-Optical Extra-Stage Omega Networks Xiaojun Shen,
More informationRouting Algorithms, Process Model for Quality of Services (QoS) and Architectures for Two-Dimensional 4 4 Mesh Topology Network-on-Chip
Routing Algorithms, Process Model for Quality of Services (QoS) and Architectures for Two-Dimensional 4 4 Mesh Topology Network-on-Chip Nauman Jalil, Adnan Qureshi, Furqan Khan, and Sohaib Ayyaz Qazi Abstract
More information4.2 Virtual Circuit and Datagram Networks
4.2 VIRTUAL CIRCUIT AND DATAGRAM NETWORKS 313 Available bit rate (ABR) ATM network service. With the Internet offering socalled best-effort service, ATM s ABR might best be characterized as being a slightly-better-than-best-effort
More informationTeletraffic theory (for beginners)
Teletraffic theory (for beginners) samuli.aalto@hut.fi teletraf.ppt S-38.8 - The Principles of Telecommunications Technology - Fall 000 Contents Purpose of Teletraffic Theory Network level: switching principles
More informationAnalysis and Algorithms for Partial Protection in Mesh Networks
Analysis and Algorithms for Partial Protection in Mesh Networks Greg uperman MIT LIDS Cambridge, MA 02139 gregk@mit.edu Eytan Modiano MIT LIDS Cambridge, MA 02139 modiano@mit.edu Aradhana Narula-Tam MIT
More informationLecture 7. Reminder: Homework 2, Programming Project 1 due today. Homework 3, Programming Project 2 out, due Thursday next week. Questions?
Lecture 7 Reminder: Homework 2, Programming Project 1 due today. Homework 3, Programming Project 2 out, due Thursday next week. Questions? Thursday, September 15 CS 475 Networks - Lecture 7 1 Outline Chapter
More informationRead Chapter 4 of Kurose-Ross
CSE 422 Notes, Set 4 These slides contain materials provided with the text: Computer Networking: A Top Down Approach,5th edition, by Jim Kurose and Keith Ross, Addison-Wesley, April 2009. Additional figures
More informationPerformance Analysis of the Signaling Channels of OBS Switches
296 Performance Analysis of the ignaling Channels of OB witches Hulusi YAHYAGİL A.Halim ZAİM M.Ali AYDIN Ö.Can TURNA İstanbul University, Computer Engineering Department, Avcılar İstanbul, TURKEY Abstract
More informationClustering-Based Distributed Precomputation for Quality-of-Service Routing*
Clustering-Based Distributed Precomputation for Quality-of-Service Routing* Yong Cui and Jianping Wu Department of Computer Science, Tsinghua University, Beijing, P.R.China, 100084 cy@csnet1.cs.tsinghua.edu.cn,
More informationATM SWITCH: As an Application of VLSI in Telecommunication System
Volume-6, Issue-6, November-December 2016 International Journal of Engineering and Management Research Page Number: 87-94 ATM SWITCH: As an Application of VLSI in Telecommunication System Shubh Prakash
More informationNetwork Model for Delay-Sensitive Traffic
Traffic Scheduling Network Model for Delay-Sensitive Traffic Source Switch Switch Destination Flow Shaper Policer (optional) Scheduler + optional shaper Policer (optional) Scheduler + optional shaper cfla.
More informationOPTICAL NETWORKS. Virtual Topology Design. A. Gençata İTÜ, Dept. Computer Engineering 2005
OPTICAL NETWORKS Virtual Topology Design A. Gençata İTÜ, Dept. Computer Engineering 2005 Virtual Topology A lightpath provides single-hop communication between any two nodes, which could be far apart in
More information100 Gbit/s Computer Optical Interconnect
100 Gbit/s Computer Optical Interconnect Ivan Glesk, Robert J. Runser, Kung-Li Deng, and Paul R. Prucnal Department of Electrical Engineering, Princeton University, Princeton, NJ08544 glesk@ee.princeton.edu
More informationAutomatic Service and Protection Path Computation - A Multiplexing Approach
Automatic Service and Protection Path Computation - A Multiplexing Approach Loay Alzubaidi 1, Ammar El Hassan 2, Jaafar Al Ghazo 3 1 Department of Computer Engineering & Science, Prince Muhammad bin Fahd
More informationLow pass filter/over drop avoidance (LPF/ODA): an algorithm to improve the response time of RED gateways
INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS Int. J. Commun. Syst. 2002; 15:899 906 (DOI: 10.1002/dac.571) Low pass filter/over drop avoidance (LPF/ODA): an algorithm to improve the response time of
More informationDynamic service Allocation with Protection Path
www.ijcsi.org 115 Dynamic service Allocation with Protection Path Loay Alzubaidi Department of Computer Engineering & Science, Prince Muhammad bin Fahd University AL-Khobar, Saudi Arabia Abstract Path
More informationFlexible Bandwidth Provisioning in WDM Networks by Fractional Lambda Switching
Flexible Bandwidth Provisioning in WDM Networks by Fractional Lambda Switching Achille Pattavina, Donato Grieco Politecnico di Milano, Milano, Italy e-mail: pattavina@elet.polimi.it Yoram Ofek Synchrodyne
More informationOptical networking technology
1 Optical networking technology Technological advances in semiconductor products have essentially been the primary driver for the growth of networking that led to improvements and simplification in the
More informationEdge Switch. setup. reject. delay. setup. setup ack. offset. burst. burst. release. φ l. long burst. short burst. idle. p s
Performance Modeling of an Edge Optical Burst Switching ode Lisong Xu, Harry G Perros, George Rouskas Computer Science Department orth Carolina State University Raleigh, C 27695-7534 E-mail: flxu2,hp,rouskasg@cscncsuedu
More informationBuffered Fixed Routing: A Routing Protocol for Real-Time Transport in Grid Networks
JOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 18, NO. 6, JUNE 2000 757 Buffered Fixed Routing: A Routing Protocol for Real-Time Transport in Grid Networks Jinhan Song and Saewoong Bahk Abstract In this paper we
More informationHybrid On-chip Data Networks. Gilbert Hendry Keren Bergman. Lightwave Research Lab. Columbia University
Hybrid On-chip Data Networks Gilbert Hendry Keren Bergman Lightwave Research Lab Columbia University Chip-Scale Interconnection Networks Chip multi-processors create need for high performance interconnects
More informationA New Algorithm for the Distributed RWA Problem in WDM Networks Using Ant Colony Optimization
A New Algorithm for the Distributed RWA Problem in WDM Networks Using Ant Colony Optimization Víctor M. Aragón, Ignacio de Miguel, Ramón J. Durán, Noemí Merayo, Juan Carlos Aguado, Patricia Fernández,
More informationECE 697J Advanced Topics in Computer Networks
ECE 697J Advanced Topics in Computer Networks Switching Fabrics 10/02/03 Tilman Wolf 1 Router Data Path Last class: Single CPU is not fast enough for processing packets Multiple advanced processors in
More informationSharing Tunable Wavelength Converters in AWG-based IP Optical Switching Nodes
Sharing Tunable Wavelength Converters in AWG-based IP Optical Switching Nodes Achille Pattavina, Marica Rebughini, Antonio Sipone Dept. of Electronics and Information, Politecnico di Milano, Italy {pattavina}@elet.polimi.it
More informationScalable Schedulers for High-Performance Switches
Scalable Schedulers for High-Performance Switches Chuanjun Li and S Q Zheng Mei Yang Department of Computer Science Department of Computer Science University of Texas at Dallas Columbus State University
More informationNew QoS Measures for Routing and Wavelength Assignment in WDM Networks
New QoS Measures for Routing and Wavelength Assignment in WDM Networks Shi Zhong Xu and Kwan L. Yeung Department of Electrical & Electronic Engineering The University of Hong Kong Pokfulam, Hong Kong Abstract-A
More informationA 3-stage CLOS architecture for high-throughput optical packet switching
Invited Paper A 3-stage CLOS architecture for high-throughput optical packet switching H.J.S. Dorren, Nicola Calabretta and Oded Raz COBRA Research Institute, Eindhoven University of Technology, P.O. Box
More informationResearch on Control Routing Technology in Communication Network
Appl. Math. Inf. Sci. 6 No. 1S pp. 129S-133S (2012) Applied Mathematics & Information Sciences An International Journal @ 2012 NSP Natural Sciences Publishing Cor. Research on Control Routing Technology
More informationA Proposal for a High Speed Multicast Switch Fabric Design
A Proposal for a High Speed Multicast Switch Fabric Design Cheng Li, R.Venkatesan and H.M.Heys Faculty of Engineering and Applied Science Memorial University of Newfoundland St. John s, NF, Canada AB X
More informationDynamic Wavelength Assignment for WDM All-Optical Tree Networks
Dynamic Wavelength Assignment for WDM All-Optical Tree Networks Poompat Saengudomlert, Eytan H. Modiano, and Robert G. Gallager Laboratory for Information and Decision Systems Massachusetts Institute of
More informationA Modified Heuristic Approach of Logical Topology Design in WDM Optical Networks
Proceedings of the International Conference on Computer and Communication Engineering 008 May 3-5, 008 Kuala Lumpur, Malaysia A Modified Heuristic Approach of Logical Topology Design in WDM Optical Networks
More informationCrossbar - example. Crossbar. Crossbar. Combination: Time-space switching. Simple space-division switch Crosspoints can be turned on or off
Crossbar Crossbar - example Simple space-division switch Crosspoints can be turned on or off i n p u t s sessions: (,) (,) (,) (,) outputs Crossbar Advantages: simple to implement simple control flexible
More informationAn Architecture for Broadband Virtual Networks Under Customer Control
An Architecture for Broadband Virtual Networks Under Customer Control Mun Choon Chan, Hisaya Hadama* and Rolf Stadler Center for Telecommunications Research Columbia University, New York, N. Y, USA {mcchan,
More informationPacket Switching. Hongwei Zhang Nature seems to reach her ends by long circuitous routes.
Problem: not all networks are directly connected Limitations of directly connected networks: limit on the number of hosts supportable limit on the geographic span of the network Packet Switching Hongwei
More informationAE64 TELECOMMUNICATION SWITCHING SYSTEMS JUNE Q2 (a) Write short notes on (a) uniselector and (b) two motion selector.
Q2 (a) Write short notes on (a) uniselector and (b) two motion selector. Uniselectors. A uniselector is a one which has a single rotary switch with a bank of contacts. Depending upon the number of switching
More informationAn Enhanced Dynamic Packet Buffer Management
An Enhanced Dynamic Packet Buffer Management Vinod Rajan Cypress Southeast Design Center Cypress Semiconductor Cooperation vur@cypress.com Abstract A packet buffer for a protocol processor is a large shared
More informationIEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 21, NO. 7, SEPTEMBER
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 21, NO. 7, SEPTEMBER 2003 1173 A Comprehensive Study on Next-Generation Optical Grooming Switches Keyao Zhu, Student Member, IEEE, Hui Zang, Member,
More informationPerformance of Multi-hop Communications Using Logical Topologies on Optical Torus Networks 1
Journal of Parallel and Distributed Computing 61, 748766 (2001) doi:10.1006jpdc.2000.1711, available online at http:www.idealibrary.com on Performance of Multi-hop Communications Using Logical Topologies
More informationSplitter Placement in All-Optical WDM Networks
plitter Placement in All-Optical WDM Networks Hwa-Chun Lin Department of Computer cience National Tsing Hua University Hsinchu 3003, TAIWAN heng-wei Wang Institute of Communications Engineering National
More informationScalable crossbar network: a non-blocking interconnection network for large-scale systems
J Supercomput DOI 10.1007/s11227-014-1319-2 Scalable crossbar network: a non-blocking interconnection network for large-scale systems Fathollah Bistouni Mohsen Jahanshahi Springer Science+Business Media
More informationIEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 54, NO. 2, FEBRUARY
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 54, NO. 2, FEBRUARY 2008 623 Multicast Capacity of Packet-Switched Ring WDM Networks Michael Scheutzow, Martin Reisslein, Senior Member, IEEE, Martin Maier,
More informationRunning Head: NETWORKING 1
Running Head: NETWORKING 1 Switches and Bridges - Comparison and Contrast [Name of the Writer] [Name of the Institution] NETWORKING 2 Switches and Bridges Introduction This paper presents a comparison
More informationPERFORMANCE AND IMPLEMENTATION OF 4x4 SWITCHING NODES IN AN INTERCONNECTION NETWORK FOR PASM
PERFORMANCE AND IMPLEMENTATION OF 4x4 SWITCHING NODES IN AN INTERCONNECTION NETWORK FOR PASM Robert J. McMillen, George B. Adams III, and Howard Jay Siegel School of Electrical Engineering, Purdue University
More informationIP Bandwidth on Demand and Traffic Engineering via Multi-Layer Transport Networks. Dr. Greg M. Bernstein Grotto Networking 2004
IP Bandwidth on Demand and Traffic Engineering via Multi-Layer Transport Networks Dr. Greg M. Bernstein Grotto Networking Page - 1 Problem Scope Bandwidth on Demand Medium to high speed bandwidth demands
More informationA NEW APPROACH FOR BROADBAND BACKUP LINK TO INTERNET IN CAMPUS NETWORK ENVIRONMENT
A NEW APPROACH FOR BROADBAND BACKUP LINK TO INTERNET IN CAMPUS NETWORK ENVIRONMENT Mohd Nazri Ismail Faculty of MIIT, University of Kuala Lumpur (UniKL), MALAYSIA, mnazrii@miit.unikl.edu.my Abstract Most
More informationCONGESTION CONTROL BY USING A BUFFERED OMEGA NETWORK
IADIS International Conference on Applied Computing CONGESTION CONTROL BY USING A BUFFERED OMEGA NETWORK Ahmad.H. ALqerem Dept. of Comp. Science ZPU Zarka Private University Zarka Jordan ABSTRACT Omega
More informationApplication Layer Multicast Algorithm
Application Layer Multicast Algorithm Sergio Machado Universitat Politècnica de Catalunya Castelldefels Javier Ozón Universitat Politècnica de Catalunya Castelldefels Abstract This paper presents a multicast
More informationCompositional Schedulability Analysis of Hierarchical Real-Time Systems
Compositional Schedulability Analysis of Hierarchical Real-Time Systems Arvind Easwaran, Insup Lee, Insik Shin, and Oleg Sokolsky Department of Computer and Information Science University of Pennsylvania,
More informationCOPYRIGHTED MATERIAL INTRODUCTION AND OVERVIEW
1 INTRODUCTION AND OVERVIEW The past few decades have seen the merging of computer and communication technologies Wide-area and local-area computer networks have been deployed to interconnect computers
More informationComparison of pre-backoff and post-backoff procedures for IEEE distributed coordination function
Comparison of pre-backoff and post-backoff procedures for IEEE 802.11 distributed coordination function Ping Zhong, Xuemin Hong, Xiaofang Wu, Jianghong Shi a), and Huihuang Chen School of Information Science
More informationBROADBAND PACKET SWITCHING TECHNOLOGIES
BROADBAND PACKET SWITCHING TECHNOLOGIES A Practical Guide to ATM Switches and IP Routers H. JONATHAN CHAO CHEUK H. LAM EMI OKI A Wiley-lnterscience Publication JOHN WILEY & SONS, INC. New York / Chichester
More informationInternetworking Part 1
CMPE 344 Computer Networks Spring 2012 Internetworking Part 1 Reading: Peterson and Davie, 3.1 22/03/2012 1 Not all networks are directly connected Limit to how many hosts can be attached Point-to-point:
More informationStructure and Performance Evaluation of a Replicated Banyan Network Based ATM Switch
Structure and Performance Evaluation of a Replicated Banyan Network Based ATM Switch Moustafa A. Youssef, Mohamed N. El-Derini, and Hussien H. Aly Department of Computer Science and Automatic Control,
More informationDOE Award number: Name of recipient: Project Title: Principal investigator: Date of Report: Period covered by the report:
Progress Report DOE Award number: DE-SC0004909 Name of recipient: University of Massachusetts, Dartmouth Project Title: Coordinated Multi-layer Multi-domain Optical Network (COMMON) for Large- Scale Science
More informationA Novel High Performance Multicast Scheme on Virtual Ring-Based 2D Torus Topology in DWDM Networks
Tamkang Journal of Science and Engineering, Vol. 14, No. 1, pp. 81 89 (2011) 81 A Novel High Performance Multicast Scheme on Virtual Ring-Based 2D Torus Topology in DWDM Networks I-Shyan Hwang 1 *, San-Nan
More informationRealizing Common Communication Patterns in Partitioned Optical Passive Stars (POPS) Networks
998 IEEE TRANSACTIONS ON COMPUTERS, VOL. 47, NO. 9, SEPTEMBER 998 Realizing Common Communication Patterns in Partitioned Optical Passive Stars (POPS) Networks Greg Gravenstreter and Rami G. Melhem, Senior
More informationChapter - 7. Multiplexing and circuit switches
Chapter - 7 Multiplexing and circuit switches Multiplexing Multiplexing is used to combine multiple communication links into a single stream. The aim is to share an expensive resource. For example several
More informationOFFH-CDM ALL-OPTICAL NETWORK
Patent Title: OFFH-CDM ALL-OPTICAL NETWORK Inventor: FOULI K., MENIF M., LADDADA R., AND FATHALLAH H. Status: US PATENT PENDING, APRIL 2008 Reference Number: 000819-0100 1 US Patent Pending: 000819-0100
More informationDesigning Efficient Benes and Banyan Based Input-Buffered ATM Switches
Designing Efficient Benes and Banyan Based Input-Buffered ATM Switches Rajendra V. Boppana Computer Science Division The Univ. of Texas at San Antonio San Antonio, TX 829- boppana@cs.utsa.edu C. S. Raghavendra
More information