Performance Evaluation of k-ary Data Vortex Networks with Bufferless and Buffered Routing Nodes
|
|
- Amy Green
- 6 years ago
- Views:
Transcription
1 Performance Evaluation of k-ary Data Vortex Networks with Bufferless and Buffered Routing Nodes Qimin Yang Harvey Mudd College, Engineering Department, Claremont, CA 91711, USA ABSTRACT This paper studies generalized k-ary Data Vortex networks both with and without node buffering. The comparison study focuses on effects of buffering in 4-ary networks and in original binary networks. The results show that with buffers the 4-ary networks gain more performance benefit than that in the binary networks. This is due to significantly reduced traffic backpressure that is present in 4-ary networks in bufferless operations. Detailed comparisons between 4-ary and binary networks with two different buffering schemes are presented. The routing performance in throughput and latency are studied for different network and load conditions. For practical implementation, additional cost due to buffering should be justified for the desirable performance enhancement. Keywords: interconnection network, packet switching, data vortex network, switching fabric, buffering, routing nodes. 1. Introduction to Data Vortex architecture Packet switched optical interconnection networks become key subsystems in high capacity communication systems and multiprocessor computing systems [1-2]. While current optical fiber technology provides enormous bandwidth, there is very limited capability in optical processing and optical buffering techniques [3-4], therefore the main challenge of these interconnection networks is to handle traffic contention which has led to difficulty in adapting most existing switching fabric architectures for optical implementations. For example, networks such as Banyan and Butterfly are widely used as effective self-routing electrical switching fabrics networks, but it is rather challenging to implement them in the optical domain because of the lack of buffering at each node. Deflection based routing on the other hand results in much longer delays due to the need to travel around the network diameter to reach to the next open path to the target. As a result, not only delay but also throughput performance are greatly degraded, and more complex routing logics are often required to avoid deadlock and unfairness. The overall performance scales poorly with the increase of network sizes and network loads in these two-dimensional network topologies [5]. Data Vortex network is uniquely designed with three dimensional arrangements of the routing nodes. Due to the additional dimension, it allows for bufferless operation using deflection based routing while keeping minimal deflection penalty and minimal routing decision. The bufferless operation offers the simplest possible contention resolution in the optical domain [6-7]. This switching architecture implements a single-packet-routing rule at each node through a traffic control mechanism, so that the routing logic at each node is extremely simple. The topology provides multiple open paths to each target address so that deflected packets encounter a much smaller latency penalty (in 2 hops) that is also independent of the network diameter. These network characteristics allow for superior network scalability so that throughput and latency performance are reasonable even for very large network sizes. In the physical layer implementation, wavelength division multiplexing (WDM) is used for stacking high throughput data in the wavelength domain and it also allows for simple header bit extraction using wavelength encoding and decoding. Broadband fast switching devices such as Semiconductor Optical Amplifier (SOA) are critical to switching the short duration packet and maintaining its signal power level. More details on the physical layer implementation and system limitation can be found in [8-9]. Network Architectures, Management, and Applications VII, edited by Ken-ichi Sato, Yuefeng Ji, Lena Wosinska, Jing Wu, Proc. of SPIE-OSA-IEEE Asia Communications and Photonics, SPIE Vol. 7633, 76331K 2009 SPIE-OSA-IEEE CCC code: X/09/$18 doi: / SPIE-OSA-IEEE/ Vol K-1
2 c=0 (outermost) c=1 c=2 c=3 c=4 Fig.1. Routing nodes and intra-cylinder links within binary Data Vortex of A=4, H=16 and C=5. The Data Vortex network can be viewed as a multiple stage interconnection network (MIN). The routing nodes are arranged in concentric cylinders with A, H and C = log 2 H + 1 designating the number of nodes along three dimensions angle, height and cylinder respectively. An example of A=4, H=16 and C=5 Data Vortex network is shown in Fig.1, where the intra-cylinder link patterns are specifically shown at each cylinder from the outermost (c=0) to the innermost side (c=4). These links along the same cylinder route a packet back and forth between two height groups, i.e. with specific binary header bit alternating between 1 and 0 using a binary-tree header decoding. The inter-cylinder links (not shown in Fig.1) are to forward a packet to an inner neighbor cylinder while maintaining its height location, thus these paths appear to be parallel paths between the cylinders [6]. Fig.2 Routing node implementation at i th cylinder SPIE-OSA-IEEE/ Vol K-2
3 The packet routing in the Data Vortex network is operated in a synchronous and slotted fashion. Packet length is typically chosen to be the same as the hop latency for a simple and efficient implementation. Packets are injected at the outermost cylinder at specified injection angles A in, and each travels towards the innermost cylinder at its shortest paths which depends on its target address as well as other data traffic. Each node processes a single arrival packet as shown in Fig.2. For example, a routing node at i th cylinder makes its routing decision based on the packet frame bit, which tells whether or not a packet is present at the incoming paths, the corresponding i th header bit as well as the electrical control bit sent from its inner competing node. Both the frame and header bits can be extracted by a small power tap and through passive filtering and low packet rate optical/electronic (O/E) conversion. The traffic control signal is generated at each node to properly permit or block the packet of the outer cylinder so that the single-packet-routing rule is always satisfied for bufferless operation for all the routing nodes [10]. Fig.3 Distributed control signal among routing nodes. Fig.3 shows the distributed control signals (in dashed line) among the routing nodes on different cylinders. As an example shown, node 3 and node 4 both send packets to node 5, therefore node 4 of the inner cylinder generates a control signal for node 3 to set up the single packet routing rule. Similarly node 3 generates a control signal for its outer cylinder competing node 7 since they both send packet to node 6. Packets receiving the blocking control are deflected to stay on the current cylinder which acts as virtual buffers with a two hop delay penalty. Once packet arrives at the correct target, it exits the network in the innermost cylinder. The last cylinder maintains the same height to provide additional optical buffering in addition to the electrical buffering present in the output ports. If not all angles at exit are connected to output ports, the last cylinder also deals with angular address resolution of the packet. More details on the angular resolution and choice of angles vs. network height or I/O ports have been discussed in [11]. As mentioned above the routing in the Data Vortex network is progressed through a series of binarytree decoding stages. Each node and each cylinder stage only decodes a single header bit in the binary target address that corresponds to the specific cylinder, and it decides to route the packet further in the current level (current cylinder) or forward the packet to the next level (inner cylinder). Successful forwarding is also dependent on the availability of open control signal due to the traffic condition of the inner cylinder. At different traffic conditions, overall traffic latency is accumulated through routing, deflection and forwarding hops. 2. EXTENDING TO GENERAL K-ARY DATA VORTEX ARCHITECTURE Since the header decoding is extremely simple with passive filtering and low speed electronics for detection, it is possible to allow for multiple header bits decoding at each stage without significantly SPIE-OSA-IEEE/ Vol K-3
4 increase the complexity and cost of the overall switching system. In a previous study [12], we proposed implementing the Data Vortex network with such k-ary decoding at each routing node, where the binarytree decoding is the special case with k=2. For the ease of optical system implementation, we limited our exploration to the cases of bufferless operation in the study, and the single packet routing rule is maintained as that in the original binary networks. Network routing performance under various arrangements of the routing and forwarding paths have been compared and studied. In particular, the latency in forwarding hops and routing hops are each considered for detailed comparison study. In the case of binary tree decoding in regular Data Vortex networks, each node decodes one header bit, and the routing on a specified cylinder chooses one out of two groups (upper vs. lower group or specific header bit being 1 vs. 0 ), and the deflection latency penalty in the network is two hops. As we extend the concept to general k-ary decoding, each stage then decodes (log 2 bits, and each hop along the same cylinder allows for the packet to choose one out of k groups (i.e. specific (log 2 bits alternate among all possible k combinations). When the corresponding (log 2 header bits in the target address are matched with the (log 2 bits in the routing node height address, the packet will proceed to the next inner cylinder if the corresponding traffic control opens the path at the same time. The same traffic control mechanism is set up for the purpose as that in the original Data Vortex network. If inner traffic causes deflection, the outer packet stays on the current cylinder for further routing. Since no buffering is necessary the routing logic is kept as minimal as possible. As a result of such arrangement, the deflected packet in k-ary networks undergoes k hops delay penalty to return to the matched height or to the open path to the next cylinder routing. c=0 outermost c=1 c=2 Fig.4 Routing patterns at each of the three cylinders in a 4-ary decoding Data Vortex network. A=4, H=16, C = log 4 H + 1 = 3 SPIE-OSA-IEEE/ Vol K-4
5 Fig.5 Routing node implementation at i th cylinder in 4-ary decoding network In order to allow for a complete permutation of k groups based on the corresponding (log 2 header bits, the intra-cylinder routing paths are slightly modified from the binary-tree decoding networks. In Fig.4 an example of 4-ary decoding network is shown where each hop decodes 2 header bits in a network of A=4, H=16 and the number of cylinders isc = log 4 H + 1 = 3. The routing node is shown in Fig.5 and the only difference is the requirement of two header bits detection. Note the interconnection patterns at different cylinders in the binary decoding Data Vortex network are combined and also reversed at proper angles to construct the 4-ary decoding networks. In such an arrangement, a packet takes k hops to go through all k possible groups along the cylinder, so the deflection latency penalty would increase to 4 hops in 4-ry decoding networks, which is the obvious disadvantage of using big value of k. Such disadvantage can also be shown in two dimensional routing topologies such as Banyan and Bufferfly networks where the deflection penalty equals the diameter of the network, and this greatly eliminates their potential for pure deflection routing based optical implementations in larger networks. On the other hand, in extended k-ary Data Vortex implementation, the number of cylinders required is C = log k H + 1, assuming the last cylinder maintains the same height just for output buffering purpose as that of regular Data Vortex network. As a result, the forwarding latency is much smaller with a larger value of k. The network height H is chosen so that log k H is kept an integer for simplicity. The comparison study between the 4-ary networks and the binary-decoding networks in bufferless operation have shown that the latter achieves overall better performance in throughput as well as in latency. The gain in reduction of forwarding hops is cancelled out by the increase in routing hops at each stage due to much greater traffic backpressure, and such backpressure tends to introduce more congestion and degrade data throughput at the same time. 3. NETWORKS WITH BUFFERING CAPABILITY WITHIN THE ROUTING NODES While bufferless Data Vortex networks achieve reasonable routing performance, a previous study [7] suggested incorporating an additional node buffer for enhanced performance. Such systems require additional switching devices and more complicated routing arbitration due to multiple packets scheduling and prioritizing buffered packets. The first proposed buffer keeps the single packet processing so that a two slot delay buffer is required to establish the necessary traffic control. In the second buffering scheme, the node can process two packets simultaneously where one is from the node buffer and the other one is from outside of node. In this case a single slot buffer is required but two parallel sets of switching elements are needed for the routing. The performance enhancement with the node buffer shown in [7] is reasonably significant especially with the second scheme, so if the additional hardware cost mainly the switching components can be justified or reduced with advanced integration technology, buffered routing node could serve as a feasible solution for applications that desire higher throughput or lower latency. SPIE-OSA-IEEE/ Vol K-5
6 (a) (b) Fig.6 Buffered routing nodes with (a) single arrival packet (b) two arrival packets. The buffer implementation in [7] can easily be incorporated within the generalized k-ary networks in the same manner. Fig.6 shows such node in the example of 4-ary networks with two different buffering schemes. Figure (a) shows the buffered node with a single packet processing and (b) shows the nodes with two packets processing which require twice of the switching components to handle the routing. In both cases, the previously buffered packet will be given priority in routing so that it leaves the node before an un-buffered packet does. Since the study in bufferless k-ary networks suggested the disadvantages of traffic backpressure with high value of k, we expect the presence of buffering has more significant effect on performance enhancement in such networks. Therefore, this study would focus on such performance enhancement comparison and particularly compare the results in k-ary network to buffering effect reported in the binary networks. 4. PERFORMANCE EVALUATION OF K-ARY NETWORKS WITH NODE BUFFERING For performance evaluation, the previously developed C/C++ event simulator is extended to include networks with the two different methods of node buffering in k-ary networks. Not only the routing performance is compared with that in the bufferless operation, such difference in performance is also compared to that reported in the binary networks with and without node buffers. For comparison purpose, only networks with similar costs are studied with a range of traffic load and redundant conditions. The study is worthwhile because of the potential benefit in performance enhancement, even though the increased cost in implementation must be kept in consideration. The cost evaluation has been carried out in details in [7] for the binary networks, and such evaluation can be directly applied to the generalized k-ary networks due to the same implementation of buffering scheme. To focus on the buffering effect on the extended k-ary networks and compare that in the original Data Vortex, two networks M in binary (A=5, C=9, H=256) and N in 4-ary (A=9, C=5, H=256) are compared under different traffic and buffering conditions. We mainly focus our attention to 4-ary networks because of their comparable low deflection penalty. A medium redundant condition is considered when A in =3. M 0, M 1 and M 2 represent the case when network M under bufferless operation, buffered with one packet processing and buffered with two packets processing respectively. Similarly N 0, N 1 and N 2 represents network N under these buffering conditions. Since both networks share the same number of routing nodes and same number of I/O ports, we consider them to have the same cost for the same buffering conditions. SPIE-OSA-IEEE/ Vol K-6
7 1 Throughput Performance Ain=3 0.8 Injection rate 0.6 M0: bufferlss 0.4 M1:buffered, one packet M2: buffered, tw o packets N0: bufferless 0.2 N1: buffered, one packet N2:buffered, tw o packets traffic load Fig.7 (a) Throughput performance comparison 25 Delay Performance Ain=3 20 Average hops M0: bufferlss M1:buffered, one packet M2: buffered, tw o packets N0: bufferless N1: buffered, one packet N2:buffered, tw o packets traffic load Fig.7 (b) Delay performance comparison Fig.7 (a) and (b) show the results of routing performance comparison. The throughput is measured by the successful injection rate at the input angles, and the latency is the average hopes of packets that arrive at the output ports. The graph indicates that buffering with single packet processing brings more improvement in 4-ary networks if we compare the throughput performance from M 0 to M 1 to that from N 0 to N 1. The resulted N 1 s throughput is slightly better than that of M 1. This is mainly due to the much worse traffic backpressure in 4-ary bufferless networks, and the added node buffer relieves such pressure for significant enhancement compared to a relatively modest improvement in the binary networks. For buffering with two packets processing, the binary networks (M 2 ) outperforms the 4-ary networks (N 2 ) similar to the bufferless performance comparison (M 0 vs. N 0 ). Therefore in this case the effect of buffering is very similar if we compare the difference from M 0 to M 2 to that from N 0 to N 2. For delay performance, M 1 has much worse performance compared to M 0 due to its two-slot delay. While also worse at very high loads, the delay in N 1 is closer or slightly better than N 0 for other load conditions. The overall delay in N 1 is significantly better SPIE-OSA-IEEE/ Vol K-7
8 than that of M 1. For buffering with two packets processing, N 2 also gains much significant latency improvement from N 0 compared to improvement from M 0 to M 2. In summary, the presence of the buffering at node tends to benefit the overall performance gain of 4-ary networks more compared to that in the original networks. 1 Throughput Performance Ain=5 0.8 Injection rate M0: bufferlss M1:buffered, one packet M2: buffered, tw o packets 0.2 N0: bufferless N1: buffered, one packet N2:buffered, tw o packets traffic load Fig. 8 (a) Throughput performance comparison for Ain=5 Delay Performance Ain=5 25 Average hops M0: bufferlss M1:buffered, one packet M2: buffered, tw o packets 5 N0: bufferless N1: buffered, one packet 0 N2:buffered, tw o packets traffic load Fig. 8 (b) Delay performance comparison for Ain=5 Similar trends and comparison results can be obtained for different redundant conditions. Fig.8 shows the comparison for network M and N when Ain=5. While the overall performance are worse due to effectively higher network loads, the performance difference follow very similar trend as discussed earlier. These are due to the inherent scalable nature of the Data Vortex network, whether it is in the binary SPIE-OSA-IEEE/ Vol K-8
9 configuration or in k-ary configuration. We expect the same trend for larger network size comparison as well. 5. CONCLUSION In short, we have studied the implementation of node buffering in the extended k-ary Data Vortex network architecture. The network routing performance has been studied with the two different buffering schemes. In comparing to the performance reported in binary Data Vortex networks, the k-ary network specifically the 4-ary network gains much enhanced improvement in throughput and latency due to such employment of the node buffer. This is mainly because of the higher traffic backpressure in the bufferless operation in 4- ary networks. As a result, the lower forwarding latency or smaller number of cylinders does not contribute to overall better performance under bufferless operation. Once buffered, with the single packet processing nodes, the ultimate performance of 4-ary network achieves better throughput as well as lower latency than that in binary networks with the same buffering scheme. If buffered with the two packet processing nodes, the binary network achieves slightly better throughput performance, but the latency performance is worse than that in 4-ary networks. The combined performance gain more improvement in 4-ary networks than that in binary networks with these buffering capabilities. While the study focuses on the performance enhancement, additional switching cost associated with buffering must be considered for practical implementation. 6. REFERENCE: [1] H. Jonathan Chao and Ben Liu, High Performance Switches and Routers, Wiley-Interscience, ISBN , [2] Gorgios I. Papadimitriou, Chrisoula Papazoglou and Andreas S. Pomportsis, Optical Switching: Switch Fabrics, Techniques and Architectures, Journal of Lightwave Technology, Vol.21, No. 2, pp , Feb [3] Haijun Yang and S.J. Ben Yoo, All-Optical Variable Buffering Strategies and Switch Fabric Architecture for Future All-Optical Data Routers, Journal of Lightwave Technology, Vol. 23, No.10, pp , Oct [4] Chowdhury, A. Yong-Kee Yeo, Jianjun Yu and Gee-Kung Chang, DWDM reconfigurable optical delay buffer for optical packet switched networks, IEEE Photonics Technology letters, Vol. 18, No.10, pp , May [5] B.E.Swekla and R.I.Macdonald, Tandem Banyan Switching Fabric with Dilation, Electronics Letters, Vol.27, No.19, pp , [6] Hawkins, C.; Small, B.A.; Wills, D.S.; Bergman, K.; The Data Vortex, an All Optical Path Multicomputer Interconnection Network, IEEE Transactions on Parallel and Distributed Systems, Vol. 18, No.3, pp , March [7] Assaf Shacham and Keren Bergman, On contention resolution in the data vortex optical interconnection networks, Journal of Optical Networking, Vol.6, pp , [8] A. Shacham, B.A.Small, O.Liboiron-Ladouceur and K. Bergman, A fully implemented 12x12 data vortex optical packet switching interconnection networks, Journal of Lightwave Technology, vol.23, pp , [9] O. Liboiron-Ladouceur, B.A. Small, K. Bergman, "Physical Layer Scalability of WDM Optical Packet Interconnection Networks," Journal of Lightwave Technology, Vol. 24, No.1, pp , Jan [10] Qimin Yang and Keren Bergman, Traffic Control and WDM Routing in the Data Vortex Packet Switch, IEEE Photonics Technology Letters, Vol. 14, No.2, pp , Feb [11] Cory Hawkins and D.Scott Wills, Impact of Number of Angles on the Performance of the Data Vortex Optical Interconnection Networks, Journal of Lightwave Technology, Vol.24, pp , [12] Qimin Yang, Optimum routing and forwarding path arrangement in bufferless Data Vortex networks, IARIA Journal, Vol. 1, January SPIE-OSA-IEEE/ Vol K-9
Hybrid Integration of a Semiconductor Optical Amplifier for High Throughput Optical Packet Switched Interconnection Networks
Hybrid Integration of a Semiconductor Optical Amplifier for High Throughput Optical Packet Switched Interconnection Networks Odile Liboiron-Ladouceur* and Keren Bergman Columbia University, 500 West 120
More informationOptimizing the performance of a data vortex interconnection network
Vol. 6, No. 4 / April 2007 / JOURNAL OF OPTICAL NETWORKING 369 Optimizing the performance of a data vortex interconnection network Assaf Shacham and Keren Bergman Department of Electrical Engineering,
More informationAlgorithm for finding all routes in Data Vortex switch
Algorithm for finding all routes in Data Vortex switch Neha Sharma, Devi Chadha, Vinod Chandra* Department of Electrical Engineering, Indian Institute of Technology, Delhi, New Delhi, INDIA 110016 ABSTRACT
More informationEmulation of realistic network traffic patterns on an eight-node data vortex interconnection network subsystem
Emulation of realistic network traffic patterns on an eight-node data vortex interconnection network subsystem Benjamin A. Small, Assaf Shacham, and Keren Bergman Department of Electrical Engineering,
More informationUltra-Low Latency, Bit-Parallel Message Exchange in Optical Packet Switched Interconnection Networks
Ultra-Low Latency, Bit-Parallel Message Exchange in Optical Packet Switched Interconnection Networks O. Liboiron-Ladouceur 1, C. Gray 2, D. Keezer 2 and K. Bergman 1 1 Department of Electrical Engineering,
More informationOn contention resolution in the data vortex optical interconnection network
Vol. 6, No. 6 / June 2007 / JOURNAL OF OPTICAL NETWORKING 777 On contention resolution in the data vortex optical interconnection network Assaf Shacham* and Keren Bergman Department of Electrical Engineering,
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 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 informationJOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 26, NO. 13, JULY 1,
JOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 26, NO. 13, JULY 1, 2008 1777 The Data Vortex Optical Packet Switched Interconnection Network Odile Liboiron-Ladouceur, Member, IEEE, Assaf Shacham, Member, IEEE,
More informationModeling, Simulating, and Characterizing Performance in
Modeling, Simulating, and Characterizing Performance in Optical Switching Networks J. Nathan Kutzc, B. Smalib, W. Lub, and K. Bergmanb adepartment of Applied Mathematics, University of Washington, Box
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 informationToward a Reliable Data Transport Architecture for Optical Burst-Switched Networks
Toward a Reliable Data Transport Architecture for Optical Burst-Switched Networks Dr. Vinod Vokkarane Assistant Professor, Computer and Information Science Co-Director, Advanced Computer Networks Lab University
More informationUltra Low Latency Optical Networks
Ultra Low Latency Optical Networks O. Liboiron-Ladouceur, B. A. Small, W. Lu, and K. Bergman Department of Electrical Engineering, Columbia University, 5 West 2th Street, New York, NY 27 J. S. Davis, C.
More informationConfiguration of Offset Time in Optical Burst Switching Networks for Delay Sensitive Traffic
Configuration of Offset Time in Optical Burst Switching Networks for Delay Sensitive Traffic Anupam Soni and Yatindra Nath Singh anusoni@iitk.ac.in,ynsingh@iitk.ac.in. Abstract In Optical Burst Switching
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 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 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 informationWDM Packet Routing for High-Capacity Data Networks
1420 JOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 19, NO. 10, OCTOBER 2001 WDM Packet Routing for High-Capacity Data Networks Qimin Yang, Student Member, IEEE, Keren Bergman, Member, IEEE, Member, OSA, Gary D.
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 informationAn Ant Colony Optimization Implementation for Dynamic Routing and Wavelength Assignment in Optical Networks
An Ant Colony Optimization Implementation for Dynamic Routing and Wavelength Assignment in Optical Networks Timothy Hahn, Shen Wan March 5, 2008 Montana State University Computer Science Department Bozeman,
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 informationA Hybrid Interconnection Network for Integrated Communication Services
A Hybrid Interconnection Network for Integrated Communication Services Yi-long Chen Northern Telecom, Inc. Richardson, TX 7583 kchen@nortel.com Jyh-Charn Liu Department of Computer Science, Texas A&M Univ.
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 informationA Dynamic NOC Arbitration Technique using Combination of VCT and XY Routing
727 A Dynamic NOC Arbitration Technique using Combination of VCT and XY Routing 1 Bharati B. Sayankar, 2 Pankaj Agrawal 1 Electronics Department, Rashtrasant Tukdoji Maharaj Nagpur University, G.H. Raisoni
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 informationExact and Approximate Analytical Modeling of an FLBM-Based All-Optical Packet Switch
JOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 21, NO. 3, MARCH 2003 719 Exact and Approximate Analytical Modeling of an FLBM-Based All-Optical Packet Switch Yatindra Nath Singh, Member, IEEE, Amit Kushwaha, and
More informationBufferless all-optical networking with erasure codes
Bufferless all-optical networking with erasure codes Sagnik Ghosh University of California, Berkeley Rose St. Cerritos, CA, 00 () - sghosh@berkeley.edu Authors Venkat Anantharam Cory Hall EECS Department
More informationOptical Interconnection Networks in Data Centers: Recent Trends and Future Challenges
Optical Interconnection Networks in Data Centers: Recent Trends and Future Challenges Speaker: Lin Wang Research Advisor: Biswanath Mukherjee Kachris C, Kanonakis K, Tomkos I. Optical interconnection networks
More informationOutline. EL736 Communications Networks II: Design and Algorithms. Class3: Network Design Modelling Yong Liu 09/19/2006
EL736 Communications Networks II: Design and Algorithms Class3: Network Design Modelling Yong Liu 09/19/2006 1 Outline Examples Basic Problems Routing Restriction 2 1 Example: Intra-Domain Traffic Engineering
More informationINTERCONNECTION NETWORKS LECTURE 4
INTERCONNECTION NETWORKS LECTURE 4 DR. SAMMAN H. AMEEN 1 Topology Specifies way switches are wired Affects routing, reliability, throughput, latency, building ease Routing How does a message get from source
More informationAWG-based Optoelectronic Router with QoS Support
AWG-based Optoelectronic Router with QoS Support Annette Böhm, Magnus Jonsson, and Kristina Kunert School of Information Science, Computer and Electrical Engineering, Halmstad University Box 823, S-31
More informationEnhancing Bandwidth Utilization and QoS in Optical Burst Switched High-Speed Network
91 Enhancing Bandwidth Utilization and QoS in Optical Burst Switched High-Speed Network Amit Kumar Garg and R S Kaler School of Electronics and Communication Eng, Shri Mata Vaishno Devi University (J&K),
More information170 Index. Delta networks, DENS methodology
Index A ACK messages, 99 adaptive timeout algorithm, 109 format and semantics, 107 pending packets, 105 piggybacking, 107 schematic represenation, 105 source adapter, 108 ACK overhead, 107 109, 112 Active
More informationSUPERCOMPUTERS harness a concurrent organization of the
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 18, NO. 3, MARCH 2007 409 The Data Vortex, an All Optical Path Multicomputer Interconnection Network Cory Hawkins, Student Member, IEEE, Benjamin
More informationCHAPTER TWO LITERATURE REVIEW
CHAPTER TWO LITERATURE REVIEW 2.1 Introduction. This chapter provides in detail about the multiple access technologies and the OCDMA system. It starts with a discussion on various existing multiple-access
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 informationAn optically transparent ultra high speed LAN-ring employing OTDM
An optically transparent ultra high speed LAN-ring employing OTDM K. Bengi, G. Remsak, H.R. van As Vienna University of Technology, Institute of Communication Networks Gusshausstrasse 25/388, A-1040 Vienna,
More informationPerformance of Optical Burst Switching Techniques in Multi-Hop Networks
Performance of Optical Switching Techniques in Multi-Hop Networks Byung-Chul Kim *, You-Ze Cho *, Jong-Hyup Lee **, Young-Soo Choi **, and oug Montgomery * * National Institute of Standards and Technology,
More informationOn Topology and Bisection Bandwidth of Hierarchical-ring Networks for Shared-memory Multiprocessors
On Topology and Bisection Bandwidth of Hierarchical-ring Networks for Shared-memory Multiprocessors Govindan Ravindran Newbridge Networks Corporation Kanata, ON K2K 2E6, Canada gravindr@newbridge.com Michael
More informationNovel Passive Optical Switching Using Shared Electrical Buffer and Wavelength Converter
Novel Passive Optical Switching Using Shared Electrical Buffer and Wavelength Converter Ji-Hwan Kim 1, JungYul Choi 2, Jinsung Im 1, Minho Kang 1, and J.-K. Kevin Rhee 1 * 1 Optical Internet Research Center,
More information3 log 2 B Fiber Delay Lines
Constructing Optical LIFO Buffers of Size B with 3 log 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 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 informationOptical Packet Switching
Optical Packet Switching DEISNet Gruppo Reti di Telecomunicazioni http://deisnet.deis.unibo.it WDM Optical Network Legacy Networks Edge Systems WDM Links λ 1 λ 2 λ 3 λ 4 Core Nodes 2 1 Wavelength Routing
More informationGeneric Architecture. EECS 122: Introduction to Computer Networks Switch and Router Architectures. Shared Memory (1 st Generation) Today s Lecture
Generic Architecture EECS : Introduction to Computer Networks Switch and Router Architectures Computer Science Division Department of Electrical Engineering and Computer Sciences University of California,
More informationBoosting the Performance of Myrinet Networks
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. XX, NO. Y, MONTH 22 1 Boosting the Performance of Myrinet Networks J. Flich, P. López, M. P. Malumbres, and J. Duato Abstract Networks of workstations
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 informationLecture 26: Interconnects. James C. Hoe Department of ECE Carnegie Mellon University
18 447 Lecture 26: Interconnects James C. Hoe Department of ECE Carnegie Mellon University 18 447 S18 L26 S1, James C. Hoe, CMU/ECE/CALCM, 2018 Housekeeping Your goal today get an overview of parallel
More informationDESIGN OF EFFICIENT ROUTING ALGORITHM FOR CONGESTION CONTROL IN NOC
DESIGN OF EFFICIENT ROUTING ALGORITHM FOR CONGESTION CONTROL IN NOC 1 Pawar Ruchira Pradeep M. E, E&TC Signal Processing, Dr. D Y Patil School of engineering, Ambi, Pune Email: 1 ruchira4391@gmail.com
More informationWorking Analysis of TCP/IP with Optical Burst Switching Networks (OBS)
Working Analysis of TCP/IP with Optical Burst Switching Networks (OBS) Malik Salahuddin Nasir, Muabshir Ashfaq and Hafiz Sabir Hussain CS&IT Department, Superior University, 17-km off Riwind Road, Lahore
More informationModelling and Performance Evaluation of Optical Burst Switched Node with Deflection Routing and Dynamic Wavelength Allocation
FACTA UNIVERSITATIS (NIŠ) SER.: ELEC. ENERG. vol. 21, no. 2, August 2008, 183-194 Modelling and Performance Evaluation of Optical Burst Switched Node with Deflection Routing and Dynamic Wavelength Allocation
More informationOFAR-CM: Efficient Dragonfly Networks with Simple Congestion Management
Marina Garcia 22 August 2013 OFAR-CM: Efficient Dragonfly Networks with Simple Congestion Management M. Garcia, E. Vallejo, R. Beivide, M. Valero and G. Rodríguez Document number OFAR-CM: Efficient Dragonfly
More informationEE482, Spring 1999 Research Paper Report. Deadlock Recovery Schemes
EE482, Spring 1999 Research Paper Report Deadlock Recovery Schemes Jinyung Namkoong Mohammed Haque Nuwan Jayasena Manman Ren May 18, 1999 Introduction The selected papers address the problems of deadlock,
More informationA simple mathematical model that considers the performance of an intermediate node having wavelength conversion capability
A Simple Performance Analysis of a Core Node in an Optical Burst Switched Network Mohamed H. S. Morsy, student member, Mohamad Y. S. Sowailem, student member, and Hossam M. H. Shalaby, Senior member, IEEE
More informationDOS - A Scalable Optical Switch for Datacenters
DOS - A Scalable Optical Switch for Datacenters Xiaohui Ye xye@ucdavis.edu Paul Mejia pmmejia@ucdavis.edu Yawei Yin yyin@ucdavis.edu Roberto Proietti rproietti@ucdavis.edu S. J. B. Yoo sbyoo@ucdavis.edu
More informationA Novel Approach to Reduce Packet Loss in OBS Networks
A Novel Approach to Reduce Packet Loss in OBS Networks Amit Gupta 1, Harbhajan Singh 2, Jagdish Kumar 3 1 Deptt. of Electronics and Communication Engg, PTU, Jalandhar, India. 2 Deptt. of Electronics and
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 informationCMSC 611: Advanced. Interconnection Networks
CMSC 611: Advanced Computer Architecture Interconnection Networks Interconnection Networks Massively parallel processor networks (MPP) Thousands of nodes Short distance (
More informationNew Approaches to Optical Packet Switching in Carrier Networks. Thomas C. McDermott Chiaro Networks Richardson, Texas
New Approaches to Optical Packet Switching in Carrier Networks Thomas C. McDermott Chiaro Networks Richardson, Texas Outline Introduction, Vision, Problem statement Approaches to Optical Packet Switching
More informationEECS 122: Introduction to Computer Networks Switch and Router Architectures. Today s Lecture
EECS : Introduction to Computer Networks Switch and Router Architectures Computer Science Division Department of Electrical Engineering and Computer Sciences University of California, Berkeley Berkeley,
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 informationThe Effect of Adaptivity on the Performance of the OTIS-Hypercube under Different Traffic Patterns
The Effect of Adaptivity on the Performance of the OTIS-Hypercube under Different Traffic Patterns H. H. Najaf-abadi 1, H. Sarbazi-Azad 2,1 1 School of Computer Science, IPM, Tehran, Iran. 2 Computer Engineering
More informationAll Optical Packet Switches Based On Space Switch Array for the Transmission of Higher Data Rate Using NRZand RZ Modulation
IOSR Journal of Electronics and Communication Engineering (IOSR-JECE) e-issn: 2278-2834,p- ISSN: 2278-8735.Volume 9, Issue 2, Ver. VII (Mar - Apr. 2014), PP 19-24 All Optical Packet Switches Based On Space
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 informationOptical Burst Switching (OBS): The Dawn of A New Era in Optical Networking
Optical Burst Switching (OBS): The Dawn of A New Era in Optical Networking Presented by Yang Chen (LANDER) Yang Chen (Lander) 1 Outline Historical Review Burst reservation Burst assembly OBS node Towards
More informationArchitectures and Performance of AWG-Based Optical Switching Nodes for IP Networks
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 21, NO. 7, SEPTEMBER 2003 1113 Architectures and Performance of AWG-Based Optical Switching Nodes for IP Networks Stefano Bregni, Senior Member, IEEE,
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 informationPacket Switch Architecture
Packet Switch Architecture 3. Output Queueing Architectures 4. Input Queueing Architectures 5. Switching Fabrics 6. Flow and Congestion Control in Sw. Fabrics 7. Output Scheduling for QoS Guarantees 8.
More informationPacket Switch Architecture
Packet Switch Architecture 3. Output Queueing Architectures 4. Input Queueing Architectures 5. Switching Fabrics 6. Flow and Congestion Control in Sw. Fabrics 7. Output Scheduling for QoS Guarantees 8.
More informationRetransmission schemes for Optical Burst Switching over star networks
Retransmission schemes for Optical Burst Switching over star networks Anna Agustí-Torra, Gregor v. Bochmann*, Cristina Cervelló-Pastor Escola Politècnica Superior de Castelldefels, Universitat Politècnica
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 informationCo-Development of Test Electronics and PCI Express Interface for a Multi-Gbps Optical Switching Network
Co-Development of Test Electronics and PCI Express Interface for a Multi-Gbps Optical Switching Network C.E. Gray 1, O. Liboiron-Ladouceur 2, D.C. Keezer 1, K. Bergman 2 Georgia Institute of Technology
More informationThe current electronic network capacity can t accommodate the future market demand. For the high speed transmission demand of future we have to
[18]. The current electronic network capacity can t accommodate the future market demand. For the high speed transmission demand of future we have to migrate to wards optical technology. In the current
More informationNetwork on Chip Architecture: An Overview
Network on Chip Architecture: An Overview Md Shahriar Shamim & Naseef Mansoor 12/5/2014 1 Overview Introduction Multi core chip Challenges Network on Chip Architecture Regular Topology Irregular Topology
More informationA NOVEL DECENTRALIZED ETHERNET-BASED PASSIVE OPTICAL NETWORK ARCHITECTURE
A NOVEL DECENTRALIZED ETHERNET-BASED PASSIVE OPTICAL NETWORK ARCHITECTURE A. Hadjiantonis, S. Sherif, A. Khalil, T. Rahman, G. Ellinas, M. F. Arend, and M. A. Ali, Department of Electrical Engineering,
More informationEnhancing Fairness in OBS Networks
Enhancing Fairness in OBS Networks Abstract Optical Burst Switching (OBS) is a promising solution for all optical Wavelength Division Multiplexing (WDM) networks. It combines the benefits of both Optical
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 information1. INTRODUCTION light tree First Generation Second Generation Third Generation
1. INTRODUCTION Today, there is a general consensus that, in the near future, wide area networks (WAN)(such as, a nation wide backbone network) will be based on Wavelength Division Multiplexed (WDM) optical
More informationGain in prob. of success using FEC over non FEC Fraction of FEC (n k)/k
Optical Packet-Switching using Forward Error Correction Gaurav Agarwal, Jeff Danley and Rahul Shah gaurav,jdgt,rcshah}@eecs.berkeley.edu November 28, 2 Abstract Optical networking technology has experienced
More informationSparse Converter Placement in WDM Networks and their Dynamic Operation Using Path-Metric Based Algorithms
Sparse Converter Placement in WDM Networks and their Dynamic Operation Using Path-Metric Based Algorithms Sanjay K. Bose, SMIEEE, Y.N. Singh, MIEEE A.N.V.B. Raju Bhoomika Popat Department of Electrical
More informationOVERVIEW: NETWORK ON CHIP 3D ARCHITECTURE
OVERVIEW: NETWORK ON CHIP 3D ARCHITECTURE 1 SOMASHEKHAR, 2 REKHA S 1 M. Tech Student (VLSI Design & Embedded System), Department of Electronics & Communication Engineering, AIET, Gulbarga, Karnataka, INDIA
More informationLecture 12: Interconnection Networks. Topics: dimension/arity, routing, deadlock, flow control
Lecture 12: Interconnection Networks Topics: dimension/arity, routing, deadlock, flow control 1 Interconnection Networks Recall: fully connected network, arrays/rings, meshes/tori, trees, butterflies,
More informationDesign of Hierarchical Crossconnect WDM Networks Employing a Two-Stage Multiplexing Scheme of Waveband and Wavelength
166 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 20, NO. 1, JANUARY 2002 Design of Hierarchical Crossconnect WDM Networks Employing a Two-Stage Multiplexing Scheme of Waveband and Wavelength
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 informationDUE to the increasing computing power of microprocessors
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 13, NO. 7, JULY 2002 693 Boosting the Performance of Myrinet Networks José Flich, Member, IEEE, Pedro López, M.P. Malumbres, Member, IEEE, and
More information4. Networks. in parallel computers. Advances in Computer Architecture
4. Networks in parallel computers Advances in Computer Architecture System architectures for parallel computers Control organization Single Instruction stream Multiple Data stream (SIMD) All processors
More informationAdaptive Data Burst Assembly in OBS Networks
Adaptive Data Burst Assembly in OBS Networks Mohamed A.Dawood 1, Mohamed Mahmoud 1, Moustafa H.Aly 1,2 1 Arab Academy for Science, Technology and Maritime Transport, Alexandria, Egypt 2 OSA Member muhamed.dawood@aast.edu,
More informationRouting In the Logical Interconnection Topologies
Routing In the Logical Interconnection Topologies Firat Tekiner First Year PhD Student Zabih Ghassemlooy, Thompson Mark, Alkhayatt Samir Optical Communications Research Group School of Engineering, Sheffield
More informationOPTICAL BURST SWITCHING PROTOCOLS IN ALL-OPTICAL NETWORKS
ISTANBUL UNIVERSITY JOURNAL OF ELECTRICAL & ELECTRONICS ENGINEERING YEAR VOLUME NUMBER : 2006 : 6 : 1 (45-51) OPTICAL BURST SWITCHING PROTOCOLS IN ALL-OPTICAL NETWORKS Pınar KIRCI 1 A.Halim ZAİM 2 1, 2
More informationLecture 24: Interconnection Networks. Topics: topologies, routing, deadlocks, flow control
Lecture 24: Interconnection Networks Topics: topologies, routing, deadlocks, flow control 1 Topology Examples Grid Torus Hypercube Criteria Bus Ring 2Dtorus 6-cube Fully connected Performance Bisection
More informationInterconnection Networks: Topology. Prof. Natalie Enright Jerger
Interconnection Networks: Topology Prof. Natalie Enright Jerger Topology Overview Definition: determines arrangement of channels and nodes in network Analogous to road map Often first step in network design
More informationScaling routers: Where do we go from here?
Scaling routers: Where do we go from here? HPSR, Kobe, Japan May 28 th, 2002 Nick McKeown Professor of Electrical Engineering and Computer Science, Stanford University nickm@stanford.edu www.stanford.edu/~nickm
More informationDesign of an Agile All-Photonic Network (AAPN)
Design of an Agile All-Photonic Network (AAPN) Gregor v. Bochmann School of Information Technology and Engineering (SITE) University of Ottawa Canada http://www.site.uottawa.ca/~bochmann/talks/aapn-results
More informationEfficient Queuing Architecture for a Buffered Crossbar Switch
Proceedings of the 11th WSEAS International Conference on COMMUNICATIONS, Agios Nikolaos, Crete Island, Greece, July 26-28, 2007 95 Efficient Queuing Architecture for a Buffered Crossbar Switch MICHAEL
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 informationLecture 12: Interconnection Networks. Topics: communication latency, centralized and decentralized switches, routing, deadlocks (Appendix E)
Lecture 12: Interconnection Networks Topics: communication latency, centralized and decentralized switches, routing, deadlocks (Appendix E) 1 Topologies Internet topologies are not very regular they grew
More informationWavelength conversion in optical packet switching
Downloaded from orbit.dtu.dk on: Aug 18, 2018 Wavelength conversion in optical packet switching Danielsen, Søren Lykke; Hansen, Peter Bukhave; Stubkjær, Kristian Published in: Journal of Lightwave Technology
More informationBROADBAND AND HIGH SPEED NETWORKS
BROADBAND AND HIGH SPEED NETWORKS SWITCHING A switch is a mechanism that allows us to interconnect links to form a larger network. A switch is a multi-input, multi-output device, which transfers packets
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 informationDiffServ Architecture: Impact of scheduling on QoS
DiffServ Architecture: Impact of scheduling on QoS Abstract: Scheduling is one of the most important components in providing a differentiated service at the routers. Due to the varying traffic characteristics
More informationThe Design and Performance Analysis of QoS-Aware Edge-Router for High-Speed IP Optical Networks
The Design and Performance Analysis of QoS-Aware Edge-Router for High-Speed IP Optical Networks E. Kozlovski, M. Düser, R. I. Killey, and P. Bayvel Department of and Electrical Engineering, University
More information