scholarly journals An Improved Error Control Model in Packet Switched Wide Area Networks

2019 ◽  
Vol 7 (4) ◽  
pp. 01-18
Author(s):  
Voke Ogbimi ◽  
Emuejevoke Francis
Keyword(s):  
Traffic Congestion ◽  
Error Control ◽  
Local Area ◽  
Wide Area ◽  
Buffer Size ◽  
Wide Area Networks ◽  
Network Nodes ◽  
Network Utilization ◽  
Shared Networks ◽  
Improved Model

Error is an important problem in communication that occurs in shared networks when a packet fails to arrive at the destination or it arrives at the destination but some of the bits are in error or have been altered. In typical packet switched wide area networks, this can occur quite easily when output links are slower than inputs and multiple traffic sources competing for same output link at the same time. Typical for packet switched WAN, the packet transmit input/output buffer and queue of the network devices in their way towards the destination. Moreover, these networks are characterized by the fact that packets often arrive in “burst”. The buffers in the network devices are intended to assimilate these traffic hosts until they can be processed. Nevertheless, the available buffers in the network nodes may fill up rapidly if the network traffic is too high which in turn may lead to discarded packets. The situation cannot be avoided by increasing the size of the buffers, since unreasonable buffer size will lead to excessive end-to-end (e2e) delay. A typical scenario for congestion occurs where multiple incoming link feed into single outgoing link (e.g several Local Area Networks connected to Wide Area Networks). The routers of the networks are highly susceptible for traffic congestion because they are too small for the amount of traffic required to handle. This paper presented  general concepts of Error Control and its mechanisms and its application to packet switched wide area networks An improved model was proposed with reduced error while transmitting packets from one channel to the other. Simulating the model for reducing error control in packet switched wide area networks increased the number of messages, reduced response time used in transmitting and receiving packets, reduced network utilization.

Wide Area Networks

2011 ◽  
pp. 971-978 ◽  
Author(s):  
Raymond A. Hansen ◽  
Phillip T. Rawles
Keyword(s):  
Local Area Networks ◽  
Local Area ◽  
Third Party ◽  
Network Services ◽  
Wide Area ◽  
Wide Area Networks ◽  
Telecommunication Systems

When network services must be distributed over large geographic areas, it is essential to have an understanding of the telecommunication systems on which such distribution depends. One of the most significant differences between wide area networks (WANs) and local area networks (LANs) is the general dependency on third-party carriers to provide these transmission services. Whenever data is being sent across a WAN it must be routed between locations.

VIEW-DEPENDENT RENDERING FOR LARGE POLYGONAL MODELS OVER NETWORKS

2003 ◽  
Vol 03 (02) ◽  
pp. 265-290 ◽  
Author(s):  
JIHAD EL-SANA ◽  
NETA SOKOLOVSKY
Keyword(s):  
Storage Capacity ◽  
Local Area Networks ◽  
Local Area ◽  
Computing System ◽  
Wide Area ◽  
Wide Area Networks ◽  
Levels Of Detail ◽  
Novel Approach ◽  
Incremental Update ◽  
Selection Of

In this paper we are presenting a novel approach that enables the rendering of large-shared datasets at interactive rates using inexpensive workstations. Our algorithm is based on view-dependent rendering and client-server technology — servers host large datasets and manage the selection of the various levels of detail, while clients receive blocks of update operations which are used to generate the appropriate level of detail in an incremental manner. We assume that servers are capable machines in terms of storage capacity and computational power and clients are inexpensive workstations which have limited 3D rendering capabilities. For optimization purposes we have developed two similar approaches — one for local area networks and the other for wide area networks. For the second approach we have performed several changes to adapt to the limitation of the wide area networks. To avoid network latency we have developed two powerful mechanisms that cache the adapt operation blocks on the clients' side and predict the future view-parameters of clients based on their recent behavior. Our approach dramatically reduces the amount of memory used by each client and the entire computing system since the dataset is stored only once in the local memory of the server. In addition, it decreases the load on the network as a result of the incremental update contributed by view-dependent rendering.

scholarly journals Energy Efficiency in Short and Wide-Area IoT Technologies—A Survey

Technologies ◽  
2021 ◽  
Vol 9 (1) ◽  
pp. 22
Author(s):  
Eljona Zanaj ◽  
Giuseppe Caso ◽  
Luca De Nardis ◽  
Alireza Mohammadpour ◽  
Özgü Alay ◽  
...  
Keyword(s):  
Energy Efficiency ◽  
Internet Of Things ◽  
Low Power ◽  
Energy Efficient ◽  
Wide Area ◽  
Wide Area Networks ◽  
The Internet ◽  
Extensive Review ◽  
Research Directions ◽  
The Internet Of Things

In the last years, the Internet of Things (IoT) has emerged as a key application context in the design and evolution of technologies in the transition toward a 5G ecosystem. More and more IoT technologies have entered the market and represent important enablers in the deployment of networks of interconnected devices. As network and spatial device densities grow, energy efficiency and consumption are becoming an important aspect in analyzing the performance and suitability of different technologies. In this framework, this survey presents an extensive review of IoT technologies, including both Low-Power Short-Area Networks (LPSANs) and Low-Power Wide-Area Networks (LPWANs), from the perspective of energy efficiency and power consumption. Existing consumption models and energy efficiency mechanisms are categorized, analyzed and discussed, in order to highlight the main trends proposed in literature and standards toward achieving energy-efficient IoT networks. Current limitations and open challenges are also discussed, aiming at highlighting new possible research directions.

Modelling global computations with Klaim

2008 ◽  
Vol 366 (1881) ◽  
pp. 3737-3745 ◽  
Author(s):  
Rocco De Nicola ◽  
Michele Loreti
Keyword(s):  
Distributed Systems ◽  
Formal Semantics ◽  
Wide Area ◽  
Wide Area Networks ◽  
Qualitative And Quantitative ◽  
Global Computing ◽  
New Models ◽  
And Control ◽  
Tuple Spaces ◽  
Coordination And Control

A new area of research, known as Global Computing, is by now well established. It aims at defining new models of computation based on code and data mobility over wide-area networks with highly dynamic topologies, and at providing infrastructures to support coordination and control of components originating from different, possibly untrusted, fault-prone, malicious or selfish sources. In this paper, we present our contribution to the field of Global Computing that is centred on Kernel Language for Agents Interaction and Mobility ( Klaim ). Klaim is an experimental language specifically designed to programme distributed systems consisting of several mobile components that interact through multiple distributed tuple spaces. We present some of the key notions of the language and discuss how its formal semantics can be exploited to reason about qualitative and quantitative aspects of the specified systems.

Sign in / Sign up

Export Citation Format

Share Document