Research on the Maximum Flow of Air Traffic Network Based on Discrete Time Loss Queuing


Article Preview

As maximum flow could be used as a significant indicator of congestion in air traffic network, the flow model was then proposed in the study. When air traffic was influenced by emergencies, this model, adopting the discrete time loss queuing, could obtain the transition probability matrix by building conflicting factors. Then, with the loss probability of network, the theoretical maximum flow was calculated.



Advanced Materials Research (Volumes 328-330)

Edited by:

Liangchi Zhang, Chunliang Zhang and Zichen Chen






Z. Y. Wu et al., "Research on the Maximum Flow of Air Traffic Network Based on Discrete Time Loss Queuing", Advanced Materials Research, Vols. 328-330, pp. 155-158, 2011

Online since:

September 2011




[1] Odoni A R. The flow management problem in air traffic control[M]. Berlin: Springer-Verlag, 1987: 102-103.

[2] Vranas P.B. The Multi-Airport Ground-Holding Problem in Air Traffic Control[D]. Cambridge: Massachusette Institute of Technology, (1992).

[3] Xu Xiaohao, Wang Fei. Research on Slot Allocation Models and Algorithms in Ground Holding Policy[J]. ACTA AERONAUTICA ET ASTRONAUT ICA SINICA, 2010, 31(10): 1993-(2003).

[4] Lee K, Feron E, Pritchett A. Describing airspace complexity: airspace response to disturbances[J]. Journal of Guidance, Control and Dynamics, 2009, 132(1): 210-222.

DOI: 10.2514/1.36308

[5] NI Daiheng. Determining traffic-flow characteristics by definition for application in ITS[J]. IEEE Transactions on Intelligent Transportation Systems, 2007, 8(2): 181-187.

DOI: 10.1109/tits.2006.888621

[6] Cheng-duan Wang. A Simple Solution to Maximum Flow Based on DFS[C] / Education Technology and Computer Science (ETCS), 2010 Second International Workshop, 2010, 3: 692- 695.

DOI: 10.1109/etcs.2010.351

[7] Chang Chungju, Cheng Rayguang, Shi Haotang, Chen Yihshen. Maximum freedom last scheduling algorithm for downlinks of DSRC networks[J]. IEEE Transactions on Intelligent Transportation Systems, 2007, 8(2): 223-232.

DOI: 10.1109/tits.2006.889440

[8] L.R. Ford , D.R. Fulkerson. Maximum flow through a network[J]. Canadian Journal of Math, 1956, 8(5): 399-404.

[9] Ma Z, Tian N. Pure decrementing service M/G/1 queue with multiple adaptive vacations[J]. Quality technology and quantitative management, 2008, 5(1): 90-100.

DOI: 10.1080/16843703.2008.11673178

[10] Banik Y, Gupta U, Pathak S. On the GI/M/1/N queue with multiple working vacations analysis and computation[J]. Applied Mathematical Modeling, 2007, 31: 1701-1710.

DOI: 10.1016/j.apm.2006.05.010

[11] Tian Naishuo, Xu Xiuli, Ma Zhanyou. Discrete time queuing theory[M]. Beijing: Science press, (2008).

In order to see related information, you need to Login.