ServerWORKS manager: network management integrated with enterprise and applications servers

In response to the dilemma of increasing system costs and decreasing personnel costs, Digital Equipment Corporation has bundled ServerWORKS Manager with every Digital Prioris server. This provides the customer with a complete package of integrated network management software tools at no additional charge. © 1997 John Wiley & Sons, Ltd.     

Area,energy, and time assessment for a distributed TPM for distributed trust in IoT clusters

IoT clusters arise from natural human societal clusters such as a house, an airport, and a highway. IoT clusters are heterogeneous with a need for device to device as well as device to user trust. The IoT devices are likely to be thin computing clients. Due to low cost, an individual IoT device is not built to be fault tolerant through redundancy. Hence the trust protocols cannot take the liveness of a device for granted. In fact, the differentiation between a failing device and a malicious device is difficult from the trust protocol perspective. We present a minimal distributed trust layer based on distributed consensus like operations. These distributed primitives are cast in the context of the APIs supported by a trusted platform module (TPM). TPM with its 1024 bit RSA is a significant burden on a thin IoT design. We use RNS based slicing of a TPM where in each slice resides within a single IoT device. The overall TPM functionality is distributed among several IoT devices within a cluster. The VLSI area, energy, and time savings of such a distributed TMP implementation is assessed. A sliced/distributed TPM is better suited for an IoT environment based on its resource needs. We demonstrate over 90% time reduction, over 3% area reduction, and over 90% energy reduction per IoT node in order to support TPM protocols.     

Modeling privacy issues in distributed enterprise resource planning systems

With extensive usage and dependence on communication networks, ‘privacy’ issues in enterprise distributed systems have become fundamentally important. Privacy concerns have flooded the market especially in the public domain, and with the changing environment of software usage and involvement of malicious substances associated with any network, it becomes essential to safeguard and ascertain privacy among users and incorporate the same safeguard to protect privacy in software as well. The methodologies and tools architecting distributed enterprise resource planning (ERP) systems are primarily new and are vulnerable to malicious attacks. This paper aims at identifying some of critical privacy issues by collecting data from ERP practitioners. This work models variables associated with ERP with the variables of privacy to establish a robust adoption of ERP practices. Privacy issues concerning ERP are listed. Several variables associated with the development, implementation, and control of ERP are identified in the existing literature. A questionnaire instrument was distributed among a set of ERP practitioners. The response data collected thereby were analyzed statistically. Based upon the statistical analysis, an attempt has been made in the paper to make a ranking of the privacy factors. The observations are discussed in detail, and some specific conclusions have been made. Copyright © 2014 John Wiley & Sons, Ltd.     

Global stability in hopfield neural networks with distributed time delays

In this paper, without assuming the boundedness, monotonicity and differentiability of the activation functions, the conditions ensuring existence, uniqueness, and global asymptotical stability of the equilibrium point of Hopfield neural network models with distributed time delays are studied. Using M-matrix theory and constructing proper Liapunov functionals, the sufficient conditions for global asymptotic stability are obtained.     

A distributed and scalable routing table manager for the next generation of IP routers

In recent years, the exponential growth of Internet users with increased bandwidth requirements has led to the emergence of the next generation of IP routers. Distributed architecture is one of the promising trends providing petabit routers with a large switching capacity and high-speed interfaces. Distributed routers are designed with an optical switch fabric interconnecting line and control cards. Computing and memory resources are available on both control and line cards to perform routing and forwarding tasks. This new hardware architecture is not efficiently utilized by the traditional software models where a single control card is responsible for all routing and management operations. The routing table manager plays an extremely critical role by managing routing information and in particular, a forwarding information table. This article presents a distributed architecture set up around a distributed and scalable routing table manager. This architecture also comes provides improvements in robustness and resiliency. The proposed architecture is based on a sharing mechanism between control and line cards and is able to meet the scalability requirements for route computations, notifications, and advertisements. A comparative scalability evaluation is made between distributed and centralized architectures in terms of required memory and computing resources.     

分布式无线通信系统中的自适应调制空时编码技术

考虑了应用线性离散码(linear disperse coding,LDC)的分布式无线通信系统中非等同调制方式的应用策略.在分布式MIMO(Multiple Input Multiple Output)系统中,通过分析大尺度衰落对传统LDC的后验信噪比(post-SNR]分布的影响,提出了一种偏移LDC的发送策略,这...     

分布式数据质量管理系统在电力企业的实践和应用

随着企业信息化水平和企业精细化管理要求的不断提高,企业对数据管理的需求也随之增强,如何提高企业数据质量更是需要重点解决的问题.针对电力企业数据质量管理面临的挑战,创新提出了分布式数据质量管理解决方案.针对集中式数据质量系统的性能瓶颈,在研究数据质量系统特点并借鉴国内外对大数据的解决方案后,提出了基于Hadoop分布式处理框架的解决方案.利用Hadoop集群,可以把缺陷数据从Oracle 中抽离,分散存储在集群里多台服务器上,以有效提高磁盘I/O性能和数据分析性能.     

Synthesis of linear optimum distributed parameter systems with time delays

A variational calculus approach is used to study quadratic optimization of linear time-delayed distributed parameter systems with distributed and boundary control function. The canonical equations are derived for the necessary condition of optimality. Then the Riccati equations are obtained and their computational solution is discussed.     

