Provider link state bridging

Wide area communications technology has been challenged to virtualize large numbers of Ethernet LAN segments. This is a consequence of a mismatch between the broadcast nature of the LAN segment and the extremely constrained connectivity implied by the p2p connections or tunnels available in the WAN environment, which have been combined to create virtual LAN segments. PBB-TE has been a practical demonstration of how filtering applied to a broadcast media can result in a connection. This article introduces provider link state bridging (PLSB), which adds a control plane to the PBB data plane in order to extend the techniques for manipulation of Ethernet bridges for unicast paths pioneered by PBB-TE. PLSB solves the problem of largescale virtualization of LAN segments over an Ethernet infrastructure by applying advances in computation performance to the multicast capabilities inherent in the Ethernet data plane. The result is that the fundamental primitives of connectivity today, the broadcast LAN segment and the connection, can be virtualized in a scalable manner on a common (but substantially larger and better utilized) Ethernet-based infrastructure.     

Evaluating secrecy performance of cooperative NOMA networks under existence of relay link and direct link

The secrecy performance of a nonorthogonal multiple access (NOMA) system is examined in this study by employment of a dual‐hop decode‐and‐forward (DF) relay under existence of eavesdropper. Due to the fact that the relay is trusted or untrusted device and thus eavesdropper may wiretap information from the base station or the relay. In this regard, three scenarios related to trusted and untrusted relays are proposed, with different assumptions on the information overhearing ability of the eavesdropper; ie, the first scenario is that an eavesdropper overhears signal from the relay while the BS is overheard by eavesdropper in the second scenarios. More specifically, we derive closed‐form expressions for the secure probability metrics when the direct and relay links experience independent Rayleigh fading. There metrics include strictly positive secrecy capacity (SPSC) and the secure outage probability (SOP). Furthermore, secure performance of traditional orthogonal multiple access (OMA) is also provided as further comparison with NOMA counterpart. We analyze the influence of main coefficients such as the target rates and the transmit SNR factors on the secrecy performance. Our results specify that for reasonable selection of such parameters, secrecy performance can be enhanced remarkably. Numerical results are delivered to corroborate the derived results.     

Evaluating the field bus data link layer by a Petri net-basedsimulation

The performance of the data link layer of the field bus, an emerging LAN architecture for control systems presently under standardization, is discussed and evaluated. Some aspects of the communication mechanism are presented, referring to the use of the two kinds of tokens of the protocol and pointing out their main features and the advantages and disadvantages offered by each one. The protocol was specified by extended timed Petri-nets and was evaluated by a suitable simulation tool. The results provide some criteria according to which the designer can choose, among the various mechanisms made available by the standard proposal, those which provide the most efficient solution for the scenario being considered     

Evaluating the impact of scaling on temperature in FinFET-technology multicore processors

Every new technology node allows higher transistor density and more complex processors to be manufactured. Unfortunately, it also means that, for the same operating conditions, power density in the chip has to increase. However, it is not obvious how this increased power density translates into temperatures in the processor, therefore in this paper we analyze the influence of technology scaling on temperature of integrated circuit manufactured in FinFET technologies. The problem is discussed based on the results of both steady-state and transient thermal simulations obtained for two modern multi-core processors manufactured in 32 nm and 22 nm technologies.     

Efficient and reliable link state information dissemination

Distributing link state information may place a heavy burden on the network resource. In this letter, based on the tree-based reliable topology (TRT), we propose a simple but efficient and reliable scheme for disseminating link state information. We show that the computational complexity of computing the subnet topology over which link state information is distributed is the same as that of computing the minimum spanning tree.     

预测节点剩余能量组合预测的OLSR路由算法

针对传统OLSR路由算法存在的不足,提出了一种节点剩余能量组合预测的OLSR路由算法(MOLSR).首先采用回归移动平均模型对节点的剩余能量线性变化特点进行预测,然后采用神经网络对残差的时间序列建立非线性预测模型,对节点的剩余能量非线性变化特点进行预测,最后将两者的预测结果进行相加,并用于进行OLSR路由算法的路由选择中.仿真结果表明,MOLSR路由算法不仅减小了网络开销,有效防止节点剩余能量过早耗完,而且延长了网络的生存时间,具有一定的实际应用价值.     

On the impact of link layer retransmission schemes on TCP over 4G satellite links

