In this work we briefly review the wave packet approach of two generation neutrino oscillation, aiming its description in a progenitor star supernova environment. We begin calculating the wave packet size in many situations: solar and supernova plasma medium, considering nuclear interactions, as well as accelerators and reactors. This quantity is important to calculate the coherence length, whi...

Delays in communication networks: Lets consider a bit pipe which offers a capacity of C bits/sec. Assuming we have packets of a fixed length L traversing the bit pipe with the time between packet arrivals being T. If L/C < T then the packets are moving out faster than they come in and we can use the bit pipe to its maximum capacity. However, the preceding statement is true only if L and T are d...

This paper explores traffic dynamics and performance of complex networks. Complex networks of various structures are studied. We use node betweenness centrality, network polarization, and average path length to capture the structural characteristics of a network. Network throughput, delay, and packet loss are used as network performance measures. We investigate how internal traffic, through put...

In this paper, we introduce a novel packet discarding policy called Longest-Packet-In (LPI) which maximizes the cell goodput, the ratio of outgoing good cells to the total number of cells that arrive at a queue. We compare LPI to: Tail Drop, Early Packet Discard, Early Packet Discard with Hysteresis and Fair Early Packet Discard with Hysteresis by investigating the trade-off between maximizing ...

Recently, several gateway-based congestion control mechanisms have been proposed to support the endto-end congestion control mechanism of TCP (Transmission Control Protocol). In this paper, we focus on RED (Random Early Detection), which is a promising gateway-based congestion control mechanism. RED randomly drops an arriving packet with a probability proportional to its average queue length (i...

In this paper, we propose an information theoretic framework within which to study the redundancy present in packet header traces. Packet level and flow level models are developed that capture both temporal and spatial correlation present in packet headers, which can be exploited for packet trace compression. Information theoretic bounds are established for lossless packet header compression. D...

Crossbar-based switches are commonly used to implement routers with throughputs up to about 1 Tb/s. The advent of work-conserving crossbar scheduling algorithms now makes it possible to engineer systems that perform well, even under extreme traffic conditions. Unfortunately, all the published work-conservation results for crossbar scheduling apply only to systems that switch fixed-length cells,...

Crossbar-based switches are commonly used to implement routers with throughputs up to about 1 Tb/s. The advent of work-conserving crossbar scheduling algorithms now makes it possible to engineer systems that perform well, even under extreme traffic conditions. Unfortunately, all the published work-conservation results for crossbar scheduling apply only to systems that switch fixed-length cells,...