Layered space time codes and capacity analysis in correlated fading channels with distributed antenna system

In this paper we have investigated the performance of downlink generalized distributed antenna system(GDAS).Under the assumption of spatial correlated fading conditions,we have derived the numeric expression of correlated coefficients according to series of Bessel function,and have lifted the range restriction of the mean angle of incident.Moreover,the architecture of distributed generalized layered space time codes(GLST) has been considered in order to achieve both multiplexing gain and diversity gain whil...     

分布式实时抽取计算框架设计与应用

针对任务类型的多样化、大量化、复杂化带来的数据源结构、数据类型的问题,文中提出了将Zookeeper消息调度和Redis内存计算相结合的方式,设计分布式实时抽取框架。利用Zookeeper消息通知,队列优先,共享锁等功能,结合Redis支持网络、可基于内存计算亦可持久化日志存储等特性,系统的吞吐量、执行效率、存储效率等都有显著提高。     

传输故障处理经验总结

处理传输故障的关键是故障的准确定位。为了达到这个目标,需要在维护时清楚故障定位的原则、排查故障的可能原因,掌握一种高效的手段或方法来迅速处理可能遇到的各种故障。     

自然音效处理的经验

从追求真实自然的音响效果出发,论述了在野外环境下录制广播剧相关的几个技术环节,从场地选择、传声器设置、录音方式、电源支持等方面,探讨了一套行之有效的解决方法.     

传输故障处理经验总结

处理传输故障的关键是故障的准确定位.为了达到这个目标,需要在维护时清楚故障定位的原则、排查故障的可能原因,掌握一种高效的手段或方法来迅速处理可能遇到的各种故障.     

分布式测量系统时统信号分路电路设计

针对分布式测量系统不同测量单元之间时间统一的问题,设计了一种实用的时统信号分路传输电路。详细分析了电路的设计原理、元器件的选择和电路的具体实现,并对实际电路进行了测试。实验表明,设计的电路在实际运行中稳定可靠,具有较高的工程实用价值。     

分布式POS时间同步算法及软件设计

分布式POS是一种基于惯性/卫星组合技术的柔性基线多节点高精度时空测量系统,是多任务航空遥感载荷高精度成像的关键装置。为了实现分布式POS系统高精度数据融合,该文设计了分布式POS数据采集以及数据融合的时间同步算法,设计分布式POS传递对准算法,编写分布式POS数据处理电路软件,并对算法进行车载实验验证。实验结果表明,分布式POS时间同步算法实现了分布式POS各节点位置、速度、姿态信息的高精度测量。     

光网络分布式恢复机制的恢复时间分析

针对光网络分布式恢复中动态恢复和预计算路由恢复两大类机制,就恢复时间这一至关重要的恢复参数进行了性能分析.通过比较,指出预计算路由恢复机制在快速恢复方面具有更优的性能.     

SYNC‐NET: distributed time synchronization in clustered sensor networks

Time synchronization is essential for several ad‐hoc network protocols and applications, such as TDMA scheduling and data aggregation. In this paper, we propose a time synchronization framework for clustered, multi‐hop sensor networks. We assume that relative node synchronization is sufficient, that is, consensus on one time value is not required. Our goal is to divide the network into connected synchronization regions (nodes within two‐hops) and perform inter‐regional synchronization in O(LLSync) × N_iter time, where O(LLSync) denotes the complexity of the underlying low‐level synchronization technique (used for single‐hop synchronization), and N_iter denotes the number of iterations where the low‐level synchronization protocol is invoked. Thus, our main objective is rapid convergence. We propose novel fully distributed protocols, SYNC‐IN and SYNC‐NET, for regional and network synchronization, respectively, and prove that N_iter is O(1) for all protocols. Our framework does not require any special node capabilities (e.g., being global positioning systems (GPS)‐enabled), or the presence of reference nodes in the network. Our framework is also independent of the particular clustering, inter‐cluster routing, and low‐level synchronization protocols. We formulate a density model for analyzing inter‐regional synchronization, and evaluate our protocols via extensive simulations. Copyright © 2007 John Wiley & Sons, Ltd.     

Dealing with Selfishness and Moral Hazard in Noncooperative Wireless Networks

For noncooperative networks in which each node is a selfish agent, certain incentives must be given to intermediate nodes to let them forward the data for others. What makes the scenario worse is that, in a multihop noncooperative network, the end points can only observe whether or not the end-to-end transaction was successful or not, but not the individual actions of intermediate nodes. Thus, in the absence of properly designed incentive schemes, rational and selfish intermediate nodes may choose to forward data packets at a very low priority or simply drop the packets, and they could put the blame on the unreliable channel. In this paper, assuming the receiver is a trusted authority, we propose several methods that discourage the hidden actions under hidden information in multihop noncooperative networks with high probability. We design several algorithmic mechanisms for a number of routing scenarios such that each selfish agent will maximize its expected utility (i.e., profit) when it truthfully declares its type (i.e., cost and its actions) and it truthfully follows its declared actions. Our simulations show that the payments by our mechanisms are only slightly larger than the actual cost incurred by all intermediate nodes.     

Mean time to failure formulas for standard reliability networks with erlangian distributed component failure times

This paper presents newly developed mean time to failure formulas for reliability networks such as series, parallel, k-out-of-n, series-parallel, parallel-series and a bridge with special case Erlangian distributed component failure times.