Reverse bias capacitance measurements on copper-doped germanium p-n junctions in the breakdown region

Results of measurements at a high frequency on reverse bias capacitance of copper-doped germanium junctions are reported. Phenomenal increase in capacitance is found in the breakdown region, particularly at low temperatures.

Impulse-voltage breakdown characteristics of large gaps at low pressures

A study of the gap breakdown voltage characteristic at a low pressure of 7×10-5 Torr with a standard (1/50)-μsec impulse-voltage wave reveals an agreement with the criterion Vb=Cd0.5 suggested by Cranberg. Voltage-time-to-breakdown characteristics has also been determined. From these studies, it is concluded that impulse breakdown in vacuum is initiated by an electron current heating an anode spot and thereby liberating a clump which causes breakdown.

Epoxy resin chamber for high voltage breakdown studies in high vacuum

As the study of electrical breakdown phenomena in vacuum systems, gains more importance, a thorough understanding of the breakdown mechanism at high voltages necessitates a chamber for experimental studies. An epoxy-resin chamber has been constructed by casting ring sections which were joined together. The advantages of such a chamber over the conventional metal or glass chamber are given especially as regards the electric field configuration, high voltage lead-in, and the ease of construction. Special facilities can be incorporated while constructing the chamber which makes it more versatile; for example, in pre-breakdown current measurements, electron beam focusing studies, etc.

Breakdown in p‐n junction diodes made on polycrystalline silicon of large grain size

This communication describes the voltage‐current characteristics in the breakdown region of p‐n junctions made on polycrystalline silicon of large grain size. The observed soft breakdown characteristics have been explained by taking into account the effect of curvature of the junction near the grain boundaries.

Analysis of effects of ambients (temperature and light intensity) on the electrical breakdown in bipolar transistors

This paper presents an analysis of the effects of ambients-temperature and light intensity on the V-l characteristics of bipolar transistors under electrical breakdown. The analysis is based on the transportation and storage of majority carriers in the base region. It is shown that this analysis can explain the observed shift in the V-l characteristics to lower voltages with increase in either temperature or light intensity.

Cross-field gas breakdown in a coaxial cylinder geometry

Sparking potentials in a coaxial cylinder geometry in oxygen and dry air were measured in crossed electric and magnetic fields. From the data effective collision frequencies were calculated using the equivalent pressure concept. It is shown that the equivalent pressure concept holds good for deriving the effective collision frequencies in non-uniform electric fields.

Macroscopic model of city traffic using bond graph modelling

Modelling of city traffic involves capturing of all the dynamics that exist in real-time traffic. Probabilistic models and queuing theory have been used for mathematical representation of the traffic system. This paper proposes the concept of modelling the traffic system using bond graphs wherein traffic flow is based on energy conservation. The proposed modelling approach uses switched junctions to model complex traffic networks. This paper presents the modelling, simulation and experimental validation aspects.

The effect of traffic shaping in efficiently providing end-to-end performance guarantees

This paper reports new results concerning the capabilities of a family of service disciplines aimed at providing per-connection end-to-end delay (and throughput) guarantees in high-speed networks. This family consists of the class of rate-controlled service disciplines, in which traffic from a connection is reshaped to conform to specific traffic characteristics, at every hop on its path. When used together with a scheduling policy at each node, this reshaping enables the network to provide end-to-end delay guarantees to individual connections. The main advantages of this family of service disciplines are their implementation simplicity and flexibility. On the other hand, because the delay guarantees provided are based on summing worst case delays at each node, it has also been argued that the resulting bounds are very conservative which may more than offset the benefits. In particular, other service disciplines such as those based on Fair Queueing or Generalized Processor Sharing (GPS), have been shown to provide much tighter delay bounds. As a result, these disciplines, although more complex from an implementation point-of-view, have been considered for the purpose of providing end-to-end guarantees in high-speed networks. In this paper, we show that through ''proper'' selection of the reshaping to which we subject the traffic of a connection, the penalty incurred by computing end-to-end delay bounds based on worst cases at each node can be alleviated. Specifically, we show how rate-controlled service disciplines can be designed to outperform the Rate Proportional Processor Sharing (RPPS) service discipline. Based on these findings, we believe that rate-controlled service disciplines provide a very powerful and practical solution to the problem of providing end-to-end guarantees in high-speed networks.

Queuing strategies for qos management of traffic between lans interconnected by low-speed wan links

We provide a comparative performance evaluation of packet queuing and link admission strategies for low-speed wide area network Links (e.g. 9600 bps, 64 kbps) that interconnect relatively highspeed, connectionless local area networks (e.g. 10 Mbps). In particular, we are concerned with the problem of providing differential quality of service to interLAN remote terminal and file transfer sessions, and throughput fairness between interLAN file transfer sessions. We use analytical and simulation models to study a variety of strategies. Our work also serves to address the performance comparison of connectionless vs. connection-oriented interconnection of CLNS LANS. When provision of priority at the physical transmission level is not feasible, we show, for low-speed WAN links (e.g. 9600 bps), the superiority of connection-oriented interconnection of connectionless LANs, with segregation of traffic streams with different QoS requirements into different window flow controlled connections. Such an implementation can easily be obtained by transporting IP packets over an X.25 WAN. For 64 kbps WAN links, there is a drop in file transfer throughputs, owing to connection overheads, but the other advantages are retained, The same solution also helps to provide throughput fairness between interLAN file transfer sessions. We also provide a corroboration of some of our modelling results with results from an experimental test-bed.

Saturation throughput analysis of an input queueing ATM switch with multiclass bursty traffic

In this paper we consider an N x N non-blocking, space division ATM switch with input cell queueing. At each input, the cell arrival process comprises geometrically distributed bursts of consecutive cells for the various outputs. Motivated by the fact that some input links may be connected to metropolitan area networks, and others directly to B-ISDN terminals, we study the situation where there are two classes of inputs with different values of mean burst length. We show that when inputs contend for an output, giving priority to an input with smaller expected burst length yields a saturation throughput larger than if the reverse priority is given. Further, giving priority to less bursty traffic can give better throughput than if all the inputs were occupied by this less bursty traffic. We derive the asymptotic (as N --> infinity) saturation throughputs for each priority class.

Reinforcement Learning With Function Approximation for Traffic Signal Control

We propose, for the first time, a reinforcement learning (RL) algorithm with function approximation for traffic signal control. Our algorithm incorporates state-action features and is easily implementable in high-dimensional settings. Prior work, e. g., the work of Abdulhai et al., on the application of RL to traffic signal control requires full-state representations and cannot be implemented, even in moderate-sized road networks, because the computational complexity exponentially grows in the numbers of lanes and junctions. We tackle this problem of the curse of dimensionality by effectively using feature-based state representations that use a broad characterization of the level of congestion as low, medium, or high. One advantage of our algorithm is that, unlike prior work based on RL, it does not require precise information on queue lengths and elapsed times at each lane but instead works with the aforementioned described features. The number of features that our algorithm requires is linear to the number of signaled lanes, thereby leading to several orders of magnitude reduction in the computational complexity. We perform implementations of our algorithm on various settings and show performance comparisons with other algorithms in the literature, including the works of Abdulhai et al. and Cools et al., as well as the fixed-timing and the longest queue algorithms. For comparison, we also develop an RL algorithm that uses full-state representation and incorporates prioritization of traffic, unlike the work of Abdulhai et al. We observe that our algorithm outperforms all the other algorithms on all the road network settings that we consider.