12,259 research outputs found
Refinement of Wide-Area Networks
Many experts would agree that, had it not been for public- private key pairs, the investigation of Lamport clocks might never have occurred. Given the current status of distributed epistemologies, electrical engineers urgently desire the visu- alization of RAID, demonstrates the important importance of cryptography. We present an analysis of the World Wide Web (TOM), disproving that the infamous extensible algorithm for the evaluation of thin clients by C. Williams [10] runs in Θ(n!) time
Decoupling Wide-Area Networks From Multi-Processors in Erasure Coding
The implications of event-driven archetypes have been far-reaching and pervasive. After years of key research into link-level acknowledgements, we discon- firm the structured unification of neural networks and information retrieval systems, demonstrates the prac- tical importance of artificial intelligence. This result is entirely an important aim but often conflicts with the need to provide Byzantine fault tolerance to steganographers. We demonstrate that interrupts and the World Wide Web are rarely incompatible [15]
Efficient vertical handover in heterogeneous low-power wide-area networks
As the Internet of Things (IoT) continues to expand, the need to combine communication technologies to cope with the limitations of one another and to support more diverse requirements will proceed to increase. Consequently, we started to see IoT devices being equipped with multiple radio technologies to connect to different networks over time. However, the detection of the available radio technologies in an energy-efficient way for devices with limited battery capacity and processing power has not yet been investigated. As this is not a straightforward task, a novel approach in such heterogeneous networks is required. This article analyzes different low-power wide-area network technologies and how they can be integrated in such a heterogeneous system. Our contributions are threefold. First, an optimal protocol stack for a constrained device with access to multiple communication technologies is put forward to hide the underlying complexity for the application layer. Next, the architecture to hide the complexity of a heterogeneous network is presented. Finally, it is demonstrated how devices with limited processing power and battery capacity can have access to higher bandwidth networks combined with longer range networks and on top are able to save energy compared to their homogeneous counterparts, by measuring the impact of the novel vertical handover algorithm
Adaptive data synchronization algorithm for IoT-oriented low-power wide-area networks
The Internet of Things (IoT) is by now very close to be realized, leading the world towards a new technological era where people’s lives and habits will be definitively revolutionized. Furthermore, the incoming 5G technology promises significant enhancements concerning the Quality of Service (QoS) in mobile communications. Having billions of devices simultaneously connected has opened new challenges about network management and data exchange rules that need to be tailored to the characteristics of the considered scenario. A large part of the IoT market is pointing to Low-Power Wide-Area Networks (LPWANs) representing the infrastructure for several applications having energy saving as a mandatory goal besides other aspects of QoS. In this context, we propose a low-power IoT-oriented file synchronization protocol that, by dynamically optimizing the amount of data to be transferred, limits the device level of interaction within the network, therefore extending the battery life. This protocol can be adopted with different Layer 2 technologies and provides energy savings at the IoT device level that can be exploited by different applications
Optimistic total order in wide area networks
Total order multicast greatly simplifies the implementa- tion of fault-tolerant services using the replicated state ma- chine approach. The additional latency of total ordering can be masked by taking advantage of spontaneous order- ing observed in LANs: A tentative delivery allows the ap- plication to proceed in parallel with the ordering protocol. The effectiveness of the technique rests on the optimistic as- sumption that a large share of correctly ordered tentative deliveries offsets the cost of undoing the effect of mistakes. This paper proposes a simple technique which enables the usage of optimistic delivery also in WANs with much larger transmission delays where the optimistic assumption does not normally hold. Our proposal exploits local clocks and the stability of network delays to reduce the mistakes in the ordering of tentative deliveries. An experimental evalu- ation of a modified sequencer-based protocol is presented, illustrating the usefulness of the approach in fault-tolerant database management
Modelling adaptive routing in Wide Area Networks
Bibliography: leaves 132-138.This study investigates the modelling of adative routing algorithms with specific reference to the algorithm of an existing Wide Area Network (WAN). Packets in the network are routed at each node on the basis of routing tables which contain internal and external delays for each route from the node. The internal delay on a route represents the time that packets queued for transmission will have to wait before being transmitted, while the external delay on a route represents the delay to other nodes via that route. Several modelling methods are investigated and compared for the purpose of identifying the most appropriate and applicable technique. A model of routing in the WAN using an analytic technique is described. The hypothesis of this study is that dynamic routing can be modelled as a sequence of models exhibiting fixed routing. The modelling rationale is that a series of analytic models is run and solved. The routing algorithm of the WAN studied is such that, if viewed at any time instant, the network is one with static routing and no buffer overflow. This characteristic, together with a real time modelling requirement, influences the modelling technique which is applied. Each model represents a routing update interval and a multiclass open queueing network is used to solve the model during a particular interval. Descriptions of the design and implementation of X wan, an X Window based modelling system, are provided. A feature of the modelling system is that it provides a Graphical User Interface (GUI), allowing interactive network specification and the direct observation of network routing through the medium of this interface. Various applications of the modelling system are presented, and overall network behaviour is examined. Experimentation with the routing algorithm is conducted, and (tentative) recommendations are made on ways in which network performance could be improved. A different routing algorithm is also implemented, for the purpose of comparison and to demonstrate the ease with which this can be affected
Recommended from our members
Improving the Performance of Wide Area Networks
Research in to the performance of wide area data networks is described in this thesis. A model of wide area network packet delays is developed and used to direct the research in to methods of improving performance.
Wide area networks are slow and expensive compared to the computer systems that rely on them for communication. Typically data networks are packet switched in order to make efficient use of resources. This can lead to contention, and the mechanisms for resolving contention can bring about further delays when demand for resources is high. In this thesis, network users are viewed as interacting decision makers with conflicting interests, and Game Theory is used to analyse the effects users have on each other’s performance. It is asserted in this thesis that wide area network performance is an ethical issue as well as a technical one.
Compression is examined as a technique for reducing network traffic load. While load reductions can reduce the time packets spend waiting in buffer queues experimental results show the compression process itself can present a bottleneck if CPU resources are limited.
The other inhibiting factor with regard to wide area network performance is the time it takes for a signal to propagate through a transmission medium. Propagation delays are bounded by the speed of light and becomes significant as the distance between computer systems increases. Mirrors and Caches are methods of bringing data closer to the user, thereby reducing propagation delays and capping traffic loads on long haul communication facilities. The performance benefits of replicating data within a wide area network environment are studied in this thesis
Distributed systems management in wide area networks
While quite a few distributed operating systems for local-area networks exist, hardly any work has been done to date on distributed operating systems for wide-area networks. In Europe, a number of public networks are now operational, with gateways between some of them. However, the use of these networks is still mostly restricted to "remote login" and, in some cases, simple file transfer operations. To study these problems and to find structural solutions for efficient and simple use of national and international networks the working group "Distributed Systems Management" was founded within COST 11. Recently, this working group has submitted a research proposal to COST 11 to realise an infrastructure for the implementation of distributed services in a wide-area network in a European collaborative effort. The model, underlying the reserach is the service model, used in many local-area network distributed operating systems. The research project is described, and the proposed infrastructure is discussed in some detail
Efficient service discovery in wide area networks
Living in an increasingly networked world, with an abundant number
of services available to consumers, the consumer electronics market
is enjoying a boom. The average consumer in the developed world may
own several networked devices such as games consoles, mobile phones,
PDAs, laptops and desktops, wireless picture frames and printers to
name but a few. With this growing number of networked devices comes
a growing demand for services, defined here as functions requested
by a client and provided by a networked node. For example, a client
may wish to download and share music or pictures, find and use
printer services, or lookup information (e.g. train times, cinema
bookings).
It is notable that a significant proportion of networked devices are
now mobile. Mobile devices introduce a new dynamic to the service
discovery problem, such as lower battery and processing power and
more expensive bandwidth. Device owners expect to access services
not only in their immediate proximity, but further afield (e.g. in
their homes and offices). Solving these problems is the focus of
this research.
This Thesis offers two alternative approaches to service discovery
in Wide Area Networks (WANs). Firstly, a unique combination of the
Session Initiation Protocol (SIP) and the OSGi middleware technology
is presented to provide both mobility and service discovery
capability in WANs. Through experimentation, this technique is shown
to be successful where the number of operating domains is small, but
it does not scale well.
To address the issue of scalability, this Thesis proposes the use of
Peer-to-Peer (P2P) service overlays as a medium for service
discovery in WANs. To confirm that P2P overlays can in fact support
service discovery, a technique to utilise the Distributed Hash Table
(DHT) functionality of distributed systems is used to store and
retrieve service advertisements. Through simulation, this is shown
to be both a scalable and a flexible service discovery technique.
However, the problems associated with P2P networks with respect to
efficiency are well documented.
In a novel approach to reduce messaging costs in P2P networks,
multi-destination multicast is used. Two well known P2P overlays are
extended using the Explicit Multi-Unicast (XCAST) protocol. The
resulting analysis of this extension provides a strong argument for
multiple P2P maintenance algorithms co-existing in a single P2P
overlay to provide adaptable performance. A novel multi-tier P2P
overlay system is presented, which is tailored for service rich
mobile devices and which provides an efficient platform for service
discovery
- …