Queueing Networks Tag Search

1 - Queueing Networks @ IEEE. Done.
2 - Queueing Networks + Communication(s) @ IEEE. Done.
3 - Queueing Networks + Telecommunication(s) @ IEEE.
4 - Queueing Networks + Wireless @ IEEE. Done.
5 - Queueing Networks + Cellular @ IEEE.
6 - Queueing Networks + Data @ IEEE.
7 - Queueing Networks + Inegrated Systems @ IEEE.
8 - Papers that reference BCMP

Ergodicity of Markov chains

1- A Markov chain is called an ergodic chain if it is possible to go from every state to every state (not necessarily in one move).

2- A Markov chain is called a regular chain if some power of the transition matrix has only positive elements.

3- Any transition matrix that has no zeros determines a regular Markov chain.

4- However, it is possible for a regular Markov chain to have a transition matrix that has zeros.

For an ergodic Markov chain P, there is a unique probability vector w such that wP = w and w is strictly positive

source:
http://www.math.dartmouth.edu/archive/m20x06/public_html/Lecture15.pdf

state of the art - 4G

th3r3 is a ind3x3d se3arch option in i333 3xplor3r.

(4g mobile communicationde)

To do

Request these books:

1- Chang, Cheng-Shang: Performance guarantees in communication networks / Cheng-Shang Chang
2- Chen, Hong: Fundamentals of queueing networks : performance, asymptotics, and optimization
3- Disney, Ralph L.: Traffic Processes in queueing networks : a Markov renewal approach / Ralph L. Disney and Peter C. Kiessler. - Baltimore [
4- Gelenbe, Erol: Introduction aux réseaux de files d'attente Introduction to queueing networks /
5- Hogarth, John: Optimization and analysis of queueing networks

Status

Basic model is complete. Reading
1- Towsley: State Dependent Routing for closed form networks.
2- Krezinski: State Dependent Routing for open form networks.
3- Akyildiz: Blocking solutions for product form networks.

tik tak tik tak tik tak

officially started writing the official thesis. 5 months to go.

Plan

Handover Calls Not Poisson

There is strong evidence that handoff traffic is not Poisson. Boltch p.787.

What implication does this have to the model of Tonguz and Yanmaz. Queueing networks can take this into account.

To Do's

1- Understand PS.
2- Implement PS.
3- Modify PS.

PS PS PS.
4- Akyildiz papers on exact solution for blocking systems.
5- State dependent routing papers.

Queueing Model

Tough schedule ahead:

08-13 finish up the Queueing reading.
14-21 formulate the model.
22-27 write and simulate.
28-30 wrap-up.

Mechanism Design for SLA

Mechanism design: The design of an interaction, in which being truthful is the dominant strategy.

The output of the Queueing Model should be in the form of (required bandwidth, probability) and (available bandwidth, probability), which translates to the SLA. Now the question is, what are the values that needs to be truthful?

Next steps, read Manzoor's paper. MAnzoor makes a short state of the art.

PASTA Theorem

Poisson Arrivals See Time Average (PASTA)

* Valid for M/*/*
* The the probability that an arriving user sees the system in state i, is equivalent to the average time spent in that state

Review of Telatar "Combining Queueing Theory with Information Theory for Multiaccess"

Paper.


To Do:

* Summarize.
* Check the citing papers. They are of multiple.

Summary of De Veciana and Zemilanov's Work

Papers
1- Main conference paper.
2- Book Chapter describing the derivations.

Scenario:

* A WAN operator who aims to give universal coverage.
* A WLAN operator who aims to give local high performance coverage.
* Users deciding independently.

Modeling:

* Stochastic geometry is used to model both the position of WAN an WLAN AP's, and users.
* The users make greedy decisions maximizing a given utility function.
* Utility functions are either proximity based or capacity based.
* Proximity based changes with the distance.
* Capacity takes into account the delay of an file download assuming Processor Sharing discipline is used at the base station. The delay is modeled as the delay of a M/G/1-Processor Sharing queue. The more number of users, larger the delay.

Results

* The utility function that include both proximity and capacity reaches a global equilibrium.
* The performance metrics are the average delay over the entire user population, and average worst case delay averaged on different WAN service zones. The congestion sensitive mechanisms give %300-%600 increase over the proximity only metrics.
* Furthermore, the congestion sensitive utility functions reduce the spatial load fluctuations, and are able to reduce the back-haul bandwidth required for the WLAN's this is the largest expenditure for these type of access networks.

Notes

* The congestion sensitive utility function, based on the M/G/1/PS is taken from Sem Borst's paper. Borst in turn takes this from Telatars 1995 paper.

03-04-09 Meeting Minutes

The key to closed form expressions is the property that the state transitions occur between neighbor states only. This is why choosing the state variables correctly matters.

Till Wednesdey Nadim will do state of the art in network sharing, and I will review the books.

03-04-09

Finished reviewing ans summarizing Soft Load balancing. It is a tight coupled solution, that is not applicable for multiple operators. What is relevant are the load monitoring 3gpp standards and two references. Check em by tomorrow.

23-02-09

To do:
solve direct load balancing formula for C=1, B=1.
Finish the slides.

new years resolution 1.5 months late

write here every day. even if you did not find time for phd.

status:

summarize Tonguz and Yanmaz paper until thursday.
have a look at bgp.

-10.5 months!

A new performance criterion? Service deviation?

I came across a performance metric the early designers of the cellular systems employed. In their 1978 paper where they define the hybrid channel sharing algorithm, the authors Kahwa and Georganas, make use of the concept of Service Deviation defined in an early paper in 1973.

Defined as the standard deviation of call blocking probabilities of different cells, they took it as a performance metric, and wanted to make it as small as possible.

What is the relevance of this for an operator in data calls? Or across heterogeneous networks? Would it force network operators to cooperate? I will have to think about this.

Possible Mathematical Models

I found three interesting papers.

1. Tonguz and Yanmaz -2008- A mathematical Theory of Dynamic Load Balancing in Cellular Networks.
   
2. Alanyali and Hajek - 1996 - On Load Balancing in Erlang Networks.
3. Bühler and Wunder - 2007 - Optimal Dynamic Admission Control in Heterogeneous Networks.

The first one derives closed form expression for the blocking probability of various load sharing algorithms for cellular networks. The authors themselves mention that this can be a basis for load sharing among heterogeneous networks. Closed form solutions are necessary for dynamically adjusting the system parameters. This seems the most relevant, and I've started reading it.

-360 days. 12 Months.