Conference PaperPDF Available

An algorithm for distributing users in virtual zones in a 3g cellular network

Authors:

Figures

Content may be subject to copyright.
Home
Advisory Board
Scientific Committees
Organising Committee
Foreword
HET-NETs '06 Papers
HET-NETs '05
HET-NETs '04
Publications
Contacts
P01 Modeling Methodology for Wireless LANs Performance Evaluation
Tahiry Razafindralambo and Fabrice Valois (INRIA - ARES / CITI Laboratory,
France)
P02 Routing Speedup and Node Efficiency in Multicore Ad Hoc Networks
Ami Marowka (Shenkar College of Engineering and Design-Israel)
P03
Traffic Load Distribution in Ad Hoc Networks through Mobile Internet
Gateways
A. Trivino-Cabrera, Eduardo Casilari, D. Bartolome and A. Ariza (University of
Malaga, Spain)
P04
Complementary Analysis and Numerical Results for an Elementary Fluid
Flow Model of TCP
Esa Hyytia, Erling Austreim and Peder Emstad (Norwegian University of Science
and Technology, Norway)
P05
Performability Analysis of Highly Available Clusters with Break-downs and
Deferred Repairs
Enver Ever, Orhan Gemikonakli (Middlesex University, UK) and Ram Chakka
(RGMCET, India)
P06 Performance of An Integrated Scheduling of Priority Weighted Round Robin
and Strict Priority in DiffServ Networks
Yu Zhang (Imperial college London, UK)
P07 FEC Performance in Large File Transfer over Bursty Channels
Shuichiro Senda, Hiroyuki Masuyama, Shoji Kasahara and Yutaka Takahashi
(Kyoto University, Japan)
P08 Utility Based Channel Allocation Algorithm for Real-Time Systems
R. Renjith, Karan Singh and Golden Raymond (DAKE Division C-DAC, India)
P09
Performance Modelling of W-CDMA Networks Supporting Elastic and
Adaptive Traffic
Geogios kallos, Vassilios Vassilakis, Ioannis Moscholis and Michael Logothetis
(University of Patras, Greece)
P10 Performance Analysis of 3G Protocol: Encryption and Authentication
Anita Singhrova (C R state College of Engineering, India) and Rita Mahajan
(Deemed University, India)
P11 Analysis of Delay Variation with Burst Size In Optical Burst Switching In the
Presence of Aggregate Self-Similar Traffic
Chandana Watagodakumbura (Monash University, Australia)
P12 Some contributions to the modelling the dynamics of (TCP,UDP)/RED flows
over reliable and unreliable connections
Tadeusz Czachorski, Krzysztof Grochla (IITiS PAN, Poland) and Ferhan Pekergin
HET-NETs '06 http://www.comp.brad.ac.uk/het-net/listofpapers.html
1 of 5 3/29/2017 7:19 P
M
(LIPN, France)
P13
Analysis of MPLS Multipath Routing with the failure and repair of LSPs
Tien Van Do, Denes Papp (Budapest University of Technology and Economics,
Hungary), Ram Chakka (RGMCET, India) and Xuan Mai Thi Truong (Budapest
University of Technology and Economics, Hungary)
P14 Hosts Address Auto Configuration for Mobile Ad Hoc Networks
Sudath Indrasinghe, Rubem Pereira and Hala Mokhtar (Liverpool John Moores
University, UK)
P15 Analysis of Finite Capacity Queues with Compound Poisson Arrivals and
GE-type Service using Dual Embedded Markov Chains
Wei Li, Rod Fretwell and Demetres Kouvatsos (University of Bradford, UK)
P16 Efficient Network (Internet) Control Protocols and their Convergence
Debessay Fesehaye (Ghent University, Belgium)
P17 Performance of Reliable Internet Protocols (TCP) Using a Fixed Point
Algorithm
Debessay Fesehaye (Ghent University, Belgium)
P19 Adaptive Distributed Load Balancing for Heterogeneous Computing System
using Global Scheduler Policy
Nagarajan Kathiresan (IBM, India)
P20 QoS in Mobile Environments
Dang Ximinga and Liang Aimin (China Academy of Telecommunication Research,
China)
P21 Object Extraction in data mining framework From Video Sequence
Manish Manoria SATI Vidisha, Sanjeev Jain, P.K.Chande and Stuti Dave (IIM
Indore, India)
P22 Guard Channel CAC Algorithm for High Altitude Platform Networks
Dung D Luong, Anh P. M. Tran and and Tien V. Do (Budapest University of
Technology and Economics, Hungary)
P23 Accelerated Simulation of a GPS Scheduler Using Traffic Aggregation
Vindya Amaradasa and John Schormans (Queen Mary, University of London, UK)
P24
The Application of Network Generation Methods in the Study of Multicast
Routing Algorithms
Maciej Piechowiak and Piotr Zwierzykowski (Poznan University of Technology,
Poland)
P25 E-Mail Traffic Conduct and Quantification in Heterogeneous Environments
Rahul Ohri and Edward Chlebus (Illinois Institute of Technology, USA)
P26 Study on Propagation of Self-Similar Nature in Distributed Computing
Zhang Lianming (Hunan Normal University, China), Chen Zhigang Deng Xiaoheng
and Zhao Ming (Central South University, China)
P27 Task Scheduling For Multiprocessor Systems Using Memetic Algorithms
Sanjay Sutar, Jyoti Sawat and Jyot Jadhav (Babasaheb Ambedkar Technological
University, India)
P28 A Routing Architecture for MPLS-TE Networks
Imene Chaieb, Jean-Louis Le Roux (France Telecom R&D) and Bernard Cousin
(IRISA universite de Rennes, France)
P29 Modeling the IEEE 802.11e EDCA for MAC parameter optimization
Boris Bellalta, Cristina Cano, Miquel Oliver (Universitat Pompeu Fabra, Spain) and
HET-NETs '06 http://www.comp.brad.ac.uk/het-net/listofpapers.html
2 of 5 3/29/2017 7:19 P
M
Michela Meo (Politecnico di Torino, Italy)
P30
A Novel Stochastic Min-plus System Theory Approach for Performance
Modeling and Cross-Layer Design of Wireless Fading Channels
Farshid Agharebparast and Victor C. M. Leung (The University of British
Columbia, Canada)
P31 Characteristics of TCP in IPN Environment
Mahendiran Prathaban and Josephine Kohlenberg (Institut National des
Telecommunications, France)
P32 On the Limitation of the Rate Control Protocol (RCP)
Debessay Fesehaye (Ghent University, Belgium)
P33 A Matrix-Geometric Approach to Distributional Forms of Littles Theorem
Koen De Turck and Sabine Wittevrongel (Ghent University, Belgium)
P34 Congestion Control over Multiple Time Scales for Optical Packet Switched
Network
Xianhui Che, David K. Hunter and Ian D. Henning (University of Essex, UK)
P35 Simulation Studies of Switching Node at the Call Level
Piotr Zwierzykowski, Bartomiej Wegner and Maciej Piechowiak (Institute of
Electronics and Telecommunications, Poland)
P36 The Markov chain model of RED active queuing management algorithm
Krzysztof Grochla and Piotr Pecka (The Institute of Theoretical and Applied
Informatics of Polish Academy of Sciences , Poland)
P37 Towards Yet Another Peer-to-Peer Simulator
Stephen Naicken, Anirban Basu, Barnaby Livingston and Sethalat Rodhetbhai
(University of Sussex, UK)
P38
Peer-to-peer Communications to Prevent Broadcast Diffusion from Feedback
Implosion
P. Delannoy, V. Gauthier and M. Becker (Institut National des Telecommunications,
France)
T01
Content Distribution over IP: Developments and Challenges
A. Popescu (Blekinge Inst of Technology, Sweden), D. D. Kouvatsos (University of
Bradford, UK), D. Remondo (University of Catalunia, Spain) and S.
Giordano(Universit of Pisa, Italy)
T02 Entropy Maximisation and Queueing Network Models
Demetres Kouvatsos (University of Bradford, UK)
T03 Unification of product-forms through Markovian Process Algebra
Peter Harrison (Imperial College, UK)
T04 Queueing Networks with Blocking: analysis, solution algorithms and
properties
Simonetta Balsamo (University Ca Foscari of Venice, Italy)
T05 Group Communication in Interconnection Networks and Queueing Network
Models
Is-Haka Mkwawa and Demetres Kouvatsos (University of Bradford, UK)
T06 A Tutorial on The Imbedded Markov Chain Renewal Methodology and
GE-type Queueing Systems
Sotiris Tantos and Demetres Kouvatsos (University of Bradford, UK)
T07 Hand Off Priority Channel Assignment Schemes for 4G Cellular Networks:
Performance Modelling and Analysis
HET-NETs '06 http://www.comp.brad.ac.uk/het-net/listofpapers.html
3 of 5 3/29/2017 7:19 P
M
Yue Li (University of Swansea,UK) and Demetres Kouvatsos (University of
Bradford, UK)
T08 Queueing Networks with Wormhole Routing
Salam Assi Demetres Kouvatsos (University of Bradford, UK) and Mohamed
Ould-Khaoua (University of Glasgow, UK)
T09 A Survey on IP Micro-Mobility Protocols
Mahmud Mansour, Irfan Awan and John Mellor (University of Bradford, UK)
T10
A Direction Towards the Generalisation of QBD Processes and Applications
for Performance Evaluation
Tien Van Do (Budapest University of Technology and Economics, Hungary) and
Ram Chakka (RMCGET, India)
T11 Discrete-time Analysis of a Reservation-based Priority Scheduling Mechanism
Stijn De Vuyst, Sabine Wittevrongel and Herwig Bruneel (Ghent University,
Belgium)
T12 Spectral Expansion Solutions for Markov-Modulated Queues
Isi Mitrani (University of Newcastle, UK)
T13 Quality Feedback for Perceived Service Dependability
Markus Fiedler (Blenkinge Institute of Technology, Sweden)
T14 Traffic Correlation
Rod Fretwell (University of Bradford)
T15 Diffusion Approximation and Queueing Network Models
Tadeusz Czachorski (Polish Academy of Sciences, Poland)
T16
An Efficient WiMAX System Design and Structure Protocol for the IRIS
Project
Weixi Xing, Yue Li (University of Swansea,UK) and Demetres Kouvatsos
(University of Bradford, UK)
T17 The Search for QoS in Data Network: A Statistical Approach
Maria Simon (Universidad de la Republica, Uruguay)
T18 Performance Modelling and Analysis of Interconnection Networks and
Self-Similar Traffic
Geyong Min (University of Bradford, UK)
T19 Characterisation of Internet Traffic in Wireless Networks
Bo Zhou (University of Surrey, UK)
T20 Local Area Networks and Self-Similar Traffic
Hadi Larijani (Glasgow Caledonian University, UK)
T21 Switching Queueing Networks
Vladimir Anisimov (GlaxoSmithKline, UK)
T22 Performance of the Optical MAN Network
Tulin Atmaca and Nguyen Viet Hung (INSTITUT NATIONAL des
TELECOMMUNICATION, France)
T23
VITAL - Enabling Convergence of IP Multimedia Services over Next
Generation Networks Technology: An Overview
Wolfgang Brandstaetter and Boris Grabner (Telekom Austria AG, Austria)
Vangellis Kollias and Effie Makri (Teletel SA, Greece), Alfons Geier (Siemns AG,
Germany) Joachim Wintterle and Arnold Eppler (Alcatel SEL, Germany), George
Kapelios (Voiceglobe sprl, Greece) Spyros Tombros and Michael Karagiogidis
(Keletron, Greece), Lisa Ritsie (Solinet GmbH, Germany) Demetres Kouvatsos and
HET-NETs '06 http://www.comp.brad.ac.uk/het-net/listofpapers.html
4 of 5 3/29/2017 7:19 P
M
Is-Haka Mkwawa (University of Bradford, UK) Ramon Rodelgo and Juan J. Garcia
de Soria (Telefonica I+D, Spain), Georgios Loucos (Tellas SA, Greece) Odysseas
Koufopavlou and Spyros Denarius (University of Patras, Greece)
T24 Product Form Queue Length Distributions in Discrete-time Queueing
Networks: What to do and what not to do
Mike Woodward (University of Bradford, UK)
T25 On the Effect of a Multicast Capable Optical Switch on the Control Packet
Propagation Delay in Access and Metropolitan OBS Networks
Charamabos Mouchos and Demetres Kouvatsos (University of Bradford, UK)
T26 Simple Queues with Batch Renewal Input
Rod Fretwell (University of Bradford)
WP01 Performance Issues in a Secure Health Monitoring Wireless Sensor Network
Demetres Kouvatsos, Geyong Min and Basit Qureshi (University of Bradford, UK)
WP02 A GE/GE/mGE/c/N Queue with mGE Timeout Periods: A Flow Rate Analytic
Approach
Demetres Kouvatsos and Sotiris Tantos (University of Bradford, UK)
WP03 Traffic prediction with adaptive filters
Przemyslaw Glomb (Institute of Theoretical and Applied Informatics, Poland)
WP04 Studying Global DNS Performance for ENUM Protocol
Sandoche Balakrichenan, Thomas Buhnazet, Monique Becker (National Institute
of Telecommunications, France)
WP05 A K-Clique stochastic partitioning method for scaling QoS routing algorithms
in large networks environments
Ahlal Montaser and Mike E. Woodward (University of Bradford, UK)
WP06 A new active congestion control mechanism for the Internet
F. AL-Raddady and Mike Woodward (University of Bradford, UK)
WP07 An algorithm for distributing users in Virtual zones in a 3G Cellular
Wael S. Abughres and Mike E. Woodward (University of Bradford, UK)
WP10
A New Version of Adaptive RED with Reduced Dependency on
Parameterisation
Mahmud Etbega, Mike Woodward, Hussein Abdel-Jaber and Abdulmonam Ali
(University of Bradford, UK)
WP12 Performance evaluation of ECN-based TCP error discriminator over wireless
networks
Mohammed Alnuem, John Mellor and Rod Fretwell (University of Bradford, UK)
WP13
Structured evaluation of site security using an agent based hierarchical
approach to ISO 17799
Andrea J. Cullen, Mohamed S. Saleh, John E. Mellor (University of Bradford, UK)
and Saad H. Bakry (College of Engineering, King Saud University, Saudi Arabia)
HET-NETs '06 http://www.comp.brad.ac.uk/het-net/listofpapers.html
5 of 5 3/29/2017 7:19 P
M
Home
Advisory Board
Scientific Committees
Organising Committee
Foreword
HET-NETs '06 Papers
HET-NETs '05
HET-NETs '04
Publications
Contacts
P01 Modeling Methodology for Wireless LANs Performance Evaluation
Tahiry Razafindralambo and Fabrice Valois (INRIA - ARES / CITI Laboratory,
France)
P02 Routing Speedup and Node Efficiency in Multicore Ad Hoc Networks
Ami Marowka (Shenkar College of Engineering and Design-Israel)
P03
Traffic Load Distribution in Ad Hoc Networks through Mobile Internet
Gateways
A. Trivino-Cabrera, Eduardo Casilari, D. Bartolome and A. Ariza (University of
Malaga, Spain)
P04
Complementary Analysis and Numerical Results for an Elementary Fluid
Flow Model of TCP
Esa Hyytia, Erling Austreim and Peder Emstad (Norwegian University of Science
and Technology, Norway)
P05
Performability Analysis of Highly Available Clusters with Break-downs and
Deferred Repairs
Enver Ever, Orhan Gemikonakli (Middlesex University, UK) and Ram Chakka
(RGMCET, India)
P06 Performance of An Integrated Scheduling of Priority Weighted Round Robin
and Strict Priority in DiffServ Networks
Yu Zhang (Imperial college London, UK)
P07 FEC Performance in Large File Transfer over Bursty Channels
Shuichiro Senda, Hiroyuki Masuyama, Shoji Kasahara and Yutaka Takahashi
(Kyoto University, Japan)
P08 Utility Based Channel Allocation Algorithm for Real-Time Systems
R. Renjith, Karan Singh and Golden Raymond (DAKE Division C-DAC, India)
P09
Performance Modelling of W-CDMA Networks Supporting Elastic and
Adaptive Traffic
Geogios kallos, Vassilios Vassilakis, Ioannis Moscholis and Michael Logothetis
(University of Patras, Greece)
P10 Performance Analysis of 3G Protocol: Encryption and Authentication
Anita Singhrova (C R state College of Engineering, India) and Rita Mahajan
(Deemed University, India)
P11 Analysis of Delay Variation with Burst Size In Optical Burst Switching In the
Presence of Aggregate Self-Similar Traffic
Chandana Watagodakumbura (Monash University, Australia)
P12 Some contributions to the modelling the dynamics of (TCP,UDP)/RED flows
over reliable and unreliable connections
Tadeusz Czachorski, Krzysztof Grochla (IITiS PAN, Poland) and Ferhan Pekergin
HET-NETs '06 http://www.comp.brad.ac.uk/het-net/listofpapers.html
1 of 5 3/29/2017 7:19 P
M
(LIPN, France)
P13
Analysis of MPLS Multipath Routing with the failure and repair of LSPs
Tien Van Do, Denes Papp (Budapest University of Technology and Economics,
Hungary), Ram Chakka (RGMCET, India) and Xuan Mai Thi Truong (Budapest
University of Technology and Economics, Hungary)
P14 Hosts Address Auto Configuration for Mobile Ad Hoc Networks
Sudath Indrasinghe, Rubem Pereira and Hala Mokhtar (Liverpool John Moores
University, UK)
P15 Analysis of Finite Capacity Queues with Compound Poisson Arrivals and
GE-type Service using Dual Embedded Markov Chains
Wei Li, Rod Fretwell and Demetres Kouvatsos (University of Bradford, UK)
P16 Efficient Network (Internet) Control Protocols and their Convergence
Debessay Fesehaye (Ghent University, Belgium)
P17 Performance of Reliable Internet Protocols (TCP) Using a Fixed Point
Algorithm
Debessay Fesehaye (Ghent University, Belgium)
P19 Adaptive Distributed Load Balancing for Heterogeneous Computing System
using Global Scheduler Policy
Nagarajan Kathiresan (IBM, India)
P20 QoS in Mobile Environments
Dang Ximinga and Liang Aimin (China Academy of Telecommunication Research,
China)
P21 Object Extraction in data mining framework From Video Sequence
Manish Manoria SATI Vidisha, Sanjeev Jain, P.K.Chande and Stuti Dave (IIM
Indore, India)
P22 Guard Channel CAC Algorithm for High Altitude Platform Networks
Dung D Luong, Anh P. M. Tran and and Tien V. Do (Budapest University of
Technology and Economics, Hungary)
P23 Accelerated Simulation of a GPS Scheduler Using Traffic Aggregation
Vindya Amaradasa and John Schormans (Queen Mary, University of London, UK)
P24
The Application of Network Generation Methods in the Study of Multicast
Routing Algorithms
Maciej Piechowiak and Piotr Zwierzykowski (Poznan University of Technology,
Poland)
P25 E-Mail Traffic Conduct and Quantification in Heterogeneous Environments
Rahul Ohri and Edward Chlebus (Illinois Institute of Technology, USA)
P26 Study on Propagation of Self-Similar Nature in Distributed Computing
Zhang Lianming (Hunan Normal University, China), Chen Zhigang Deng Xiaoheng
and Zhao Ming (Central South University, China)
P27 Task Scheduling For Multiprocessor Systems Using Memetic Algorithms
Sanjay Sutar, Jyoti Sawat and Jyot Jadhav (Babasaheb Ambedkar Technological
University, India)
P28 A Routing Architecture for MPLS-TE Networks
Imene Chaieb, Jean-Louis Le Roux (France Telecom R&D) and Bernard Cousin
(IRISA universite de Rennes, France)
P29 Modeling the IEEE 802.11e EDCA for MAC parameter optimization
Boris Bellalta, Cristina Cano, Miquel Oliver (Universitat Pompeu Fabra, Spain) and
HET-NETs '06 http://www.comp.brad.ac.uk/het-net/listofpapers.html
2 of 5 3/29/2017 7:19 P
M
Michela Meo (Politecnico di Torino, Italy)
P30
A Novel Stochastic Min-plus System Theory Approach for Performance
Modeling and Cross-Layer Design of Wireless Fading Channels
Farshid Agharebparast and Victor C. M. Leung (The University of British
Columbia, Canada)
P31 Characteristics of TCP in IPN Environment
Mahendiran Prathaban and Josephine Kohlenberg (Institut National des
Telecommunications, France)
P32 On the Limitation of the Rate Control Protocol (RCP)
Debessay Fesehaye (Ghent University, Belgium)
P33 A Matrix-Geometric Approach to Distributional Forms of Littles Theorem
Koen De Turck and Sabine Wittevrongel (Ghent University, Belgium)
P34 Congestion Control over Multiple Time Scales for Optical Packet Switched
Network
Xianhui Che, David K. Hunter and Ian D. Henning (University of Essex, UK)
P35 Simulation Studies of Switching Node at the Call Level
Piotr Zwierzykowski, Bartomiej Wegner and Maciej Piechowiak (Institute of
Electronics and Telecommunications, Poland)
P36 The Markov chain model of RED active queuing management algorithm
Krzysztof Grochla and Piotr Pecka (The Institute of Theoretical and Applied
Informatics of Polish Academy of Sciences , Poland)
P37 Towards Yet Another Peer-to-Peer Simulator
Stephen Naicken, Anirban Basu, Barnaby Livingston and Sethalat Rodhetbhai
(University of Sussex, UK)
P38
Peer-to-peer Communications to Prevent Broadcast Diffusion from Feedback
Implosion
P. Delannoy, V. Gauthier and M. Becker (Institut National des Telecommunications,
France)
T01
Content Distribution over IP: Developments and Challenges
A. Popescu (Blekinge Inst of Technology, Sweden), D. D. Kouvatsos (University of
Bradford, UK), D. Remondo (University of Catalunia, Spain) and S.
Giordano(Universit of Pisa, Italy)
T02 Entropy Maximisation and Queueing Network Models
Demetres Kouvatsos (University of Bradford, UK)
T03 Unification of product-forms through Markovian Process Algebra
Peter Harrison (Imperial College, UK)
T04 Queueing Networks with Blocking: analysis, solution algorithms and
properties
Simonetta Balsamo (University Ca Foscari of Venice, Italy)
T05 Group Communication in Interconnection Networks and Queueing Network
Models
Is-Haka Mkwawa and Demetres Kouvatsos (University of Bradford, UK)
T06 A Tutorial on The Imbedded Markov Chain Renewal Methodology and
GE-type Queueing Systems
Sotiris Tantos and Demetres Kouvatsos (University of Bradford, UK)
T07 Hand Off Priority Channel Assignment Schemes for 4G Cellular Networks:
Performance Modelling and Analysis
HET-NETs '06 http://www.comp.brad.ac.uk/het-net/listofpapers.html
3 of 5 3/29/2017 7:19 P
M
Yue Li (University of Swansea,UK) and Demetres Kouvatsos (University of
Bradford, UK)
T08 Queueing Networks with Wormhole Routing
Salam Assi Demetres Kouvatsos (University of Bradford, UK) and Mohamed
Ould-Khaoua (University of Glasgow, UK)
T09 A Survey on IP Micro-Mobility Protocols
Mahmud Mansour, Irfan Awan and John Mellor (University of Bradford, UK)
T10
A Direction Towards the Generalisation of QBD Processes and Applications
for Performance Evaluation
Tien Van Do (Budapest University of Technology and Economics, Hungary) and
Ram Chakka (RMCGET, India)
T11 Discrete-time Analysis of a Reservation-based Priority Scheduling Mechanism
Stijn De Vuyst, Sabine Wittevrongel and Herwig Bruneel (Ghent University,
Belgium)
T12 Spectral Expansion Solutions for Markov-Modulated Queues
Isi Mitrani (University of Newcastle, UK)
T13 Quality Feedback for Perceived Service Dependability
Markus Fiedler (Blenkinge Institute of Technology, Sweden)
T14 Traffic Correlation
Rod Fretwell (University of Bradford)
T15 Diffusion Approximation and Queueing Network Models
Tadeusz Czachorski (Polish Academy of Sciences, Poland)
T16
An Efficient WiMAX System Design and Structure Protocol for the IRIS
Project
Weixi Xing, Yue Li (University of Swansea,UK) and Demetres Kouvatsos
(University of Bradford, UK)
T17 The Search for QoS in Data Network: A Statistical Approach
Maria Simon (Universidad de la Republica, Uruguay)
T18 Performance Modelling and Analysis of Interconnection Networks and
Self-Similar Traffic
Geyong Min (University of Bradford, UK)
T19 Characterisation of Internet Traffic in Wireless Networks
Bo Zhou (University of Surrey, UK)
T20 Local Area Networks and Self-Similar Traffic
Hadi Larijani (Glasgow Caledonian University, UK)
T21 Switching Queueing Networks
Vladimir Anisimov (GlaxoSmithKline, UK)
T22 Performance of the Optical MAN Network
Tulin Atmaca and Nguyen Viet Hung (INSTITUT NATIONAL des
TELECOMMUNICATION, France)
T23
VITAL - Enabling Convergence of IP Multimedia Services over Next
Generation Networks Technology: An Overview
Wolfgang Brandstaetter and Boris Grabner (Telekom Austria AG, Austria)
Vangellis Kollias and Effie Makri (Teletel SA, Greece), Alfons Geier (Siemns AG,
Germany) Joachim Wintterle and Arnold Eppler (Alcatel SEL, Germany), George
Kapelios (Voiceglobe sprl, Greece) Spyros Tombros and Michael Karagiogidis
(Keletron, Greece), Lisa Ritsie (Solinet GmbH, Germany) Demetres Kouvatsos and
HET-NETs '06 http://www.comp.brad.ac.uk/het-net/listofpapers.html
4 of 5 3/29/2017 7:19 P
M
Is-Haka Mkwawa (University of Bradford, UK) Ramon Rodelgo and Juan J. Garcia
de Soria (Telefonica I+D, Spain), Georgios Loucos (Tellas SA, Greece) Odysseas
Koufopavlou and Spyros Denarius (University of Patras, Greece)
T24 Product Form Queue Length Distributions in Discrete-time Queueing
Networks: What to do and what not to do
Mike Woodward (University of Bradford, UK)
T25 On the Effect of a Multicast Capable Optical Switch on the Control Packet
Propagation Delay in Access and Metropolitan OBS Networks
Charamabos Mouchos and Demetres Kouvatsos (University of Bradford, UK)
T26 Simple Queues with Batch Renewal Input
Rod Fretwell (University of Bradford)
WP01 Performance Issues in a Secure Health Monitoring Wireless Sensor Network
Demetres Kouvatsos, Geyong Min and Basit Qureshi (University of Bradford, UK)
WP02 A GE/GE/mGE/c/N Queue with mGE Timeout Periods: A Flow Rate Analytic
Approach
Demetres Kouvatsos and Sotiris Tantos (University of Bradford, UK)
WP03 Traffic prediction with adaptive filters
Przemyslaw Glomb (Institute of Theoretical and Applied Informatics, Poland)
WP04 Studying Global DNS Performance for ENUM Protocol
Sandoche Balakrichenan, Thomas Buhnazet, Monique Becker (National Institute
of Telecommunications, France)
WP05 A K-Clique stochastic partitioning method for scaling QoS routing algorithms
in large networks environments
Ahlal Montaser and Mike E. Woodward (University of Bradford, UK)
WP06 A new active congestion control mechanism for the Internet
F. AL-Raddady and Mike Woodward (University of Bradford, UK)
WP07 An algorithm for distributing users in Virtual zones in a 3G Cellular
Wael S. Abughres and Mike E. Woodward (University of Bradford, UK)
WP10
A New Version of Adaptive RED with Reduced Dependency on
Parameterisation
Mahmud Etbega, Mike Woodward, Hussein Abdel-Jaber and Abdulmonam Ali
(University of Bradford, UK)
WP12 Performance evaluation of ECN-based TCP error discriminator over wireless
networks
Mohammed Alnuem, John Mellor and Rod Fretwell (University of Bradford, UK)
WP13
Structured evaluation of site security using an agent based hierarchical
approach to ISO 17799
Andrea J. Cullen, Mohamed S. Saleh, John E. Mellor (University of Bradford, UK)
and Saad H. Bakry (College of Engineering, King Saud University, Saudi Arabia)
HET-NETs '06 http://www.comp.brad.ac.uk/het-net/listofpapers.html
5 of 5 3/29/2017 7:19 P
M
Home
Advisory Board
Scientific Committees
Organising Committee
Foreword
HET-NETs '06 Papers
HET-NETs '05
HET-NETs '04
Publications
Contacts
P01 Modeling Methodology for Wireless LANs Performance Evaluation
Tahiry Razafindralambo and Fabrice Valois (INRIA - ARES / CITI Laboratory,
France)
P02 Routing Speedup and Node Efficiency in Multicore Ad Hoc Networks
Ami Marowka (Shenkar College of Engineering and Design-Israel)
P03
Traffic Load Distribution in Ad Hoc Networks through Mobile Internet
Gateways
A. Trivino-Cabrera, Eduardo Casilari, D. Bartolome and A. Ariza (University of
Malaga, Spain)
P04
Complementary Analysis and Numerical Results for an Elementary Fluid
Flow Model of TCP
Esa Hyytia, Erling Austreim and Peder Emstad (Norwegian University of Science
and Technology, Norway)
P05
Performability Analysis of Highly Available Clusters with Break-downs and
Deferred Repairs
Enver Ever, Orhan Gemikonakli (Middlesex University, UK) and Ram Chakka
(RGMCET, India)
P06 Performance of An Integrated Scheduling of Priority Weighted Round Robin
and Strict Priority in DiffServ Networks
Yu Zhang (Imperial college London, UK)
P07 FEC Performance in Large File Transfer over Bursty Channels
Shuichiro Senda, Hiroyuki Masuyama, Shoji Kasahara and Yutaka Takahashi
(Kyoto University, Japan)
P08 Utility Based Channel Allocation Algorithm for Real-Time Systems
R. Renjith, Karan Singh and Golden Raymond (DAKE Division C-DAC, India)
P09
Performance Modelling of W-CDMA Networks Supporting Elastic and
Adaptive Traffic
Geogios kallos, Vassilios Vassilakis, Ioannis Moscholis and Michael Logothetis
(University of Patras, Greece)
P10 Performance Analysis of 3G Protocol: Encryption and Authentication
Anita Singhrova (C R state College of Engineering, India) and Rita Mahajan
(Deemed University, India)
P11 Analysis of Delay Variation with Burst Size In Optical Burst Switching In the
Presence of Aggregate Self-Similar Traffic
Chandana Watagodakumbura (Monash University, Australia)
P12 Some contributions to the modelling the dynamics of (TCP,UDP)/RED flows
over reliable and unreliable connections
Tadeusz Czachorski, Krzysztof Grochla (IITiS PAN, Poland) and Ferhan Pekergin
HET-NETs '06 http://www.comp.brad.ac.uk/het-net/listofpapers.html
1 of 5 3/29/2017 7:19 P
M
(LIPN, France)
P13
Analysis of MPLS Multipath Routing with the failure and repair of LSPs
Tien Van Do, Denes Papp (Budapest University of Technology and Economics,
Hungary), Ram Chakka (RGMCET, India) and Xuan Mai Thi Truong (Budapest
University of Technology and Economics, Hungary)
P14 Hosts Address Auto Configuration for Mobile Ad Hoc Networks
Sudath Indrasinghe, Rubem Pereira and Hala Mokhtar (Liverpool John Moores
University, UK)
P15 Analysis of Finite Capacity Queues with Compound Poisson Arrivals and
GE-type Service using Dual Embedded Markov Chains
Wei Li, Rod Fretwell and Demetres Kouvatsos (University of Bradford, UK)
P16 Efficient Network (Internet) Control Protocols and their Convergence
Debessay Fesehaye (Ghent University, Belgium)
P17 Performance of Reliable Internet Protocols (TCP) Using a Fixed Point
Algorithm
Debessay Fesehaye (Ghent University, Belgium)
P19 Adaptive Distributed Load Balancing for Heterogeneous Computing System
using Global Scheduler Policy
Nagarajan Kathiresan (IBM, India)
P20 QoS in Mobile Environments
Dang Ximinga and Liang Aimin (China Academy of Telecommunication Research,
China)
P21 Object Extraction in data mining framework From Video Sequence
Manish Manoria SATI Vidisha, Sanjeev Jain, P.K.Chande and Stuti Dave (IIM
Indore, India)
P22 Guard Channel CAC Algorithm for High Altitude Platform Networks
Dung D Luong, Anh P. M. Tran and and Tien V. Do (Budapest University of
Technology and Economics, Hungary)
P23 Accelerated Simulation of a GPS Scheduler Using Traffic Aggregation
Vindya Amaradasa and John Schormans (Queen Mary, University of London, UK)
P24
The Application of Network Generation Methods in the Study of Multicast
Routing Algorithms
Maciej Piechowiak and Piotr Zwierzykowski (Poznan University of Technology,
Poland)
P25 E-Mail Traffic Conduct and Quantification in Heterogeneous Environments
Rahul Ohri and Edward Chlebus (Illinois Institute of Technology, USA)
P26 Study on Propagation of Self-Similar Nature in Distributed Computing
Zhang Lianming (Hunan Normal University, China), Chen Zhigang Deng Xiaoheng
and Zhao Ming (Central South University, China)
P27 Task Scheduling For Multiprocessor Systems Using Memetic Algorithms
Sanjay Sutar, Jyoti Sawat and Jyot Jadhav (Babasaheb Ambedkar Technological
University, India)
P28 A Routing Architecture for MPLS-TE Networks
Imene Chaieb, Jean-Louis Le Roux (France Telecom R&D) and Bernard Cousin
(IRISA universite de Rennes, France)
P29 Modeling the IEEE 802.11e EDCA for MAC parameter optimization
Boris Bellalta, Cristina Cano, Miquel Oliver (Universitat Pompeu Fabra, Spain) and
HET-NETs '06 http://www.comp.brad.ac.uk/het-net/listofpapers.html
2 of 5 3/29/2017 7:19 P
M
Michela Meo (Politecnico di Torino, Italy)
P30
A Novel Stochastic Min-plus System Theory Approach for Performance
Modeling and Cross-Layer Design of Wireless Fading Channels
Farshid Agharebparast and Victor C. M. Leung (The University of British
Columbia, Canada)
P31 Characteristics of TCP in IPN Environment
Mahendiran Prathaban and Josephine Kohlenberg (Institut National des
Telecommunications, France)
P32 On the Limitation of the Rate Control Protocol (RCP)
Debessay Fesehaye (Ghent University, Belgium)
P33 A Matrix-Geometric Approach to Distributional Forms of Littles Theorem
Koen De Turck and Sabine Wittevrongel (Ghent University, Belgium)
P34 Congestion Control over Multiple Time Scales for Optical Packet Switched
Network
Xianhui Che, David K. Hunter and Ian D. Henning (University of Essex, UK)
P35 Simulation Studies of Switching Node at the Call Level
Piotr Zwierzykowski, Bartomiej Wegner and Maciej Piechowiak (Institute of
Electronics and Telecommunications, Poland)
P36 The Markov chain model of RED active queuing management algorithm
Krzysztof Grochla and Piotr Pecka (The Institute of Theoretical and Applied
Informatics of Polish Academy of Sciences , Poland)
P37 Towards Yet Another Peer-to-Peer Simulator
Stephen Naicken, Anirban Basu, Barnaby Livingston and Sethalat Rodhetbhai
(University of Sussex, UK)
P38
Peer-to-peer Communications to Prevent Broadcast Diffusion from Feedback
Implosion
P. Delannoy, V. Gauthier and M. Becker (Institut National des Telecommunications,
France)
T01
Content Distribution over IP: Developments and Challenges
A. Popescu (Blekinge Inst of Technology, Sweden), D. D. Kouvatsos (University of
Bradford, UK), D. Remondo (University of Catalunia, Spain) and S.
Giordano(Universit of Pisa, Italy)
T02 Entropy Maximisation and Queueing Network Models
Demetres Kouvatsos (University of Bradford, UK)
T03 Unification of product-forms through Markovian Process Algebra
Peter Harrison (Imperial College, UK)
T04 Queueing Networks with Blocking: analysis, solution algorithms and
properties
Simonetta Balsamo (University Ca Foscari of Venice, Italy)
T05 Group Communication in Interconnection Networks and Queueing Network
Models
Is-Haka Mkwawa and Demetres Kouvatsos (University of Bradford, UK)
T06 A Tutorial on The Imbedded Markov Chain Renewal Methodology and
GE-type Queueing Systems
Sotiris Tantos and Demetres Kouvatsos (University of Bradford, UK)
T07 Hand Off Priority Channel Assignment Schemes for 4G Cellular Networks:
Performance Modelling and Analysis
HET-NETs '06 http://www.comp.brad.ac.uk/het-net/listofpapers.html
3 of 5 3/29/2017 7:19 P
M
Yue Li (University of Swansea,UK) and Demetres Kouvatsos (University of
Bradford, UK)
T08 Queueing Networks with Wormhole Routing
Salam Assi Demetres Kouvatsos (University of Bradford, UK) and Mohamed
Ould-Khaoua (University of Glasgow, UK)
T09 A Survey on IP Micro-Mobility Protocols
Mahmud Mansour, Irfan Awan and John Mellor (University of Bradford, UK)
T10
A Direction Towards the Generalisation of QBD Processes and Applications
for Performance Evaluation
Tien Van Do (Budapest University of Technology and Economics, Hungary) and
Ram Chakka (RMCGET, India)
T11 Discrete-time Analysis of a Reservation-based Priority Scheduling Mechanism
Stijn De Vuyst, Sabine Wittevrongel and Herwig Bruneel (Ghent University,
Belgium)
T12 Spectral Expansion Solutions for Markov-Modulated Queues
Isi Mitrani (University of Newcastle, UK)
T13 Quality Feedback for Perceived Service Dependability
Markus Fiedler (Blenkinge Institute of Technology, Sweden)
T14 Traffic Correlation
Rod Fretwell (University of Bradford)
T15 Diffusion Approximation and Queueing Network Models
Tadeusz Czachorski (Polish Academy of Sciences, Poland)
T16
An Efficient WiMAX System Design and Structure Protocol for the IRIS
Project
Weixi Xing, Yue Li (University of Swansea,UK) and Demetres Kouvatsos
(University of Bradford, UK)
T17 The Search for QoS in Data Network: A Statistical Approach
Maria Simon (Universidad de la Republica, Uruguay)
T18 Performance Modelling and Analysis of Interconnection Networks and
Self-Similar Traffic
Geyong Min (University of Bradford, UK)
T19 Characterisation of Internet Traffic in Wireless Networks
Bo Zhou (University of Surrey, UK)
T20 Local Area Networks and Self-Similar Traffic
Hadi Larijani (Glasgow Caledonian University, UK)
T21 Switching Queueing Networks
Vladimir Anisimov (GlaxoSmithKline, UK)
T22 Performance of the Optical MAN Network
Tulin Atmaca and Nguyen Viet Hung (INSTITUT NATIONAL des
TELECOMMUNICATION, France)
T23
VITAL - Enabling Convergence of IP Multimedia Services over Next
Generation Networks Technology: An Overview
Wolfgang Brandstaetter and Boris Grabner (Telekom Austria AG, Austria)
Vangellis Kollias and Effie Makri (Teletel SA, Greece), Alfons Geier (Siemns AG,
Germany) Joachim Wintterle and Arnold Eppler (Alcatel SEL, Germany), George
Kapelios (Voiceglobe sprl, Greece) Spyros Tombros and Michael Karagiogidis
(Keletron, Greece), Lisa Ritsie (Solinet GmbH, Germany) Demetres Kouvatsos and
HET-NETs '06 http://www.comp.brad.ac.uk/het-net/listofpapers.html
4 of 5 3/29/2017 7:19 P
M
Is-Haka Mkwawa (University of Bradford, UK) Ramon Rodelgo and Juan J. Garcia
de Soria (Telefonica I+D, Spain), Georgios Loucos (Tellas SA, Greece) Odysseas
Koufopavlou and Spyros Denarius (University of Patras, Greece)
T24 Product Form Queue Length Distributions in Discrete-time Queueing
Networks: What to do and what not to do
Mike Woodward (University of Bradford, UK)
T25 On the Effect of a Multicast Capable Optical Switch on the Control Packet
Propagation Delay in Access and Metropolitan OBS Networks
Charamabos Mouchos and Demetres Kouvatsos (University of Bradford, UK)
T26 Simple Queues with Batch Renewal Input
Rod Fretwell (University of Bradford)
WP01 Performance Issues in a Secure Health Monitoring Wireless Sensor Network
Demetres Kouvatsos, Geyong Min and Basit Qureshi (University of Bradford, UK)
WP02 A GE/GE/mGE/c/N Queue with mGE Timeout Periods: A Flow Rate Analytic
Approach
Demetres Kouvatsos and Sotiris Tantos (University of Bradford, UK)
WP03 Traffic prediction with adaptive filters
Przemyslaw Glomb (Institute of Theoretical and Applied Informatics, Poland)
WP04 Studying Global DNS Performance for ENUM Protocol
Sandoche Balakrichenan, Thomas Buhnazet, Monique Becker (National Institute
of Telecommunications, France)
WP05 A K-Clique stochastic partitioning method for scaling QoS routing algorithms
in large networks environments
Ahlal Montaser and Mike E. Woodward (University of Bradford, UK)
WP06 A new active congestion control mechanism for the Internet
F. AL-Raddady and Mike Woodward (University of Bradford, UK)
WP07 An algorithm for distributing users in Virtual zones in a 3G Cellular
Wael S. Abughres and Mike E. Woodward (University of Bradford, UK)
WP10
A New Version of Adaptive RED with Reduced Dependency on
Parameterisation
Mahmud Etbega, Mike Woodward, Hussein Abdel-Jaber and Abdulmonam Ali
(University of Bradford, UK)
WP12 Performance evaluation of ECN-based TCP error discriminator over wireless
networks
Mohammed Alnuem, John Mellor and Rod Fretwell (University of Bradford, UK)
WP13
Structured evaluation of site security using an agent based hierarchical
approach to ISO 17799
Andrea J. Cullen, Mohamed S. Saleh, John E. Mellor (University of Bradford, UK)
and Saad H. Bakry (College of Engineering, King Saud University, Saudi Arabia)
HET-NETs '06 http://www.comp.brad.ac.uk/het-net/listofpapers.html
5 of 5 3/29/2017 7:19 P
M
An algorithm for distributing users in Virtual zones in a 3G Cellular
network
Mobile Computing and Networks(MoCoNet) Group
School of Informatics, University of Bradford, Bradford, BD7 1DP,UK
(W.Salehabughres & M. E Woodward)@bradford.ac.uk
W. S. Abughres & M. E. Woodward
Abstract
In this paper, we present an algorithm to generate and distribute Z users in Z virtual zones. In
3G networks we have dynamic capacity that depends on the interference levels in the covered area
and the number of active users. This implies that the distance of the mobile user from the base
station is also an important factor because of the signal fading. An algorithm is presented based
on the queuing traffic models for 3G cell written in c++ programming language that distributes
users in different zones assuming that the cell area is virtually divided into Z zones depending on
the number of users.
Keywords: Queuing Model,Algorithm for generating users and distributing them in Z zones
1 Introduction
There has been explosive growth in the use of wireless communications over the last few years, from satellite
transmission to home wireless personal area networks [1, 2]. The primary advantage of a wireless network is
the ability of the wireless node to communicate with the rest of the world while being mobile. The existing
mobile technology Global System for Mobile communication(GSM) systems serve a relatively small number of
subscribers because of the limited radio frequency spectrum available. Therefore, the best resource management
technique should be found in order to increase the capacity of the system especially in the new generation of
mobile networks Universal Mobile Telecommunication Systems(UMTS), or (3G) Systems where a large number
of subscribers. Therefore, resource management (RM) is one of the most important aspects of third generation
systems of mobile networks [3,4, 5, 6]. in Code Division Multiple Access(CDMA) systems like (UMTS), there
is no absolute number of channels that can be allocated to a potential user. Therefore, the limits on the system
capacity are determined by the interference that is generated by the users at the base station, which is Node
B [1, 7]. This is why the capacity of the third generation of mobile networks is called Soft Capacity in contrast
to the Hard Capacity of the second generation of mobile networks which adopt frequency division multiple
access(FDMA) and time division multiple access(TDMA) where a fixed number of channels are assigned to
the user.
2 The Queuing Model
The proposed queuing model in figure0 used to developed the algorithm discussed in the previous section, &
the reason that we developed this algorithm is the difficulty of distributing users in different zones when the
number of users increases, so when the state space increases it proves impossible to generate all the valid states
without computer assistance.
The main modeling difficulty is that the distance of the UE from the base station needs to be included as
part of the state information of each connection. As the distance is a continuous quantity the resulting model
possesses a continuous state space this is analytically intractable and so we adopt an approximation [7, 8, 9]
in which the area of the cell is divided into Z concentric zones. We then make the assumption that the outer
border of zone i, at distance difrom the centre, represents the distance of all connections in zone i. Now let ni
denote the number of connections in zone i, as shown in equation(1a,1b).
T hen X
i=1
ni=n(1a)
n= (n1, n2, n3,· · · , nZ) (1b)
WP07/1
Figure 1: Queueing model of one UMTS cell with Z virtual zones
Figure 2: Distribution of users within a cell
given that the overall arrival rate over the cell area is λ, we can Probabilistically split the traffic over the cell
area by the vector
α= (α1, α2, α3, . . . , αz) (2a)
T hen
z
X
i=1
αi= 1 (2b)
Then the arrival rate to zone i is
λi=αi·λ(3)
with theses assumptions , the UMTS cell can be described by the multiple queueing system as shown in
figure 0 . These queues are not independent since the total number of connections in all zones cannot exceed
nmax, where nmax is bounded by the maximum number of codes or the maximum number of users based on
the interference as expressed in eq 4 below. That is in any permitted system state,
z
X
i=1
ni=nmax (4)
where niis the number of active connections in zone i. Assuming that the call arrival process is a Poisson
process with rate λ, and an exponentially distributed burst size with in each active connection with mean burst
time 1. Therefore, the model will result in a homogeneous Continuous Time Markov Chain(CTMC).
WP07/2
3 Algorithm for generating users and distributing them in Z zones
A C++ program has been implemented and tested for distributing any number of usersinto Z virtual
Zones [10, 11] The algorithm is as follows:
1. Enter the number of users
2. Create the number of zones which depends on the number of users
3. Check for the maximum sum of users in each zone.
4. Set i=1 to Z.
5. Starts from Zone i, where the maximum is the total number of users(Z-i+1) and all the zones on the
right are zero, and find the sum(1 Z).
6. Put the combinations of all the sum’s in the zones.
7. If i >Z then Stop, else go to 4.
The C code is given in Appendix A
4 RESULTS
In Table 1 we present the case for two users, where the distribution of the two users in the two
zones are based on equation 4, and in this case there are four permissible states.
Table 1: Two Virtual Zones
n12 0 1 0
n20 1 0 0
In Table 2 we distributed three users based on equation 4, and in this case there are eight
permissible states.
Table 2: Three Virtual Zones
n130210010
n202010100
n300001000
In Table 3 we distributed four users based on equation 4, and in this case there are sixteen
permissible states. Table 3: Four Virtual Zones
n10000000011112234
n20000112300120100
n30012010001000000
n40100000000000000
In Table 4 we distributed five users based on equation 4, and in this case there are thirty two
permissible states. Table 4: Five Virtual Zones
n1n2n3n4n5n1n2n3n4n5
0 0 0 0 1 0 0 0 1 0
0 0 0 2 0 0 0 1 0 0
0 0 1 1 0 0 0 2 0 0
0 0 3 0 0 0 1 0 0 0
0 1 0 1 0 0 1 1 0 0
0 1 2 0 0 0 2 0 0 0
0 2 1 0 0 0 3 0 0 0
0 4 0 0 0 1 0 0 0 0
1 0 0 1 0 1 0 1 0 0
1 0 2 0 0 1 1 0 0 0
1 1 1 0 0 1 2 0 0 0
1 3 0 0 0 2 0 0 0 0
2 0 1 0 0 2 1 0 0 0
2 2 0 0 0 3 0 0 0 0
3 1 0 0 0 4 0 0 0 0
5 0 0 0 0 0 0 0 0 0
WP07/3
In Table 5 six users are distributed in six virtual zones and the total number of permissible states
are sixty four. Table 5: Six Virtual Zones
n1n2n3n4n5n6n1n2n3n4n5n6
0 0 0 0 0 0 0 0 0 0 0 1
0 0 0 0 1 0 0 0 0 0 2 0
0 0 0 1 0 0 0 0 0 1 1 0
0 0 0 2 0 0 0 0 0 3 0 0
0 0 1 0 0 0 0 0 1 0 1 0
0 0 1 1 0 0 0 0 1 2 0 0
0 0 2 0 0 0 0 0 2 1 0 0
0 0 3 0 0 0 0 0 4 0 0 0
0 1 0 0 0 0 0 1 0 0 1 0
0 1 0 1 0 0 0 1 0 2 0 0
0 1 1 0 0 0 0 1 1 1 0 0
0 1 2 0 0 0 0 1 3 0 0 0
0 2 0 0 0 0 0 2 0 1 0 0
0 2 1 0 0 0 0 2 2 0 0 0
0 3 0 0 0 0 0 3 1 0 0 0
0 4 0 0 0 0 0 5 0 0 0 0
1 0 0 0 0 0 1 0 0 0 1 0
1 0 0 1 0 0 1 0 0 2 0 0
1 0 1 0 0 0 1 0 1 1 0 0
1 0 2 0 0 0 1 0 3 0 0 0
1 1 0 0 0 0 1 1 0 1 0 0
1 1 1 0 0 0 1 1 2 0 0 0
1 2 0 0 0 0 1 2 1 0 0 0
1 3 0 0 0 0 1 4 0 0 0 0
2 0 0 0 0 0 2 0 0 1 0 0
2 0 1 0 0 0 2 0 2 0 0 0
2 1 0 0 0 0 2 1 1 0 0 0
2 2 0 0 0 0 2 3 0 0 0 0
3 0 0 0 0 0 3 0 1 0 0 0
3 1 0 0 0 0 3 2 0 0 0 0
4 0 0 0 0 0 4 1 0 0 0 0
5 0 0 0 0 0 6 0 0 0 0 0
From these results we can see that the complexity increases as the number of users increases so the developed
algorithm can generate any number of users.
5 Conclusion
The paper presented a new algorithm, that distributes users in Z zones, and we can get the permissible states for
any number of users, and as we saw that the complexity of calculating the permissible states by hand increase
as we increase the number of zones or users. The results that we got are very useful to analyze and model the
3G Traffic model.
References
[1] H. Deng, W. Li, , and D. Agrawal, “Routing security in wireless ad hoc networks,” pp. 70–75, 2002.
[2] M. Schwartz, Mobile Wireless Communications. Cambridge University Press, 2005.
[3] J. S. Lee and L.E.M., “Solutions for minimum required forward link channel powers in cdma cellular and
pcs systems. journal of communications and networks,” 1999.
[4] H. Kaaranen, A. Ahtiainen, L. Laitinen, S. Naghian, and V. Niemi, Umts Networks Architecture, Mobility
and Services. John Wiley and Sons Ltd, 2005.
[5] G. G´omez and R. S´anchez, End-to-End Quality of Service over Cellular Networks Data Services Perfor-
mance and Optimization in 2G/3G. John Wiley and Sons Ltd, 2005.
[6] M. Karim and M. Sarraf, W-CDMA and cdma2000 for 3G Mobile Networks. McGraw-Hill, 2002.
[7] M. E. Woodward, Lecture Notes in Mobile Networks Performance Modelling, Coputing Department. Brad-
ford University.
[8] K. Al-Begain, J.B., G. Bolch, and A. I. Zreikat, “The performance and reliability modelling language and
its application international journal in simulation:systems science and technology,” pp. 66–80, 2002.
WP07/4
[9] G. Bolch, S. Greiner, H. de Meer, and K. S. Trivedi., Queueing Networks and Markov Chains Modeling
and Performance Evaluation with Computer Science Applications. A JOHN WILEY & SONS, INC., 2006.
[10] W. S. Abughres and M. E. Woodward, “Product form queuing model for a 3g cellular mobile network,”
Fourth Libyan Arab International Conference On Electrical & Electronic Engineering, Tripoli,Libya, 2006.
[11] W. S. Abughres and M. E. Woodward, “Product form queuing model for a 3g cellular mobile network,”
pp. 9–12, Seventh Informatics Workshop for Research students, 2006.
Appendix A
list<int*> expand (int* seq, int pos) {
// parameter ’seq’ is the initial sequence,
//’pos’+1 is the number of remaining positions to be filled by the function
// the function returns with the list of valid sequences, where the numbers in
//positions pos+1...Z-1 are given by ’seq’. The valid sequences
// differ only in positions 0...pos
list<int*> result; // the result of the function is stored in this list
// end of sequence, add seq to the list of sequences
if (pos<0) {// no more positions are left to fill,
// the ’seq’ parameter is a complete sequence
result.push_back (seq); // since ’seq’ is a complete sequence, we append
//it to the list of ready sequences
return result; }
// compute the sum of the elements in positions pos+1...Z-1 (the task of the
//function is to fill the remaining positions, so we have to find
//out how many ’numbers’ are left to distribute)
int sum = 0;
for (int i=Z-1; i>pos; i--)
sum += seq[6];
// compute the maximal element to put into position pos
int maxnum = (pos+1) - sum;
// if we can not continue the ’seq’, we do not continue it. Just append it
// to our result list, and return.
if (maxnum<=0) {
result.push_back (seq);
return result; }
// we try to write all possible numbers into position ’pos’
for (int i1=0; i1<=maxnum; i1++) {
// create new sequence
int* nseq = new int[5];
// copy our initial sequence
for (int j=0; j<Z; j++)
nseq[6] = seq[6];
// change position ’pos’ to ’i’
nseq[pos] = i1;
// we recursively call the same function, with the new (longer) sequence,
// and with 1 less positions to fill
list<int*> r = expand (nseq, pos-1);
// the results are collected in ’result’
result.merge (r); }
return result; }
int main () {
int* zeros = new int[N];
for (int i=0; i<N; i++)
zeros[i] = 0;
// start from the all-zero sequence
list<int*> sequences = expand(zeros, N-1);
// print the content of the list
for (list<int*>::iterator ii=sequences.begin(); ii!=sequences.end(); ii++) {
for (int j=N-1; j>=0; j--) cout << " " << (*ii)[j]; cout << endl;}}
WP07/5
ResearchGate has not been able to resolve any citations for this publication.
Conference Paper
Full-text available
In this paper, we present an analytical traffic model for the Universal Mobile Telecommunication Systems (UMTS). In 3G networks we have dynamic capacity that depends on the interference levels in the covered area and the number of active users. This implies that the distance of the mobile user from the base station is also an important factor because of the signal fading. The first part of this paper is an algorithm written in c++ programming language that distributes users in different zones assuming that the cell area is virtually divided into Z zones depending on the number of users. The last part of this paper we build a mathematical model of a 3G cell using the above assumption , and to prove, that the product form holds in the case of two cells with uniform and non uniform traffic. By this result more complicated networks can be analyzed, to calculate the performance measures of the network.
Article
Full-text available
In this paper we demonstrate the applicability of the new and powerful high-level modelling language MOSEL (MOdeling, Specification and Evaluation Language) using examples from queueing networks with finite capacity, retrial systems, and mobile networks. MOSEL allows the modelling of the functional and temporal behaviour as well as the specification of complex performance and reliability measures of many real-world systems in a straight and simple way. The core of MOSEL consists of a set of constructs to specify the possible states and state changes of the system. Additional syntax is dedicated to the description of the conditions under which transitions are allowed or prohibited. In order to model the temporal behaviour of the system properly, possible state changes can either occur immediately or after an exponentially distributed delay. In contrast to many specification languages of existing performance modelling and analysis tools, which often tend to be too verbose, most MOSEL specifications are compact but anyhow easy to understand. Moreover, MOSEL provides means by which many interesting performance or reliability measures and the graphical presentation of them can be specified straightforwardly. It is especially easy to analyse a model with different sets of system parameters. The benefit of MOSEL - especially for the practitioner from the industry - lies in its modelling environment: A MOSEL model is automatically translated into various tool-specific system descriptions and then analyzed by the appropriate tools. This exempts the modeller from the time-consuming task of learning different modelling languages. The presented examples originate from different application areas: First, we investigate models of queueing networks with finite capacity which are very important in the performance modelling of computer and manufacturing systems. Then we model a retrial system, which for example is suitable to describe the situation at airports when aircrafts are waiting for landing permission. Next, we specify a reliability model for a multiprocessor system. As a fourth example we present a model of a real system from wireless communications: The call admission control protocol in a Third Generation (3G) wireless mobile network. In all examples, the interesting performance and reliability measures are calculated after a Continuous Time Markov Chain (the underlying stochastic process of the MOSEL model) has automatically been generated and solved by standard numerical solution methods. The graphical representations of these results were created by the utility IGL (Intermediate Graphical Language) which is part of the MOSEL modelling environment.
Article
Full-text available
A mobile ad hoc network consists of a collection of wireless mobile nodes that are capable of communicating with each other without the use of a network infrastructure or any centralized administration. MANET is an emerging research area with practical applications. However, wireless MANET is particularly vulnerable due to its fundamental characteristics, such as open medium, dynamic topology, distributed cooperation, and constrained capability. Routing plays an important role in the security of the entire network. In general, routing security in wireless MANETs appears to be a problem that is not trivial to solve. In this article we study the routing security issues of MANETs, and analyze in detail one type of attack-the "black hole" problem-that can easily be employed against the MANETs. We also propose a solution for the black hole problem for ad hoc on-demand distance vector routing protocol.
Book
Building on the success of the first edition, UMTS Networks second edition allows readers to continue their journey through UMTS up to the latest 3GPP standardization phase, Release 5. Containing revised, updated and brand new material, it provides a comprehensive view on the UMTS network architecture and its latest developments. Accompanied by numerous illustrations, the practical approach of the book benefits from the authors' pioneering research and training in this field. Provides a broad yet detailed overview of the latest worldwide developments in UMTS technology. Includes brand new sections on the IP Multimedia Subsystem and High Speed Downlink Packet Access according to 3GPP Release 5 specifications. Contains heavily revised sections on the evolution from GSM to UMTS Multi-access, the UMTS Radio Access Network, the UMTS Core Network and services. Includes updated versions on services in the UMTS environment, security in the UMTS environment and UMTS protocols. Illustrates all points with cutting-edge practical examples gleaned from the authors' research and training at the forefront of UMTS. The illustrative, hands-on approach will appeal to operators, equipment vendors, systems designers, developers and marketing professionals who require comprehensive, practical information on the latest developments in UMTS. This second edition will also benefit students and researchers in the field of mobile networking.
Book
This comprehensive resource contains a detailed methodology for assessing, analyzing and optimizing End-to-End Service Performance under different cellular technologies (GPRS, EDGE, WCDMA and CDMA2000). It includes guidelines for analyzing numerous different services, including FTP, WEB streaming and POC, including examples of analysis and troubleshooting from a user point-of-view. Focuses on the end-user perspective, with a detailed analysis of the main sources of service performance degradation and a comprehensive description of mobile data services. Includes a detailed presentation of generic key performance indicators (KPIs) which can be re-defined to comply with each particular network. Provides service performance benchmarking for different technologies from real networks. Explores a new approach to service management known as customer experience management, including the reasons why it is overcoming traditional service management and its impact on revenues and customer satisfaction. Illustrates all points throughout using real world examples gleaned from cutting-edge research. This book draws together findings from authoritative sources that will appeal to cellular network operators and vendors. The theory-based, practical approach will be of interest to postgraduate students and telecommunication and consulting companies working in the field of cellular technologies.
Article
New solutions are given for the minimum required transmitter powers for CDMA cellular or PCS systems for all categories of the forward link channels, namely pilot, sync, paging, and traac channels. Any excess power over that re-quired for the speciied error performance of any c hannel cat-egory always reduces the user capacity, so it is necessary to know the minimum required power levels for all of the for-ward link channels. We show the solutions for the forward link channel powers by including fade margins to improve link reliability in lognormal shadowing. The amount of margin required to achieve a given reliability is calculated. We de-rive system capacity expressions as functions of link margins for speciied reliability requirements and the corresponding minimum transmitter power levels. Example solutions are also presented in graphical forms for typical realistic opera-tional parameters, to illustrate the use of the solution formu-las. These solutions can be applied to maximize the capacity of a particular CDMA cellular or PCS system under diierent parametric situations.
W-CDMA and cdma2000 for 3G Mobile Networks
  • M Karim
  • M Sarraf
M. Karim and M. Sarraf, W-CDMA and cdma2000 for 3G Mobile Networks. McGraw-Hill, 2002.
Lecture Notes in Mobile Networks Performance Modelling
  • M E Woodward
M. E. Woodward, Lecture Notes in Mobile Networks Performance Modelling, Coputing Department. Bradford University.