Global behavior of homogeneous random neural systems

Gelenbe, Erol; Stafylopatis, Andreas

doi:10.1016/0307-904x(91)90055-t

Cited by 67 publications

(35 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In future work, we propose to examine the use of adaptive evacuee routing techniques [28,29] that can help reach better outcomes, together with probabilistic modelling techniques [30]. Multiple class approaches [31,32] will also be needed to represent and deal with the distinct mobility needs of different categories of users, such as emergency personnel, normal evacuees, or people who are hampered in their mobility or who use wheelchairs.…”

Section: Discussionmentioning

confidence: 99%

Graph and analytical models for emergency evacuation

Desmet

Gelenbe

2013

2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)

Self Cite

View full text Add to dashboard Cite

Cyber-Physical-Human Systems (CPHS) combine sensing, communication and control to obtain desirable outcomes in physical environments for human beings, such as buildings or vehicles. A particularly important application area is emergency management. While recent work on the design and optimisation of emergency management schemes has relied essentially on discrete event simulation, which is challenged by the substantial amount of programming or reprogramming of the simulation tools and by the scalability and the computing time needed to obtain useful performance estimates, this paper proposes an approach that offers fast estimates based on graph models and probability models. We show that graph models can offer insight into the critical areas in an emergency evacuation and that they can suggest locations where sensor systems are particularly important and may require hardening. On the other hand, we also show that analytical models based on queueing theory can provide useful estimates of evacuation times and for routing optimisation. The results are illustrated with regard to the evacuation of a real-life building.

show abstract

Section: Discussionmentioning

confidence: 99%

Graph and analytical models for emergency evacuation

Desmet

Gelenbe

2013

2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)

Self Cite

View full text Add to dashboard Cite

show abstract

“…Additional memory transfers and packet processing at the sources can have energy consequences that will be considered and evaluated in future work so that the overall impact of admission control can be considered both on total delay and total energy consumed for the flows and the network. Another aspect that we plan to pursue is the use of analytical models to predict and optimise the energy and delay related to the admission process; mathematical performance modeling tools are well established [8,12] and will be applied to this particular problem in future work as we have done for energy-aware routing [10].…”

Section: Future Workmentioning

confidence: 99%

Using Energy Criteria to Admit Flows in a Wired Network

Sakellari

Morfopoulou

Mahmoodi

et al. 2012

Computer and Information Sciences III

Self Cite

View full text Add to dashboard Cite

Admission control in wired networks has been traditionally used as a way to control traffic congestion and guarantee quality of service. Here, we propose an admission control mechanism which aims to keep the power consumption at the lowest possible level by restricting the more energy-demanding users. This work relies on the fact that power consumption of networking devices, and of the network as a whole, is not proportional to the carried traffic, as would be the ideal case [1]. As a result some operating regions may be more efficient than others and "jumps" may arise in power consumption when new traffic is added in the network. The proposed mechanism aims to keep power consumption in the lowest possible power consumption level, hopping to the next level only when necessary.

show abstract

“…Thus the algorithm we design in this paper is based on a class of probability models that have been proposed for networked systems and which are known as G-networks [27,28]. G-Networks are queuing networks which have ordinary customers in addition to other customers that were initially inspired by neural networks [29]. In contrast with normal positive customers, negative customers do not receive the normal service at the queues.…”

Section: Network Optimisationmentioning

confidence: 99%

Power Savings in Packet Networks via Optimised Routing

Gelenbe

Morfopoulou

2011

Mobile Netw Appl

Self Cite

View full text Add to dashboard Cite

This paper examines the use of a gradientbased algorithm for Quality of Service (QoS) and power minimisation in wired networks to result on reduced energy consumption. Two distinct schemes, conventional shortest-path routing and an autonomic algorithm energy aware routing algorithm (EARP) are investigated as the starting point for the gradient algorithm. Comparisons are conducted using the same network test-bed and identical network traffic under conditions where routers and link drivers are always kept on so as to meet the needs for network reliability in the presence of possible failures and unexpected overload. Since splitting traffic flows can increase jitter and the arrival of packets which are out of sequence, we also do not allow the same packet flow to be conveyed over multiple paths. In the experiments that we have conducted we observe that power consumed with the gradientoptimiser that is proposed in this paper is a few percent to 10% smaller than that consumed using shortest-path routing or EARP. Although the savings are small, they can be very significant for the Internet backbone as a whole over long periods of time, and further power savings may be obtained by judiciously putting to sleep equipment when it is under-utilised.

show abstract

Global behavior of homogeneous random neural systems

Cited by 67 publications

References 16 publications

Graph and analytical models for emergency evacuation

Graph and analytical models for emergency evacuation

Using Energy Criteria to Admit Flows in a Wired Network

Power Savings in Packet Networks via Optimised Routing

Contact Info

Product

Resources

About