Self-similarity properties in a queuing network model

Details Self-similarity properties in a queuing network model Self-similarity properties in a queuing network model

2009-10-05

arxiv.org/abs/0910.0703v1

Computer Science

Networking and Internet Architecture

5 pages, 5 figures

Scientific paper

In this paper a model of subscriber telephone network based on the concept of cellular automata is elaborated. Some fractal properties inherent in the model are revealed that vary depending on parameters assigning its operation rules. The main advantage of the model in question is its compatibility with algorithmic methods - a finite set of formal rules, assigned on a finite set of elements (cells), allows precise realization in the form of algorithms.

Affiliated with

Also associated with

No associations

Rating

Self-similarity properties in a queuing network model does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Self-similarity properties in a queuing network model, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Self-similarity properties in a queuing network model will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-9511