We study the impact of reliability mechanisms introduced at the link layer on the performance of transport protocols in the context of 4G satellite links. Specifically, we design a software module that performs realistic analysis of the network performance, by utilizing real physical layer traces of a 4G satellite service. Based on these traces, our software module produces equivalent link layer traces, as a function of the chosen link layer reliability mechanism. We further utilize the link layer traces within the ns‐2 network simulator to evaluate the impact of link layer schemes on the performance of selected Transmission Control Protocol (TCP) variants. We consider erasure coding, selective‐repeat automatic request (ARQ) and hybrid‐ARQ link layer mechanisms, and TCP Cubic, Compound, Hybla, New Reno and Westwood. We show that, for all target TCP variants, when the throughput of the transport protocol is close to the channel capacity, using the ARQ mechanism is most beneficial for TCP performance improvement. In conditions where the physical channel error rate is high, hybrid‐ARQ results in the best performance for all TCP variants considered, with up to 22% improvements compared to other schemes. Copyright © 2014 John Wiley & Sons, Ltd.     

An information theory based framework for optimal link state update

In this letter, based on information theory, we present a theoretical framework for the optimal link-state update, upon which efficient link-state update policies may be developed.     

EA-HD: a novel link state update mechanism for ASON

When a connection request comes in a mesh optical network, the routers automatically choose the suitable routing paths and wavelength to it according to the network topology and link-state information saved in its global link-state database. Because some of these wavelengths may be released or occupied at any time, the global state database is always out of date and need update by some update policy. A suitable link-state update policy is critical, since a high-frequency update policy imposes heavy burden on the network, while a low-frequency update would increase the inaccurate of the global link-state database. In this paper, we propose a link-state update policy, named the EA-HD policy, which considers two index of a link, one is the Hamming distance between the local link-state database and the global link-state database, and the other is the used ratio of its wavelengths. The proposed update policy gets a trade-off between the accurate of link-state information and its update cost. Simulation results prove that our scheme achieves a good performance in traffic blocking probability while maintaining moderate volume of update traffic.     

Routing-oriented update schEme (ROSE) for link state updating

Few works have been reported to address the issue of updating link state information in order to effectively facilitate quality-of-service (QoS) routing. The idea of modeling the QoS link state information as random variables has been reported, but none of the existing works have provided a comprehensive probabilistic approach to link state update that takes the probability density functions of both the user's QoS requirements and the network's QoS measurements into account. We propose the routing-oriented update scheme (ROSE) that utilizes the knowledge of the history of network operations and user's QoS requirements to improve the efficiency of link state update without increasing the network overhead. ROSE is a new class-based link state update scheme which intelligently determines class sizes to minimize the impact of inaccurate link state information. Through theoretical analysis and extensive simulations, we demonstrate that ROSE outperforms other class- based link state update policies.     

Multipath optimized link state routing for mobile ad hoc networks

Multipath routing protocols for Mobile Ad hoc NETwork (MANET) address the problem of scalability, security (confidentiality and integrity), lifetime of networks, instability of wireless transmissions, and their adaptation to applications.Our protocol, called MultiPath OLSR (MP-OLSR), is a multipath routing protocol based on OLSR [1]. The Multipath Dijkstra Algorithm is proposed to obtain multiple paths. The algorithm gains great flexibility and extensibility by employing different link metrics and cost functions. In addition, route recovery and loop detection are implemented in MP-OLSR in order to improve quality of service regarding OLSR. The backward compatibility with OLSR based on IP source routing is also studied. Simulation based on Qualnet simulator is performed in different scenarios. A testbed is also set up to validate the protocol in real world. The results reveal that MP-OLSR is suitable for mobile, large and dense networks with large traffic, and could satisfy critical multimedia applications with high on time constraints.     

Evaluating the impact of emerging streaming media applications onTCP/IP performance

Emerging streaming media applications in the Internet primarily use UDP transport. The difficulty with supporting this type of traffic on the Internet is that they not only generate large volumes of traffic, but they are also not as responsive to network congestion as TCP-based applications. As a result, streaming media UDP traffic can cause two major problems in the Internet: congestion collapse and unfair allocations of bandwidth among competing traffic flows. A solution to these problems is available in many Internet environments. The Internet backbone, various ISPs, and DSL access networks rely on ATM as their layer 2 transport technology, and in such environments, ATM's available bit rate service can efficiently address these problems. ABR is able to avoid congestion collapse and provide fair bandwidth allocations by distributing the unutilized bandwidth fairly among competing flows. This article presents simulation results and empirical measurements that illustrate the congestion collapse and unfairness problems, and ATM ABR's effectiveness in addressing those problems     

Evaluating reliability of question-disease relations in online health forms: A link prediction approach

