Hyperswitch communication network

The Hyperswitch Communication Network (HCN) is a large scale parallel computer prototype being developed at JPL. Commercial versions of the HCN computer are planned. The HCN computer being designed is a message passing multiple instruction multiple data (MIMD) computer, and offers many advantages in price-performance ratio, reliability and availability, and manufacturing over traditional uniprocessors and bus based multiprocessors. The design of the HCN operating system is a uniquely flexible environment that combines both parallel processing and distributed processing. This programming paradigm can achieve a balance among the following competing factors: performance in processing and communications, user friendliness, and fault tolerance. The prototype is being designed to accommodate a maximum of 64 state of the art microprocessors. The HCN is classified as a distributed supercomputer. The HCN system is described, and the performance/cost analysis and other competing factors within the system design are reviewed

On cost-effective communication network designing

How to efficiently design a communication network is a paramount task for network designing and engineering. It is, however, not a single objective optimization process as perceived by most previous researches, i.e., to maximize its transmission capacity, but a multi-objective optimization process, with lowering its cost to be another important objective. These two objectives are often contradictive in that optimizing one objective may deteriorate the other. After a deep investigation of the impact that network topology, node capability scheme and routing algorithm as well as their interplays have on the two objectives, this letter presents a systematic approach to achieve a cost-effective design by carefully choosing the three designing aspects. Only when routing algorithm and node capability scheme are elegantly chosen can BA-like scale-free networks have the potential of achieving good tradeoff between the two objectives. Random networks, on the other hand, have the built-in character for a cost-effective design, especially when other aspects cannot be determined beforehand.Comment: 6 pages, 4 figure

Communication Network Model for the Fast Reaction Team Program (Trc) “Saribattang” Children in Makassar City

The communication network helps provide the direction and policies of the Quick Response Team (TRC) Program "Saribattang" focus on addressing Social Welfare Problems (PMKS), especially street children, beggars, and sprawl. Rapid Response Team (TRC) "Saribattang" was formed in order to conduct patrol of Social Welfare Persons (PMKS) of Makassar City Social Service. So in the end, reduce PMKS in Makassar City. The research problem is how the operational characteristics and actions, evaluation and sustainability of Saribattang Quick Reaction Team Program for street children and communication network model for sustainability of Saribattang Rapid Response Team Program for street children development in Makassar City. The objectives and targets to be achieved are to understand and describe the characteristics of operational acts and determine the communication activities of street children in the communication network for evaluation and sustainability of the Saribattang Quick Reaction Team Program in the development of street children in Makassar and to find, describe and analyze the model of communication network network) for sustainability of street children development program in Makassar City. For the achievement of objectives and targets are used research methods Mixed-Method research (mixed method research). Methods for obtaining different but complementary data to understand the communication networks formed within the group of street children. The results showed that the non operational street children in Makassar is a complex social problem phenomenon. This phenomenon occurs in the community due to disruption of social functions, said to be disturbed because the child should be in a home situation, school or play environment in which there are interactions that support the child's development, whether physical, motor, social, psychological and moral. Such conditions can not be met by street children. They are required to work on the streets, the operational act they do it refers to the search for extra money, help parents and asked the family. Consideration of policies and strategies of "Innovation Desensitization" (acts of innovation through the development of communication and information) on the target group or individual street children through the communication network leader utilization approach among them. The role of opinion leaders to solve various problems of street children in their group communication networks. Especially in support of Fast Response Team (TRC) “Saribattang” in coaching street children in Makassar City. Establish interpersonal communication approach in integrated communication network. Aiming at the Social Service through Quick Response Team (TRC) Saribattang and street children in Makassar together open themselves in evaluating the successful implementation of programs directly. Model of communication network formation in order to facilitate information dissemination process or program of Quick Reaction Team (TRC) Saribattang in coaching street children in Makassar City. The program does not focus on street children alone but also on the family and other significance of the street children themselves

Coalitional Manipulation on Communication Network

In an abstract model of division problems, we study division rules that are not manipulable through a reallocation of individual characteristic vectors within a coalition (e.g. reallocation of claims in bankruptcy problems). A coalition can be formed if members of the coalition are connected on a communication network, or a graph. We offer a characterization of non-manipulable division rules without any assumption on the structure of communication network. As corollaries, we obtain a number of earlier characterization results established with the assumption of complete network (complete graph) in various specialized settings. Moreover, our characterization, as we show, can be quite different from the earlier results depending on the network structure: for example, when the network is a tree, much larger family of rules are shown to be non-manipulable. The abstract model we consider can have various special examples such as bankruptcy problems, surplus sharing problems, cost sharing problems, social choice with transferable utility, etcDivision problem; Coalitional manipulation; Non-manipulability; Reallocation-proofness; Non-bossiness; Network

Cross-over behaviour in a communication network

We address the problem of message transfer in a communication network. The network consists of nodes and links, with the nodes lying on a two dimensional lattice. Each node has connections with its nearest neighbours, whereas some special nodes, which are designated as hubs, have connections to all the sites within a certain area of influence. The degree distribution for this network is bimodal in nature and has finite variance. The distribution of travel times between two sites situated at a fixed distance on this lattice shows fat fractal behaviour as a function of hub-density. If extra assortative connections are now introduced between the hubs so that each hub is connected to two or three other hubs, the distribution crosses over to power-law behaviour. Cross-over behaviour is also seen if end-to-end short cuts are introduced between hubs whose areas of influence overlap, but this is much milder in nature. In yet another information transmission process, namely, the spread of infection on the network with assortative connections, we again observed cross-over behaviour of another type, viz. from one power-law to another for the threshold values of disease transmission probability. Our results are relevant for the understanding of the role of network topology in information spread processes.Comment: 12 figure

Cross-Layer Optimization in OFDM Wireless Communication Network

The wide use of OFDM systems in multiuser environments to overcome problem of communication over the wireless channel has gained prominence in recent years. Cross-layer Optimization technique is aimed to further improve the efficiency of this network. This chapter demonstrates that significant improvements in data traffic parameters can be achieved by applying cross-layer optimization tech- niques to packet switched wireless networks. This work compares the system capacity, delay time and data throughput of QoS traffic in a multiuser OFDM system using two algorithms. The first algorithm, Maximum Weighted Capacity, uses a cross-layer design to share resources and schedule traffic to users on the network, while the other algorithm (Maximum Capacity) simply allocates resources based only on the users channel quality. The results of the research shows that the delay time and data throughput of the Maximum Weighted Capacity algorithm in cross layer OFDM system is much better than that of the Maximum Capacity in simply based users channel quality system. The cost incurred for this gain is the increased complexity of the Maximum Weighted Capacity scheme

Analyzing wireless communication network vulnerability with homological invariants

This article explains how sheaves and homology theory can be applied to simplicial complex models of wireless communication networks to study their vulnerability to jamming. It develops two classes of invariants (one local and one global) for studying which nodes and links present more of a liability to the network's performance when under attack.Comment: Submitted to ICASSP 201