Multicast scheduling in feedback-based two-stage switch

Proceedings of the IEEE Workshop on High Performance Switching and Routing, 2009, p. 28-33Scalability is of paramount importance in high-speed switch design. Two limiting factors are the complexity of switch fabric and the need for a sophisticated central scheduler. In this paper, we focus on designing a scalable multicast switch. Given the fact that the majority traffic on the Internet is unicast, a cost-effective solution is to adopt a unicast switch fabric for handling both unicast and multicast traffic. Unlike existing approaches, we choose to base our multicast switch design on the load-balanced two-stage switch architecture because it does not require a central scheduler, and its unicast switch fabric only needs to realize N switch configurations. Specifically, we adopt the feedback-based two-stage switch architecture [10], because it elegantly solves the notorious packet mis-sequencing problem, and yet renders an excellent throughput-delay performance. By slightly modifying the operation of the original feedback-based two-stage switch, a simple distributed multicast scheduling algorithm is proposed. Simulation results show that with packet duplication at both input ports and middle-stage ports, the proposed multicast scheduling algorithm significantly cuts down the average packet delay and delay variation among different copies of the same multicast packet. Keywords-Feedback-based two-stage switch, scalable multicast switch, load-balanced switch. © 2009 IEEE.published_or_final_versio

Load-balanced optical switch for high-speed router design

A hybrid electro-optic router is attractive, where packet buffering and table lookup are carried out in electrical domain and switching is done optically. In this paper, we propose a loadbalanced optical switch (LBOS) fabric for a hybrid router. LBOS comprises N linecards connected by an N-wavelength WDM fiber ring. Each linecard i is configured to receive on channel λ i. To send a packet, it can select and transmit on an idle channel based on where the packet goes. The packet remains in the optical domain all the way from an input linecard/port to an output linecard/port. Meanwhile, the loading in the ring network is perfectly balanced by spreading the packets for different destinations to use different wavelengths, and packets for the same destination to use different time slots. With the pipelined operation of the LBOS, we show that LBOS is an optical counterpart of an efficient load-balanced electronic switch, and close-to-100% throughput can be obtained. To address the ringfairness problem under the inadmissible traffic patterns, an efficient throughput-fair scheduler for LBOS is also devised. ©2010 IEEE.published_or_final_versio

Feedback-based scheduling for load-balanced two-stage switches

A framework for designing feedback-based scheduling algorithms is proposed for elegantly solving the notorious packet missequencing problem of a load-balanced switch. Unlike existing approaches, we show that the efforts made in load balancing and keeping packets in order can complement each other. Specifically, at each middle-stage port between the two switch fabrics of a load-balanced switch, only a single-packet buffer for each virtual output queueing (VOQ) is required. Although packets belonging to the same flow pass through different middle-stage VOQs, the delays they experience at different middle-stage ports will be identical. This is made possible by properly selecting and coordinating the two sequences of switch configurations to form a joint sequence with both staggered symmetry property and in-order packet delivery property. Based on the staggered symmetry property, an efficient feedback mechanism is designed to allow the right middle-stage port occupancy vector to be delivered to the right input port at the right time. As a result, the performance of load balancing as well as the switch throughput is significantly improved. We further extend this feedback mechanism to support the multicabinet implementation of a load-balanced switch, where the propagation delay between switch linecards and switch fabrics is nonnegligible. As compared to the existing load-balanced switch architectures and scheduling algorithms, our solutions impose a modest requirement on switch hardware, but consistently yield better delay-throughput performance. Last but not least, some extensions and refinements are made to address the scalability, implementation, and fairness issues of our solutions. © 2009 IEEE.published_or_final_versio

Achieving 100% throughput for multicast traffic in input-queued switches

