scholarly journals A queueing network analysis of dynamic reconfigurability in a hierarchical information network

1994 ◽  
Vol 31 (A) ◽  
pp. 99-114
Author(s):  
U. Narayan Bhat ◽  
Richard E. Nance

Hierarchical information networks are important in applications where the information management must support an existing tree-structured organization. Embedded computer-communication systems in military applications, with a dominant hierarchical command structure, are the most prominent examples. Also typical of such applications is the variability in message demand (both sources and intensity) depending on the external conditions encountered by the encapsulating system (the system supported by the embedded computer-communication system). Using a queueing network model for a hierarchical information network, we compare the effect of limited dynamic reconfiguration on expected transmission delays. The limited reconfigurability takes the form of apex transition among a proper subset of the communication nodes designated as the apex candidate set. Each apex candidate can assume the ultimate position under designated conditions. This network architecture is called a dynamic hierarchy. The model includes N + 1 nodes (0, …, N) with 0 identifying the apex node. We assume that message processing at each node is described by an M/M/1 model (single server with Poisson arrivals and exponential service times). Further message transfers among the nodes are served by communication links which also behave as M/M/1 queues.Two distinctive features characterize the queueing network model:1. The assignment of a set of weights to the nodes dependent on the hierarchical level reflects the increasing importance of information as it is transferred to higher levels.2. The dynamic hierarchy requires a communications protocol that partitions the analysis of network delay into three periods: regular operation, reconfiguration, and adjustment. Characterization of the performance of the dynamic hierarchy entails the description of message transmission delay as a composite of the three periods.

1994 ◽  
Vol 31 (A) ◽  
pp. 99-114
Author(s):  
U. Narayan Bhat ◽  
Richard E. Nance

Hierarchical information networks are important in applications where the information management must support an existing tree-structured organization. Embedded computer-communication systems in military applications, with a dominant hierarchical command structure, are the most prominent examples. Also typical of such applications is the variability in message demand (both sources and intensity) depending on the external conditions encountered by the encapsulating system (the system supported by the embedded computer-communication system). Using a queueing network model for a hierarchical information network, we compare the effect of limited dynamic reconfiguration on expected transmission delays. The limited reconfigurability takes the form of apex transition among a proper subset of the communication nodes designated as the apex candidate set. Each apex candidate can assume the ultimate position under designated conditions. This network architecture is called a dynamic hierarchy. The model includes N + 1 nodes (0, …, N) with 0 identifying the apex node. We assume that message processing at each node is described by an M/M/1 model (single server with Poisson arrivals and exponential service times). Further message transfers among the nodes are served by communication links which also behave as M/M/1 queues. Two distinctive features characterize the queueing network model: 1. The assignment of a set of weights to the nodes dependent on the hierarchical level reflects the increasing importance of information as it is transferred to higher levels. 2. The dynamic hierarchy requires a communications protocol that partitions the analysis of network delay into three periods: regular operation, reconfiguration, and adjustment. Characterization of the performance of the dynamic hierarchy entails the description of message transmission delay as a composite of the three periods.


2014 ◽  
Vol 13 (9) ◽  
pp. 4922-4932 ◽  
Author(s):  
CH V Raghavendran ◽  
G. Naga Satish ◽  
M.V. Rama Sundari ◽  
P. Suresh Varma

In this paper, we develop a two node tandem communication network model with dynamic bandwidth allocation and feedback for the first node. In most of the communication systems, the arrivals of packets follow Non-Homogeneous and arrival rate is time dependent. In this model, the transmission rate of each transmitter depends on the number of packets in the buffer connected it. The transmission rates at each transmitter are adjusted depending upon the content of the buffer connected to it. The packets transmitted through the first transmitter may be forwarded to the buffer connected to the second transmitter or returned back to the first buffer with certain probabilities. Using the difference-differential equations the performance measures including average number of packets in each buffer, the probability of emptiness of the network, the average waiting time in the buffer and in the network, the throughput of the transmitters, and the variance of the number of packets in the buffer are calculated. It is observed that the load dependent transmission can reduce the delays in the transmission and enhance the channel capacity. 


Author(s):  
Isiaka Ajewale Alimi

The development in different communication systems as well as multimedia applications and services leads to high rate of Internet usage. However, transmission of information over such networks can be compromised and security breaches such as virus, denial of service, unauthorized access, and theft of proprietary information which may have devastating impact on the system may occur if adequate security measures are not employed. Consequently, building viable, effective, and safe network is one of the main technical challenges of information transmission in campus networks. Furthermore, it has been observed that, network threats and attacks exist from the lower layers of network traffic to the application layer; therefore, this paper proposes an effective multi-layer firewall system for augmenting the functionalities of other network security technologies due to the fact that, irrespective of the type of access control being employed, attacks are still bound to occur. The effectiveness of the proposed network architecture is demonstrated using Cisco Packet Tracer. The simulation results show that, implementation of the proposed topology is viable and offers reasonable degree of security at different network layers.


Sensors ◽  
2021 ◽  
Vol 21 (4) ◽  
pp. 1230
Author(s):  
Anda Stoica ◽  
Tibor Kadar ◽  
Camelia Lemnaru ◽  
Rodica Potolea ◽  
Mihaela Dînşoreanu

As virtual home assistants are becoming more popular, there is an emerging need for supporting languages other than English. While more wide-spread or popular languages such as Spanish, French or Hindi are already integrated into existing home assistants like Google Home or Alexa, integration of other less-known languages such as Romanian is still missing. This paper explores the problem of Natural Language Understanding (NLU) applied to a Romanian home assistant. We propose a customized capsule neural network architecture that performs intent detection and slot filling in a joint manner and we evaluate how well it handles utterances containing various levels of complexity. The capsule network model shows a significant improvement in intent detection when compared to models built using the well-known Rasa NLU tool. Through error analysis, we observe clear error patterns that occur systematically. Variability in language when expressing one intent proves to be the biggest challenge encountered by the model.


Sign in / Sign up

Export Citation Format

Share Document