The Internet has become an indispensable part of human life in today. People can now easily find answers to questions they are curious about via the internet. The short, effortless and free way that the Internet provides is extremely attractive for people to have an idea in subjects they wonder related to their health. There are many online health forums where people can ask questions answered by health professionals. Every day, people ask thousands of questions on these sites and get answers about which diseases their complaints may be related to. The frequent use of online forum sites by people has led to the selection of these forums as data source for this study, and analysis of reliability. Firstly, in this study, link prediction in bipartite social networks, where intensive works have been done and it is applied on many areas nowadays, is tried to be carried out on question-disease bipartite network constructed with data obtained from analysis of online health forums whose use rate increase substantially. For this purpose, a novel link prediction method called as intensive link prediction is proposed, and prediction success of this method is compared with five of similarity-based link prediction methods. Better results have been obtained with the proposed method than the other methods. Then, the accuracy of the answers given to the users on online health forums which received intense interest are tested. The reliability of online health forums is measured by the accuracy analysis performed.     

Buffer occupancy and link state opportunistic routing for wireless mesh networks

Wireless Networks - Providing a high level of Quality of Service is essential for future wireless networks. This article presents a new multihop wireless routing protocol that opportunistically...     

A peer-to-peer zone-based two-level link state routing for mobilead hoc networks

A new global positioning system (GPS)-based routing protocol for ad hoc networks, called zone-based hierarchical link state (ZHLS) routing protocol, is proposed. In this protocol, the network is divided into nonoverlapping zones. Each node only knows the node connectivity within its zone and the zone connectivity of the whole network. The link state routing is performed on two levels: focal node and global zone levels. Unlike other hierarchical protocols, there is no cluster head in this protocol. The zone level topological information is distributed to all nodes. This “peer-to-peer” manner mitigates traffic bottleneck, avoids single point of failure, and simplifies mobility management. Since only zone ID and node ID of a destination are needed for routing, the route from a source to a destination is adaptable to changing topology. The zone ID of the destination is found by sending one location request to every zone. Simulation results show that our location search scheme generates less overhead than the schemes based on flooding. The results also confirm that the communication overhead for creating and maintaining the topology in the proposed protocol is smaller than that in the flat LSR protocol. This new routing protocol provides a flexible, efficient, and effective approach to accommodate the changing topology in a wireless network environment     

Statistical estimation of link availability and its impact on routing in wireless ad hoc networks

In this paper, an analytical framework is developed and validated via simulation for statistical estimation of the evolution of the separation between a pair of mobile nodes in an ad hoc network. Simulation results demonstrate that path selection based on minimization of the product of the link statistic significantly outperforms minimum‐hop and fixed threshold‐based ‘path‐stability’ schemes. A hierarchical mobility model integrating the dynamic effects of velocity, group movement and geographic scope is used to generalize the results. Another significant result is the performance enhancements hold in large networks irregardless of the assumptions used for statistical estimation. The effect of merging many independent groups appears to restore independent mobility. Finally, results show that at the highest mobility levels, 90% of the longest surviving paths fail within 60 s. None of the strategies approach this optimal value. This important result suggests that optimal predictive mechanisms alone are insufficient to ensure scalable routing in ad hoc networks. Copyright © 2004 John Wiley & Sons, Ltd.     

Evaluating the impact of service quality on the dynamics of customer satisfaction in the telecommunication industry of Jorhat,Assam

Telecommunication Systems - Service quality acts as an antecedent to customer satisfaction (CS). Evaluation of service quality in an enterprise is vital to improve productivity and increase CS....     

基于链路重构—解构的端到端网络链路时延推测研究简

基于网络时延推测的2个假设、时延推测模型和路径时延数据采集方法,提出了一种基于链路重构—解构的端到端网络链路时延推测方法,应用伪似然估计将原整体问题分解为若干独立子问题分别求解,利用链路重构—解构确定可求解的推测单元,控制平均采样精度和减少推测单元链路数,从而显著降低计算复杂度。通过基于模型的计算和基于NS2的仿真实验研究,验证了推测方法的准确性和有效性。     

Performance of new link state advertisement mechanisms in routing protocols with traffic engineering extensions

The prevalent use of best-effort topology driven IP routing protocols with shortest path calculations can often lead to serious imbalance of packet traffic distribution when least cost paths converge on the same set of links, leading to unacceptable delays or packet loss even in the presence of feasible paths over less utilized links. Recently proposed enhancements to common routing protocols are promising to overcome such shortcomings by providing the means to distribute link state information that is more pertinent to traffic engineering in routed networks. This article presents several key results on the performance of the recently proposed OSPF-TE, with particular emphasis on OSPF-TE protocol traffic overhead and the impact of new link state advertisement triggering mechanisms on traffic-engineered routing accuracy.