A general approach of designing input-queued multicast switch is to employ multicast switch fabric, where packets can be replicated inside the switch fabric. As compared with unicast switch fabric, the achievable traffic rate region of a switch can be increased, but it is still less than the admissible traffic rate region. In other words, achieving 100% throughput for any admissible multicast traffic pattern is not possible. In this paper, we first revisit the fundamental problems faced by input-queued switch in supporting multicast traffic. We then argue that multicast switch fabric is not necessary if a load-balanced approach is followed. Accordingly, an existing load-balanced two-stage switch architecture [12], consisting of unicast switch fabrics, can be adopted to provide 100% throughput for any admissible multicast traffic pattern. Since the two-stage switch requires no speedup in both switch fabric and packet buffers, we consider it a two-stage input-queued switch. It can be seen that its implementation complexity is much lower than conventional (single-stage) input-queued multicast switches. As compared with the work in [12], our approach is more systematic and we propose a more effective load balancing mechanism. © 2011 IEEE.link_to_subscribed_fulltextProceedings of the IEEE Global Telecommunications Conference (GLOBECOM 2011), Houston, TX, USA, 5-9 December 201

Efficient channel borrowing strategy for real-time services in multimedia wireless networks

An efficient resource sharing strategy is proposed for multimedia wireless networks. Assume the channel resource in a wireless system is partitioned into two sets: one for voice calls and one for video calls. In the proposed channel borrowing strategy, voice calls can borrow channels from those pre-allocated to video calls temporarily when all voice channels are busy. A threshold type decision policy is designed such that the channel borrowing request will be granted only if the quality of service (QoS) requirement on video call blocking will not be violated during the duration of channel lending. An analytical model is constructed for evaluating the performance of the channel borrowing strategy in a simplified wireless system and is verified by computer simulations. We found that the proposed channel borrowing scheme can significantly reduce the voice call blocking probability while the increase in video call blocking probability is insignificant.published_or_final_versio

Minimizing the communication overhead of iterative scheduling algorithms for input-queued switches

Communication overhead should be minimized when designing iterative scheduling algorithms for input-queued packet switches. In general, the overall communication overhead is a function of the number of iterations required per time slot (M) and the data bits exchanged in an input-output pair per iteration (B). In this paper, we aim at maximizing switch throughput while minimizing communication overhead. We first propose a single-iteration scheduling algorithm called Highest Rank First (HRF). In HRF, the highest priority is given to the preferred input-output pair calculated in each local port at a RR (Round Robin) order. Only when the preferred VOQ(i,j) is empty, input i sends a request with a rank number r to each output. The request from a longer VOQ carries a smaller r. Higher scheduling priority is given to the request with a smaller r. To further cut down its communication overhead to 1 bit per request, we design HRF with Request Compression (HRF/RC). The basic idea is that we transmit a single bit code in request phase. Then r can be decoded at output ports from the current and historical codes received. The overall communication overhead for HRF/RC becomes 2 bits only, i.e. 1 bit in request phase and 1 bit in grant phase. We show that HRF/RC renders a much lower hardware cost than multi-iteration algorithms and a single-iteration algorithm π-RGA [11]. Compared with other iterative algorithms with the same communication overhead (i.e. SRR [10] and 1-iteration iSLIP [6]), simulation results show that HRF/RC always produces the best delay-throughput performance. © 2011 IEEE.published_or_final_versionProceedings of the IEEE Global Telecommunications Conference (GLOBECOM 2011), Houston, TX, USA, 5-9 December 201

Chandra and Swift X-ray Observations of the X-ray Pulsar SMC X-2 During the Outburst of 2015

We report the Chandra/HRC-S and Swift/XRT observations for the 2015 outburst of the high-mass X-ray binary pulsar in the Small Magellanic Cloud, SMC X-2. While previous studies suggested that either an O star or a Be star in the field is the high-mass companion of SMC X-2, our Chandra/HRC-S image unambiguously confirms the O-type star as the true optical counterpart. Using the Swift/XRT observations, we extracted accurate orbital parameters of the pulsar binary through a time of arrivals analysis. In addition, there were two X-ray dips near the inferior conjunction, which are possibly caused by eclipses or an ionized high-density shadow wind near the companion’s surface. Finally, we propose that an outflow driven by the radiation pressure from day ∼10 played an important role in the X-ray/optical evolution of the outburst.postprin

