Journal of High Speed Networks - Volume 17, issue 2

Authors: Haddix, Furman | Peng, Wuxu

Article Type: Research Article

Abstract: We introduce an alternator with uniform processes that executes in a process graph of arbitrary topology. In general, alternators are free from deadlock, protect against simultaneous execution of the critical sections of dependent processes, and after a finite number of executions provide a high degree of concurrency and some degree of fairness (deterministically or stochastically). Because this alternator has uniform processes, strong fairness and concurrency are properties obtained after a finite number of steps with an arbitrary probability, due to the possibility of symmetry in states. The size of the state space and the periodicity of critical section execution are …dependent upon the initial state. The worst case size of the state space utilized and period between critical sections executions depend upon the diameter of the graph of processes. An important value of alternators is their capacity for transforming systems correct under serial (interleaving) semantics to systems correct under concurrent or maximal (power set) semantics. This property is based upon a graph of processes representing the alternator in which the vertices are processes and the edges are dependencies between processes. Show more

Keywords: Operating systems support, distributed computing, interconnection networks, self-stabilization

DOI: 10.3233/JHS-2010-0333

Citation: Journal of High Speed Networks, vol. 17, no. 2, pp. 73-81, 2010

Authors: Vieira, Flávio Henrique Teles | Bianchi, Gabriel Rocon | Lee, Luan Ling

Article Type: Research Article

Abstract: This work extends the notion of the widely mentioned and used fractional Brownian traffic model in the literature. Extensive experimental investigations indicate that the proposed traffic model, named extended fractional Brownian traffic, can capture not only the self-similar properties, but also the inherent multifractal characteristics of those traffic flows found in modern communication networks. Additionally, the structure of this traffic model is taken into account in a traffic prediction algorithm that benefits from the more accurate traffic modeling. The experimental results clearly point out the advantages of using the proposed model in traffic modeling as well as in traffic prediction.

Keywords: Network traffic, multifractal model, traffic prediction

DOI: 10.3233/JHS-2010-0334

Citation: Journal of High Speed Networks, vol. 17, no. 2, pp. 83-96, 2010

Authors: Shi, Lei | Li, Wenjie | Liu, Bin

Article Type: Research Article

Abstract: Parallel Packet Switch (PPS) is broadly used in designing large-capacity switching fabrics, since it resolves the bottlenecks of scheduling algorithm, memory bandwidth, and serial transmission technology simultaneously. Current packet-based load-balancing algorithms for PPS cannot preserve intra-flow packet orders without costly reordering mechanisms. In this paper, we study the feasibility of flow-based packet-mode load-balancing algorithm, which thoroughly avoids packet out-of-order. Through performance analysis based on traffic model from real-trace, we show that given moderate speedups, all the three proposed flow-based algorithms can provide throughput and delay guarantees under admissible traffic input. Trace-driven simulations are carried out to verify our results.

Keywords: Packet-mode switching, flow-based switching, parallel packet switch, load-balancing

DOI: 10.3233/JHS-2010-0335

Citation: Journal of High Speed Networks, vol. 17, no. 2, pp. 97-128, 2010