Swift Detection of a 65 Day X-Ray Period from the Ultraluminous Pulsar NGC 7793 P13

NGC 7793 P13 is an ultraluminous X-ray source harboring an accreting pulsar. We report on the detection of a ~65 day period X-ray modulation with Swift observations in this system. The modulation period found in the X-ray band is P = 65.05 ± 0.10 days and the profile is asymmetric with a fast rise and a slower decay. On the other hand, the u-band light curve collected by Swift UVOT confirmed an optical modulation with a period of P = 64.24 ± 0.13 days. We explored the phase evolution of the X-ray and optical periodicities and propose two solutions. A superorbital modulation with a period of ~2700–4700 days probably caused by the precession of a warped accretion disk is necessary to interpret the phase drift of the optical data. We further discuss the implication if this ~65 day periodicity is caused by the superorbital modulation. Estimated from the relationship between the spin-orbital and orbital-superorbital periods of known disk-fed high-mass X-ray binaries, the orbital period of P13 is roughly estimated as 3–7 days. In this case, an unknown mechanism with a much longer timescale is needed to interpret the phase drift. Further studies on the stability of these two periodicities with a long-term monitoring could help us to probe their physical origins.postprin

Radiation-induced root surface caries restored with glass-ionomer cement placed in conventional and ART cavity preparations: Results at two years

The document attached has been archived with permission from the Australian Dental Association (8th Jan 2008). An external link to the publisher’s copy is included.Background: There are no published studies comparing the clinical performances of more-viscous glass-ionomer cement (GIC) restorations when placed using conventional and atraumatic restorative treatment (ART) cavity preparation methods to restore root surface caries. Methods: One dentist used encapsulated Fuji IX GP and Ketac-Molar to restore 72 conventional and 74 ART cavity preparations for 15 patients who had received cervicofacial radiation therapy. Two assessors evaluated the restorations at six, 12, and 24 months for retention, marginal defects and surface wear, and recurrent caries. Results: After two years, the cumulative restoration successes were 65.2 per cent for the conventional and 66.2 per cent for the ART cavity preparations, without statistical or clinical significance (P>0.50). Restoration dislodgement accounted for 82.8 per cent and marginal defects for 17.2 per cent of all failures. There were no instances of unsatisfactory restoration wear or recurrent caries observed. Teeth with three or more restored cervical surfaces accounted for 79.3 per cent of all failures (P<0.0001). Conclusions: For root surface caries restored with GIC, the use of hand instruments only with the ART method was an equally effective alternative to conventional rotary instrumentation for cavity preparation. Larger restorations had higher failures, usually from dislodgement.JY Hu, XC Chen, YQ Li, RJ Smales and KH Yi

Loss of APD1 in Yeast Confers Hydroxyurea Sensitivity Suppressed by Yap1p Transcription Factor

Ferredoxins are iron-sulfur proteins that play important roles in electron transport and redox homeostasis. Yeast Apd1p is a novel member of the family of thioredoxin-like ferredoxins. In this study, we characterized the hydroxyurea (HU)-hypersensitive phenotype of apd1Δ cells. HU is an inhibitor of DNA synthesis, a cellular stressor and an anticancer agent. Although the loss of APD1 did not influence cell proliferation or cell cycle progression, it resulted in HU sensitivity. This sensitivity was reverted in the presence of antioxidant N-acetyl-cysteine, implicating a role for intracellular redox. Mutation of the iron-binding motifs in Apd1p abrogated its ability to rescue HU sensitivity in apd1Δ cells. The iron-binding activity of Apd1p was verified by a color assay. By mass spectrometry two irons were found to be incorporated into one Apd1p protein molecule. Surprisingly, ribonucleotide reductase genes were not induced in apd1Δ cells and the HU sensitivity was unaffected when dNTP production was boosted. A suppressor screen was performed and the expression of stress-regulated transcription factor Yap1p was found to effectively rescue the HU sensitivity in apd1Δ cells. Taken together, our work identified Apd1p as a new ferredoxin which serves critical roles in cellular defense against HU.published_or_final_versio