This document presents a study on traffic management models for wireless communication networks. It contains 7 chapters that analyze performance of different aspects of wireless networks like wireless local loop systems, cellular networks, and video on demand applications. The introduction chapter discusses motivation, performance modeling, traffic management techniques, and performance measures for wireless communication networks. It aims to ensure information exchange with optimal quality of service anywhere and anytime.
This document provides an overview of the BICC protocol and application in R4 networks. It discusses BICC protocol structure and message introduction, signaling flows including examples of call setup with forward and backward bearer establishment. It also covers topics like BICC protocol model, message structure, blocking and unblocking of call instances, main BICC messages, tunnel bearer setup, codec negotiation and call release scenarios. Signaling flows and examples are provided to illustrate different call setup scenarios.
Report Simulations of Communication SystemsFerro Demetrio
This document describes a simulation of digital communication systems for radio relay links. It simulates both single carrier and multi-carrier systems using MATLAB. For single carrier systems, it generates random binary data, performs QPSK or OQPSK modulation, filters the signal, adds noise through an AWGN or two-ray channel model, and evaluates performance by estimating bit error rate. It then optimizes system parameters like modulation index to minimize energy per bit for a given bit error rate. The simulation also models adjacent channel interference in multi-carrier systems.
Performance Model of Key Points At the IPTV NetworksCSCJournals
In this paper we propose a new analytical model for modeling of the key points at the IPTV networks. This model uses Gamma distribution with Intergroup Characteristics for modeling self similar nature of processes in key points of IPTV network. Enclosed Gamma Distribution results are compared with results from real measurements. Calculated discrepancies confirm that enclosed analytical model is optimal estimation model for process modeling of the key points at the IPTV network. The used methodology for real-time analyses of the key points at the IPTV Network is very important for achieving IPTV service best performance.
Dcf learn and performance analysis of 802.11 b wireless networkIJCNCJournal
Though WLAN wireless network has been widely deployed as the main split-flow deployment of the
communication network, little study emphasizes its performance as WLAN protocols were only designed for
the public communicating conveniently with each other. Actually that too much wireless access points
assembling together will cause self-interference to the whole WLAN network. This paper investigates the
distributed coordination function (DCF) learn and the performance study of 802.11b networks. Firstly, our
study illustrates the performance of its MAC layer and its fairness issues related to DCF. Next we propose
the details which should be paid attention to in deploying network services. Then, performance analyses
are evaluated by simulation and real test for a dense wireless network. Our main goal is to give proposals
to network operators how to design a WLAN network more standardized and orderly.
The improvement of end to end delays in network management system using netwo...IJCNCJournal
The document summarizes research on improving end-to-end delays in a network management system using network coding. Specifically, it applies network coding to manage radio and television broadcast stations in a wireless network. The study shows that a proposed "Fast Forwarding Strategy" using network coding outperforms a classical routing strategy in reducing end-to-end delays from source to destination. It analyzes end-to-end delays theoretically using network calculus and conducts a practical study on a network of broadcast stations, finding the proposed strategy reduces delays compared to the classical strategy.
Design and Optimal Configuration of Full-Duplex MAC Protocol for Cognitive Ra...Polytechnique Montreal
In this paper, we propose an adaptive medium access control (MAC) protocol for
full-duplex (FD) cognitive radio networks in which FD secondary users (SUs) perform channel contention
followed by concurrent spectrum sensing and transmission, and transmission only with maximum power
in two different stages (called the FD sensing and transmission stages, respectively) in each contention
and access cycle. The proposed FD cognitive MAC (FDC-MAC) protocol does not require synchronization
among SUs, and it efciently utilizes the spectrum and mitigates the self-interference in the FD transceiver.
We develop a mathematical model to analyze the throughput performance of the FDC-MAC protocol, where
both half-duplex (HD) transmission and FD transmission modes are considered in the transmission stage.
Then, we study the FDC-MAC conguration optimization through adaptively controlling the spectrum
sensing duration and transmit power level in the FD sensing stage.We prove that there exists optimal sensing
time and transmit power to achieve the maximum throughput, and we develop an algorithm to congure
the proposed FDC-MAC protocol. Extensive numerical results are presented to illustrate the optimal
FDC-MAC conguration and the impacts of protocol parameters and the self-interference cancellation
quality on the throughput performance. Moreover, we demonstrate the signicant throughput gains of the
FDC-MAC protocol with respect to the existing HD MAC and single-stage FD MAC protocols
Implementation of Joint Network Channel Decoding Algorithm for Multiple Acces...csandit
In this paper, we consider a Joint Network Channel Decoding (JNCD) algorithm applied to a
wireless network consisting to M users. For this purpose M sources desire to send information
to one receiver by the help of an intermediate node which is the relay. The Physical Layer
Network Coding (PLNC) allows the relay to decode the combined information being sent from
different transmitters. Then, it forwards additional information to the destination node which
receives also signals from source nodes. An iterative JNCD algorithm is developed at the
receiver to estimate the information being sent from each transmitter. Simulation results show
that the Bit Error Rate (BER) can be decreased by using this concept comparing to the
reference one which doesn’t consider the network coding.
The document summarizes the research scope and contributions of the author's PhD dissertation on medium access control (MAC) protocols for cognitive radio networks (CRNs). It discusses four past research areas: (1) CMAC protocol design with parallel spectrum sensing, (2) CMAC protocol with sequential sensing, (3) CMAC protocol with cooperative sensing, and (4) asynchronous full-duplex CMAC protocol. It also outlines three potential future research directions: (1) multi-channel MAC protocol design for full-duplex CRNs, (2) cross-layer CMAC and routing design for multi-hop CRNs, and (3) joint cognitive protocol and data processing design for smart grid applications.
This document provides an overview of the BICC protocol and application in R4 networks. It discusses BICC protocol structure and message introduction, signaling flows including examples of call setup with forward and backward bearer establishment. It also covers topics like BICC protocol model, message structure, blocking and unblocking of call instances, main BICC messages, tunnel bearer setup, codec negotiation and call release scenarios. Signaling flows and examples are provided to illustrate different call setup scenarios.
Report Simulations of Communication SystemsFerro Demetrio
This document describes a simulation of digital communication systems for radio relay links. It simulates both single carrier and multi-carrier systems using MATLAB. For single carrier systems, it generates random binary data, performs QPSK or OQPSK modulation, filters the signal, adds noise through an AWGN or two-ray channel model, and evaluates performance by estimating bit error rate. It then optimizes system parameters like modulation index to minimize energy per bit for a given bit error rate. The simulation also models adjacent channel interference in multi-carrier systems.
Performance Model of Key Points At the IPTV NetworksCSCJournals
In this paper we propose a new analytical model for modeling of the key points at the IPTV networks. This model uses Gamma distribution with Intergroup Characteristics for modeling self similar nature of processes in key points of IPTV network. Enclosed Gamma Distribution results are compared with results from real measurements. Calculated discrepancies confirm that enclosed analytical model is optimal estimation model for process modeling of the key points at the IPTV network. The used methodology for real-time analyses of the key points at the IPTV Network is very important for achieving IPTV service best performance.
Dcf learn and performance analysis of 802.11 b wireless networkIJCNCJournal
Though WLAN wireless network has been widely deployed as the main split-flow deployment of the
communication network, little study emphasizes its performance as WLAN protocols were only designed for
the public communicating conveniently with each other. Actually that too much wireless access points
assembling together will cause self-interference to the whole WLAN network. This paper investigates the
distributed coordination function (DCF) learn and the performance study of 802.11b networks. Firstly, our
study illustrates the performance of its MAC layer and its fairness issues related to DCF. Next we propose
the details which should be paid attention to in deploying network services. Then, performance analyses
are evaluated by simulation and real test for a dense wireless network. Our main goal is to give proposals
to network operators how to design a WLAN network more standardized and orderly.
The improvement of end to end delays in network management system using netwo...IJCNCJournal
The document summarizes research on improving end-to-end delays in a network management system using network coding. Specifically, it applies network coding to manage radio and television broadcast stations in a wireless network. The study shows that a proposed "Fast Forwarding Strategy" using network coding outperforms a classical routing strategy in reducing end-to-end delays from source to destination. It analyzes end-to-end delays theoretically using network calculus and conducts a practical study on a network of broadcast stations, finding the proposed strategy reduces delays compared to the classical strategy.
Design and Optimal Configuration of Full-Duplex MAC Protocol for Cognitive Ra...Polytechnique Montreal
In this paper, we propose an adaptive medium access control (MAC) protocol for
full-duplex (FD) cognitive radio networks in which FD secondary users (SUs) perform channel contention
followed by concurrent spectrum sensing and transmission, and transmission only with maximum power
in two different stages (called the FD sensing and transmission stages, respectively) in each contention
and access cycle. The proposed FD cognitive MAC (FDC-MAC) protocol does not require synchronization
among SUs, and it efciently utilizes the spectrum and mitigates the self-interference in the FD transceiver.
We develop a mathematical model to analyze the throughput performance of the FDC-MAC protocol, where
both half-duplex (HD) transmission and FD transmission modes are considered in the transmission stage.
Then, we study the FDC-MAC conguration optimization through adaptively controlling the spectrum
sensing duration and transmit power level in the FD sensing stage.We prove that there exists optimal sensing
time and transmit power to achieve the maximum throughput, and we develop an algorithm to congure
the proposed FDC-MAC protocol. Extensive numerical results are presented to illustrate the optimal
FDC-MAC conguration and the impacts of protocol parameters and the self-interference cancellation
quality on the throughput performance. Moreover, we demonstrate the signicant throughput gains of the
FDC-MAC protocol with respect to the existing HD MAC and single-stage FD MAC protocols
Implementation of Joint Network Channel Decoding Algorithm for Multiple Acces...csandit
In this paper, we consider a Joint Network Channel Decoding (JNCD) algorithm applied to a
wireless network consisting to M users. For this purpose M sources desire to send information
to one receiver by the help of an intermediate node which is the relay. The Physical Layer
Network Coding (PLNC) allows the relay to decode the combined information being sent from
different transmitters. Then, it forwards additional information to the destination node which
receives also signals from source nodes. An iterative JNCD algorithm is developed at the
receiver to estimate the information being sent from each transmitter. Simulation results show
that the Bit Error Rate (BER) can be decreased by using this concept comparing to the
reference one which doesn’t consider the network coding.
The document summarizes the research scope and contributions of the author's PhD dissertation on medium access control (MAC) protocols for cognitive radio networks (CRNs). It discusses four past research areas: (1) CMAC protocol design with parallel spectrum sensing, (2) CMAC protocol with sequential sensing, (3) CMAC protocol with cooperative sensing, and (4) asynchronous full-duplex CMAC protocol. It also outlines three potential future research directions: (1) multi-channel MAC protocol design for full-duplex CRNs, (2) cross-layer CMAC and routing design for multi-hop CRNs, and (3) joint cognitive protocol and data processing design for smart grid applications.
The document describes a simulation model for IEEE 802.16j Mobile Multi-Hop Relay (MMR) WiMAX networks using the NCTUns network simulator. Key aspects of the simulation model include:
1) It models the core components of NCTUns including the GUI, simulation engine, dispatcher, and kernel modifications to enable IEEE 802.16j MMR network simulations.
2) IEEE 802.16j supports two relay station modes - transparent and non-transparent - which differ in scheduling and number of hops supported.
3) The simulation model accounts for handover processes, which involve network scanning, cell reselection, and coordination between the mobile station and base stations.
Elementary procedures for Circuit-Switched (CS) Call Control (CC) in 3GPPLouis K. H. Kuo
The document provides an overview of elementary procedures for circuit-switched call control in 3GPP networks. It describes the background of related protocol layers and planes. Call control manages call establishment, clearing, information, and miscellaneous procedures. The main call types are mobile-originated, mobile-terminated, and network-initiated mobile-originated calls. Standard L3 messages follow specific formats and structures, and the call state is represented by state diagrams and message flow diagrams.
FPGA based Data Scrambler for Ultra-Wideband Communication Systemsidescitation
Ultra-Wideband (UWB) communication systems are
currently the focus of research and development in wireless
personal area networks (WPANs). These systems are capable
of transferring data from a rate of 110Mbps to 480Mbps in
realistic multipath environment. They consume very little
power and silicon area. In such systems, synchronization plays
very critical role to ensure correct and reliable system
operation. Improper synchronization can introduce timing
errors during transmission that can be eliminated using a
device called scrambler. In this paper, the scrambler for UWB
communication systems has been modeled and simulated using
Matlab and Xilinx’s System Generator for DSP (Digital Signal
Processing). Implementation of the scrambler has also been
done on Spartan 3E FPGA (Field Programmable Gate Array)
chip using Xilinx’s ISE Design Suite and results are compared.
LONG TERM EVOLUTION INVOLVES CHANGES TO BOTH RADIO INTERFACE AND NETWORK ARCHITECTURE IN ORDER TO KEEP 3RD GENERATION PARTNERSHIP PROJECT TECHNOLOGY COMPETITIVE. OFDMA WAS CHOSEN AS THE DOWNLINK AIR INTERFACE DUE TO ITS ADVANTAGES SUCH AS HIGH SPECTRAL EFFICIENCY AND ROBUSTNESS. THE PAPER DESCRIBES THE CELL SEARCH PROCEDURE AND POTENTIAL DESIGNS FOR THE PRIMARY AND SECONDARY SYNCHRONIZATION CHANNELS TO FACILITATE TIMING AND FREQUENCY SYNCHRONIZATION WITH LOW COMPLEXITY. SEVERAL
This document discusses cell coverage and ranges for LTE networks. Key points include:
- LTE aims to support cell radii up to 5 km while still enabling coverage of 100km or more, to support high-speed rail and wide-area deployments.
- Cell sizes in LTE can range from a few meters across in indoor environments to radii of 100km or more for large rural cells.
- The random access preamble formats and timing advance mechanisms in LTE are designed to support the maximum cell size of 100km radius to accommodate the largest expected propagation delays.
- A guard period duration of 700 μs supports one-way propagation delays of around 100km, allowing LTE to potentially support cell
Study of the VariousChannel Estimation Schemes in Wireless Mimo-Ofdm Networkstheijes
The Multiple Input Multiple Output Orthogonal Frequency Division Multiplexing system is used widely use.so it
is essential to understand the data transmission in such system. As the characteristics of the transmission
channel always changing with time, it is necessary to know the channel and channel estimation schemes in
wireless networks. The channel estimation schemes are required to make the channels according to required
parameters for the data transmission. Several channel estimation schemes are available and can be used with
different algorithms. In this paper various channel estimation schemes were discussed and their performance in
fading channel.
A preamble-based approach for Providing QOS support in Wireless Sensor Networkdiala wedyan
The document discusses various MAC protocols for wireless sensor networks, including TDMA, Low Power Listening, XMAC, and BMAC protocols. It then describes a proposed Back off Preamble-based MAC protocol that uses different preamble lengths to prioritize medium access. The protocol is evaluated through simulation in OPNET Modeler, comparing its performance under different quality of service strategies for handling high and low priority traffic flows. The proposed protocol aims to provide reliable delivery and satisfy quality of service requirements for wireless sensor networks.
The document discusses Ethernet networking technology. It describes the key components of an Ethernet frame including the preamble, start frame delimiter, destination and source addresses, length/type field, MAC client data, padding, frame check sequence, and extension field. It also provides details on how these frame fields are used to encapsulate and transmit data packets over the network.
This document discusses multiple access protocols for wireless networks. It describes random access methods like ALOHA and slotted ALOHA, controlled access methods using reservation, polling, and token passing, and channelization methods including FDMA, TDMA, and CDMA. Examples are provided to illustrate the calculation of throughput for various access loads in ALOHA and slotted ALOHA networks.
This document proposes a physical-layer network coding (PNC) scheme to improve throughput in wireless networks. PNC takes advantage of the broadcast nature of wireless transmissions by allowing signals from multiple nodes to be combined at the physical layer through modulation and demodulation. It demonstrates PNC for a three-node wireless linear network. With PNC, the three nodes can exchange information in two time slots, improving throughput by 100% over traditional scheduling and 50% over straightforward network coding. PNC mapping provides a way to perform network coding operations on electromagnetic signals directly at the physical layer by mapping their combination to binary additions.
This document provides an overview of high speed networks including Frame Relay networks, Asynchronous Transfer Mode (ATM), ATM protocol architecture, logical connections, cells, service categories, and high speed LANs. It discusses the architecture, user data transfer, and call control of Frame Relay networks. For ATM, it describes the protocol model, logical connections, cells, adaptation layer, and service categories. It also provides an introduction to emerging high speed LAN technologies.
Network control protocols are used in PPP to establish and terminate data links, provide authentication capabilities, manage network congestion, and allow multiple Layer 3 protocols to operate over the same physical link (option 4).
The DS0 standard has a data transmission rate of 64 kb/s (option 2).
Key differences between LANs and WANs are found in Layer 1 (Physical Layer) and Layer 2 (Data Link Layer) of the OSI model (options 1 and 2).
The Cisco implementation of the HDLC protocol is the default encapsulation for serial interfaces on Cisco routers (option 3).
Specifica‘tion, verification and simulation of a wireless lanambitlick
This document summarizes a formal specification, verification, and simulation of the MACAW wireless LAN protocol. The specification formally models MACAW using communicating finite state machines and shared variables. The verification analyzes basic configurations of 2, 3, and 4 machines to check for errors like deadlocks, but does not verify all possible configurations. The simulation provides further insight into MACAW's performance and suggests areas for improvement. In summary, the work formally specifies MACAW, verifies parts of its behavior, and simulates its performance to evaluate and potentially enhance the protocol.
The document discusses timing advances in GSM networks. It explains that timing advances are used to compensate for propagation delay between mobile stations and base transceiver stations. The base station system determines the timing advance needed based on how far away it perceives the mobile station to be. Each timing advance corresponds to a range of distances, with each subsequent timing advance representing an additional 553.5 meters in distance from the base transceiver station. The maximum distance of a cell is standardized at 37.8 kilometers to account for the round trip delay of the radio signal.
This document evaluates the performance of different backoff algorithms for the IEEE 802.15.4 standard using double sensing. It simulates the binary exponential backoff algorithm defined in the standard as well as three other algorithms: exponential increase exponential decrease, exponential increase linear decrease, and exponential increase multiplicative decrease. The results show that for higher node loads, the three alternative algorithms generally perform better than the standard binary exponential backoff in terms of throughput, delay, and energy consumption. Of the four algorithms evaluated, exponential increase exponential decrease consistently provided the best performance.
DSP Based Implementation of Scrambler for 56kbps ModemCSCJournals
Scrambler is generally employed in data communication systems to add redundancy in the transmitted data stream so that at the receiver end, timing information can be retrieved to aid the synchronization between data terminals. Present paper deals with simulation and implementation of the scrambler for 56Kbps voice-band modem. Scrambler for the transmitter of 56kbps modem was chosen as a case study. Simulation has been carried out using Simulink of Matlab. An algorithm for the scrambling function has been developed and implemented on Texas Instrument’s based TMS320C50PQ57 Digital Signal Processor (DSP). Signalogic DSP software has been used to compare the simulated and practical results.
Still NR Rel.15 was primarily designed for high frequency, high throughput small and mid-range communication systems mostly in dense urban and urban macro environments. In our view, this leaves out a large number of poorly connected populations that live in rural areas without viable solution even for basic broadband communication. We want to address this issue in the NR Rel.17 RAN1 work item on coverage enhancement. Discussion will start tonight in the 3GPP RAN1 e-meeting.
This document discussed open issues regarding coverage in long-distance scenarios. In addition, this document illustrates the baseline coverage performance of extreme long–range rural scenarios for FR1 700 MHz both in DL and UL based on system-level simulations.
This document discusses various MAC protocols for ad hoc wireless networks. It begins by outlining key issues in designing MAC protocols for these networks, such as bandwidth efficiency, quality of service support, and the hidden and exposed terminal problems. It then covers classifications of MAC protocols including contention-based, contention-based with reservation mechanisms, and contention-based with scheduling mechanisms. Specific protocols are discussed within each category.
Comparative study of_digital_modulation (1)Bindia Kumari
This document compares different digital modulation techniques that can be used in orthogonal frequency division multiplexing (OFDM) and WiMAX networks. It simulates BPSK, QPSK, 16-QAM and 64-QAM modulation in MATLAB and measures their performance in terms of bit error rate and throughput. The results show that higher order modulations like 64-QAM provide much higher throughput but also higher bit error rates compared to lower order modulations at a given signal-to-noise ratio. The best configuration balances low bit error rates and high throughput.
This document discusses the use of adaptive modulation and coding (AMC) techniques in wireless communication systems to improve throughput and error performance. It presents two AMC techniques: 1) a channel state technique that adapts the modulation and coding scheme based on channel attenuation levels to maximize throughput, and 2) a target block error rate (BLER) technique that selects modulation and coding schemes to maintain error rates below a target level. Simulation results show that AMC techniques can achieve better throughput and error probability performance than fixed modulation and coding schemes. The document concludes that AMC satisfies different quality of service constraints for throughput and error rate.
Machine Learning Based Session Drop Prediction in LTE Networks and its SON As...Ericsson
Abnormal bearer session release (i.e. bearer session drop) in cellular telecommunication networks may seriously impact the quality of experience of mobile users. The latest mobile technologies enable high granularity real-time reporting of all conditions of individual sessions, which gives rise to use data analytics methods to process and monetize this data for network optimization. One such example for analytics is Machine Learning (ML) to predict session drops well before the end of session.
The document describes a simulation model for IEEE 802.16j Mobile Multi-Hop Relay (MMR) WiMAX networks using the NCTUns network simulator. Key aspects of the simulation model include:
1) It models the core components of NCTUns including the GUI, simulation engine, dispatcher, and kernel modifications to enable IEEE 802.16j MMR network simulations.
2) IEEE 802.16j supports two relay station modes - transparent and non-transparent - which differ in scheduling and number of hops supported.
3) The simulation model accounts for handover processes, which involve network scanning, cell reselection, and coordination between the mobile station and base stations.
Elementary procedures for Circuit-Switched (CS) Call Control (CC) in 3GPPLouis K. H. Kuo
The document provides an overview of elementary procedures for circuit-switched call control in 3GPP networks. It describes the background of related protocol layers and planes. Call control manages call establishment, clearing, information, and miscellaneous procedures. The main call types are mobile-originated, mobile-terminated, and network-initiated mobile-originated calls. Standard L3 messages follow specific formats and structures, and the call state is represented by state diagrams and message flow diagrams.
FPGA based Data Scrambler for Ultra-Wideband Communication Systemsidescitation
Ultra-Wideband (UWB) communication systems are
currently the focus of research and development in wireless
personal area networks (WPANs). These systems are capable
of transferring data from a rate of 110Mbps to 480Mbps in
realistic multipath environment. They consume very little
power and silicon area. In such systems, synchronization plays
very critical role to ensure correct and reliable system
operation. Improper synchronization can introduce timing
errors during transmission that can be eliminated using a
device called scrambler. In this paper, the scrambler for UWB
communication systems has been modeled and simulated using
Matlab and Xilinx’s System Generator for DSP (Digital Signal
Processing). Implementation of the scrambler has also been
done on Spartan 3E FPGA (Field Programmable Gate Array)
chip using Xilinx’s ISE Design Suite and results are compared.
LONG TERM EVOLUTION INVOLVES CHANGES TO BOTH RADIO INTERFACE AND NETWORK ARCHITECTURE IN ORDER TO KEEP 3RD GENERATION PARTNERSHIP PROJECT TECHNOLOGY COMPETITIVE. OFDMA WAS CHOSEN AS THE DOWNLINK AIR INTERFACE DUE TO ITS ADVANTAGES SUCH AS HIGH SPECTRAL EFFICIENCY AND ROBUSTNESS. THE PAPER DESCRIBES THE CELL SEARCH PROCEDURE AND POTENTIAL DESIGNS FOR THE PRIMARY AND SECONDARY SYNCHRONIZATION CHANNELS TO FACILITATE TIMING AND FREQUENCY SYNCHRONIZATION WITH LOW COMPLEXITY. SEVERAL
This document discusses cell coverage and ranges for LTE networks. Key points include:
- LTE aims to support cell radii up to 5 km while still enabling coverage of 100km or more, to support high-speed rail and wide-area deployments.
- Cell sizes in LTE can range from a few meters across in indoor environments to radii of 100km or more for large rural cells.
- The random access preamble formats and timing advance mechanisms in LTE are designed to support the maximum cell size of 100km radius to accommodate the largest expected propagation delays.
- A guard period duration of 700 μs supports one-way propagation delays of around 100km, allowing LTE to potentially support cell
Study of the VariousChannel Estimation Schemes in Wireless Mimo-Ofdm Networkstheijes
The Multiple Input Multiple Output Orthogonal Frequency Division Multiplexing system is used widely use.so it
is essential to understand the data transmission in such system. As the characteristics of the transmission
channel always changing with time, it is necessary to know the channel and channel estimation schemes in
wireless networks. The channel estimation schemes are required to make the channels according to required
parameters for the data transmission. Several channel estimation schemes are available and can be used with
different algorithms. In this paper various channel estimation schemes were discussed and their performance in
fading channel.
A preamble-based approach for Providing QOS support in Wireless Sensor Networkdiala wedyan
The document discusses various MAC protocols for wireless sensor networks, including TDMA, Low Power Listening, XMAC, and BMAC protocols. It then describes a proposed Back off Preamble-based MAC protocol that uses different preamble lengths to prioritize medium access. The protocol is evaluated through simulation in OPNET Modeler, comparing its performance under different quality of service strategies for handling high and low priority traffic flows. The proposed protocol aims to provide reliable delivery and satisfy quality of service requirements for wireless sensor networks.
The document discusses Ethernet networking technology. It describes the key components of an Ethernet frame including the preamble, start frame delimiter, destination and source addresses, length/type field, MAC client data, padding, frame check sequence, and extension field. It also provides details on how these frame fields are used to encapsulate and transmit data packets over the network.
This document discusses multiple access protocols for wireless networks. It describes random access methods like ALOHA and slotted ALOHA, controlled access methods using reservation, polling, and token passing, and channelization methods including FDMA, TDMA, and CDMA. Examples are provided to illustrate the calculation of throughput for various access loads in ALOHA and slotted ALOHA networks.
This document proposes a physical-layer network coding (PNC) scheme to improve throughput in wireless networks. PNC takes advantage of the broadcast nature of wireless transmissions by allowing signals from multiple nodes to be combined at the physical layer through modulation and demodulation. It demonstrates PNC for a three-node wireless linear network. With PNC, the three nodes can exchange information in two time slots, improving throughput by 100% over traditional scheduling and 50% over straightforward network coding. PNC mapping provides a way to perform network coding operations on electromagnetic signals directly at the physical layer by mapping their combination to binary additions.
This document provides an overview of high speed networks including Frame Relay networks, Asynchronous Transfer Mode (ATM), ATM protocol architecture, logical connections, cells, service categories, and high speed LANs. It discusses the architecture, user data transfer, and call control of Frame Relay networks. For ATM, it describes the protocol model, logical connections, cells, adaptation layer, and service categories. It also provides an introduction to emerging high speed LAN technologies.
Network control protocols are used in PPP to establish and terminate data links, provide authentication capabilities, manage network congestion, and allow multiple Layer 3 protocols to operate over the same physical link (option 4).
The DS0 standard has a data transmission rate of 64 kb/s (option 2).
Key differences between LANs and WANs are found in Layer 1 (Physical Layer) and Layer 2 (Data Link Layer) of the OSI model (options 1 and 2).
The Cisco implementation of the HDLC protocol is the default encapsulation for serial interfaces on Cisco routers (option 3).
Specifica‘tion, verification and simulation of a wireless lanambitlick
This document summarizes a formal specification, verification, and simulation of the MACAW wireless LAN protocol. The specification formally models MACAW using communicating finite state machines and shared variables. The verification analyzes basic configurations of 2, 3, and 4 machines to check for errors like deadlocks, but does not verify all possible configurations. The simulation provides further insight into MACAW's performance and suggests areas for improvement. In summary, the work formally specifies MACAW, verifies parts of its behavior, and simulates its performance to evaluate and potentially enhance the protocol.
The document discusses timing advances in GSM networks. It explains that timing advances are used to compensate for propagation delay between mobile stations and base transceiver stations. The base station system determines the timing advance needed based on how far away it perceives the mobile station to be. Each timing advance corresponds to a range of distances, with each subsequent timing advance representing an additional 553.5 meters in distance from the base transceiver station. The maximum distance of a cell is standardized at 37.8 kilometers to account for the round trip delay of the radio signal.
This document evaluates the performance of different backoff algorithms for the IEEE 802.15.4 standard using double sensing. It simulates the binary exponential backoff algorithm defined in the standard as well as three other algorithms: exponential increase exponential decrease, exponential increase linear decrease, and exponential increase multiplicative decrease. The results show that for higher node loads, the three alternative algorithms generally perform better than the standard binary exponential backoff in terms of throughput, delay, and energy consumption. Of the four algorithms evaluated, exponential increase exponential decrease consistently provided the best performance.
DSP Based Implementation of Scrambler for 56kbps ModemCSCJournals
Scrambler is generally employed in data communication systems to add redundancy in the transmitted data stream so that at the receiver end, timing information can be retrieved to aid the synchronization between data terminals. Present paper deals with simulation and implementation of the scrambler for 56Kbps voice-band modem. Scrambler for the transmitter of 56kbps modem was chosen as a case study. Simulation has been carried out using Simulink of Matlab. An algorithm for the scrambling function has been developed and implemented on Texas Instrument’s based TMS320C50PQ57 Digital Signal Processor (DSP). Signalogic DSP software has been used to compare the simulated and practical results.
Still NR Rel.15 was primarily designed for high frequency, high throughput small and mid-range communication systems mostly in dense urban and urban macro environments. In our view, this leaves out a large number of poorly connected populations that live in rural areas without viable solution even for basic broadband communication. We want to address this issue in the NR Rel.17 RAN1 work item on coverage enhancement. Discussion will start tonight in the 3GPP RAN1 e-meeting.
This document discussed open issues regarding coverage in long-distance scenarios. In addition, this document illustrates the baseline coverage performance of extreme long–range rural scenarios for FR1 700 MHz both in DL and UL based on system-level simulations.
This document discusses various MAC protocols for ad hoc wireless networks. It begins by outlining key issues in designing MAC protocols for these networks, such as bandwidth efficiency, quality of service support, and the hidden and exposed terminal problems. It then covers classifications of MAC protocols including contention-based, contention-based with reservation mechanisms, and contention-based with scheduling mechanisms. Specific protocols are discussed within each category.
Comparative study of_digital_modulation (1)Bindia Kumari
This document compares different digital modulation techniques that can be used in orthogonal frequency division multiplexing (OFDM) and WiMAX networks. It simulates BPSK, QPSK, 16-QAM and 64-QAM modulation in MATLAB and measures their performance in terms of bit error rate and throughput. The results show that higher order modulations like 64-QAM provide much higher throughput but also higher bit error rates compared to lower order modulations at a given signal-to-noise ratio. The best configuration balances low bit error rates and high throughput.
This document discusses the use of adaptive modulation and coding (AMC) techniques in wireless communication systems to improve throughput and error performance. It presents two AMC techniques: 1) a channel state technique that adapts the modulation and coding scheme based on channel attenuation levels to maximize throughput, and 2) a target block error rate (BLER) technique that selects modulation and coding schemes to maintain error rates below a target level. Simulation results show that AMC techniques can achieve better throughput and error probability performance than fixed modulation and coding schemes. The document concludes that AMC satisfies different quality of service constraints for throughput and error rate.
Machine Learning Based Session Drop Prediction in LTE Networks and its SON As...Ericsson
Abnormal bearer session release (i.e. bearer session drop) in cellular telecommunication networks may seriously impact the quality of experience of mobile users. The latest mobile technologies enable high granularity real-time reporting of all conditions of individual sessions, which gives rise to use data analytics methods to process and monetize this data for network optimization. One such example for analytics is Machine Learning (ML) to predict session drops well before the end of session.
Improved EPRCA Congestion Control Scheme for ATM NetworksEswar Publications
Traffic management and congestion control are major issues in Asynchronous Transfer Mode(ATM) networks. Congestion arises when traffic in the network is more than offered load. The primary function of congestion control is to ensure good throughput and low delay performance while maintaining a fair allocation of network resources to users. In this paper, Enhanced Proportional Rate based Congestion Avoidance (EPRCA) scheme proposed by ATM forum has been considered. But this scheme has limitation of higher cell drop problem for the bursty traffic. Improvements to EPRCA scheme have been proposed to reduce cell drop problem and results of
improved EPRCA schemes were analyzed with basic EPRCA scheme.
Data detection with a progressive parallel ici canceller in mimo ofdmeSAT Publishing House
The document describes a progressive parallel interference canceller (PPIC) for use in a MIMO-OFDM system to suppress inter-carrier interference (ICI). PPIC is compared to parallel interference canceller (PIC) and shows lower complexity and better performance. PPIC architecture is simpler than PIC and more suitable for implementation in wireless communication systems requiring high data rates and mobility. Simulation results show that PPIC combined with LDPC coding achieves lower bit error rates than PIC combined with LDPC coding.
Moving Horizon Model Based Control in the Presence of Feedback NoiseEditor IJCATR
This paper studies the performance of networked control systems with a receding horizon controller. It is also assumed that there exists exogenous noise signal in feedback channel, modeled as a stochastic process. The impact of this noise on the closed-loop system performance is examined through both theoretical analysis and numerical experiments. An adaptive compensator is proposed to assist the original receding horizon controller. The performance of this solution is verified through simulation.
Point Sum Average Peak Algorithm Detection of LTEAM Publications
This paper proposes an improved detection algorithm for LTE Random Access preamble detection and evaluates the performance of the algorithm with respect to the performance of algorithms proposed in the literature using MDP metric.
A new method for controlling and maintainingIJCNCJournal
Topology Control is an essential technique in a wireless sensor network to extend the operational time of
the sensor nodes. The goal of this technique is to maintain network connectivity and optimize performance
metrics such as network lifetime and throughput. In this paper we presented a new method for controlling
and maintaining topology in wireless sensor networks that show some improvement over the state of art
methods. The results are analyzed based on objective criteria.
This document provides an overview of channel estimation strategies used in orthogonal frequency division multiplexing (OFDM) systems. It describes the basic types of channel estimation methods: block-type pilot channel estimation and comb-type pilot channel estimation. For block-type estimation, pilots are inserted into all subcarriers of OFDM symbols periodically. This allows estimation of the channel conditions between pilot symbols. Estimation can be done with least squares (LS), minimum mean-square error (MMSE), or modified MMSE. For comb-type estimation, pilots are inserted into certain subcarriers of each symbol, requiring interpolation to estimate data subcarriers. The document compares the implementation complexity and performance of different estimation methods.
1) The document describes a power system simulation experiment using MATLAB. It involves simulating various faults on a 3-bus system and analyzing the results. Graphs of voltages and currents are presented for different fault types.
2) The experiment also involves performing load flow analysis on a 3-6 bus system using Gauss-Seidel, Newton-Raphson, and Fast Decoupled methods. Relevant equations and sample data for a IEEE 30-bus test system are provided.
3) Key components in the MATLAB Simulink model used for fault analysis are described, including transformers, transmission lines, circuit breakers, fault blocks. The conclusions observed from the fault simulations are also summarized.
Performance Evaluation of a Layered WSN Using AODV and MCF Protocols in NS-2csandit
This document summarizes a study that compares the performance of two routing protocols, AODV and MCF, in a layered wireless sensor network (WSN) using the network simulator NS-2. It first provides background on AODV, describing how it establishes and maintains routes. It then describes the MCF protocol, which formulates lightpath routing as an integer linear program to minimize the impact of fiber failures. The document outlines how both protocols were implemented in NS-2 and compares their performance based on metrics like throughput, packet loss, and end-to-end delay. The simulation results show that MCF generally has better throughput and reliability than AODV in the scenario of a 80-node WSN.
IRJET- Compressed Sensing based Modified Orthogonal Matching Pursuit in DTTV ...IRJET Journal
This document discusses a modified orthogonal matching pursuit algorithm used for channel estimation in digital terrestrial television systems. It proposes using compressed sensing based channel estimation at the receiver to eliminate sparse information. Thresholding is used to remove noise from the channel estimation and improve signal quality. Simulation results show that bit error rate decreases when the received signal power from different transmitters is almost equal.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Computer aided design of communication systems / Simulation Communication Sys...Makan Mohammadi
This document summarizes a simulation of a digital communication system using Monte Carlo simulation methods. Key aspects include:
- QPSK/OQPSK modulation is used to modulate random binary data. Upsampling and root raised cosine filtering are used for pulse shaping.
- Nonlinear amplification is modeled, which can cause time distortion and bandwidth enlargement. Effects include increased PAPR.
- Channel models include AWGN and two-ray paths. Receiving uses a filter with splitting factor of 1-α for reconstruction.
- Eye diagrams and power spectral densities are used to analyze the signal before and after nonlinear amplification and channel effects. The simulation aims to estimate performance in realistic digital communication systems.
Signal-Energy Based Fault Classification of Unbalanced Network using S-Transf...idescitation
This document presents a technique for classifying faults on overhead transmission lines using S-Transform and a Probabilistic Neural Network (PNN) classifier. Voltage signals are processed using S-Transform to extract energy features from each phase. These 3 features (1 per phase) are used as inputs to a PNN classifier to determine the type of fault (e.g. line-ground, line-line) and faulty phase. The method was tested on a simulated 3-phase transmission line model in MATLAB with different fault conditions. It produced accurate classification results, even when noise was added to the signals. The paper concludes the method provides fast and accurate fault classification.
Cellular wireless systems like GSM suffer from congestion resulting in overall system degradation and poor service delivery. When the traffic demand in a geographical area is high, the input traffic rate will exceed thecapacity of the output lines. This work focused on homogenous wireless network (the network traffic and resource dimensioning that are statistically identical) such that the network performance
evaluation can be reduced to a system with single cell and a single traffic type. Such system can employa queuing model to evaluate the performance metric of a cell in terms of blocking probability.
Five congestion control models were compared in the work to ascertain their peculiarities, they are Erlang B, Erlang C, Engset (cleared), Engset (buffered), and Bernoulli. To analyze the system, an aggregate onedimensional Markov chain wasderived, such that it describes a call arrival process under the assumption
that it is Poisson distributed. The models were simulated and their results show varying performances, however the Bernoulli model (Pb5) tends to show a situation that allows more users access to the system and the congestion level remain unaffected despite increase in the number of users and the offered traffic into the system.
IRJET - Modeling of Swipt System using QPSK ModulationIRJET Journal
This document presents a LabVIEW-based modeling of a simultaneous wireless information and power transfer (SWIPT) system using quadrature phase-shift keying (QPSK) modulation. The SWIPT transmitter modulates a binary data stream using QPSK and upconverts it to a 1 GHz carrier frequency. At the receiver, the RF signal is split for both energy harvesting and information decoding paths. In the energy harvesting path, an RF rectifier converts the RF signal to DC voltage for powering devices. In the information decoding path, QPSK demodulation recovers the binary data stream. The LabVIEW model provides a comprehensive system-level simulation of the SWIPT transmitter and receiver that can evaluate performance under different parameters and assist with
This document proposes an adaptive scheme for measuring signal parameters for generator monitoring and protection using adaptive orthogonal filters. The algorithm adapts the filter data window length and coefficients according to a coarse estimation of the signal frequency, allowing accurate measurements over a wide frequency band including during generator start-up. Measured signals are also used to train artificial neural networks to classify generator operation modes and detect phenomena like pole slipping and out-of-step conditions. The document describes the adaptive measurement scheme, provides an example using signals from simulations, and discusses using a genetic algorithm to optimize the design of an artificial neural network-based out-of-step protection system.
This document contains answers to 8 questions about wireless networks and communication. It discusses topics like signal modulation, frequency assignment in MFSK modulation, analog and frequency modulation examples, QAM constellation diagrams, error checking methods like CRC and FCS, an example of direct sequence spread spectrum, and factors to consider when choosing a cellular network cell shape.
Modeling and simulation of single phase transformer inrush current using neur...Alexander Decker
This document discusses modeling and simulating transformer inrush current using a neural network. It presents equations to calculate inrush current based on transformer parameters. Data on time and flux linkage values during inrush are obtained via simulation in MATLAB and used to train a neural network. The trained network accurately models the inrush current waveform, with an average 1.056% error compared to a semi-analytic solution. Tables and figures show the neural network structure, weights, training error reduction, and ability to model the magnetization curve matching the semi-analytic solution.
Similar to Studies On Traffic Management Models for Wireless Communication Network (20)
ISO/IEC 27001, ISO/IEC 42001, and GDPR: Best Practices for Implementation and...PECB
Denis is a dynamic and results-driven Chief Information Officer (CIO) with a distinguished career spanning information systems analysis and technical project management. With a proven track record of spearheading the design and delivery of cutting-edge Information Management solutions, he has consistently elevated business operations, streamlined reporting functions, and maximized process efficiency.
Certified as an ISO/IEC 27001: Information Security Management Systems (ISMS) Lead Implementer, Data Protection Officer, and Cyber Risks Analyst, Denis brings a heightened focus on data security, privacy, and cyber resilience to every endeavor.
His expertise extends across a diverse spectrum of reporting, database, and web development applications, underpinned by an exceptional grasp of data storage and virtualization technologies. His proficiency in application testing, database administration, and data cleansing ensures seamless execution of complex projects.
What sets Denis apart is his comprehensive understanding of Business and Systems Analysis technologies, honed through involvement in all phases of the Software Development Lifecycle (SDLC). From meticulous requirements gathering to precise analysis, innovative design, rigorous development, thorough testing, and successful implementation, he has consistently delivered exceptional results.
Throughout his career, he has taken on multifaceted roles, from leading technical project management teams to owning solutions that drive operational excellence. His conscientious and proactive approach is unwavering, whether he is working independently or collaboratively within a team. His ability to connect with colleagues on a personal level underscores his commitment to fostering a harmonious and productive workplace environment.
Date: May 29, 2024
Tags: Information Security, ISO/IEC 27001, ISO/IEC 42001, Artificial Intelligence, GDPR
-------------------------------------------------------------------------------
Find out more about ISO training and certification services
Training: ISO/IEC 27001 Information Security Management System - EN | PECB
ISO/IEC 42001 Artificial Intelligence Management System - EN | PECB
General Data Protection Regulation (GDPR) - Training Courses - EN | PECB
Webinars: https://pecb.com/webinars
Article: https://pecb.com/article
-------------------------------------------------------------------------------
For more information about PECB:
Website: https://pecb.com/
LinkedIn: https://www.linkedin.com/company/pecb/
Facebook: https://www.facebook.com/PECBInternational/
Slideshare: http://www.slideshare.net/PECBCERTIFICATION
বাংলাদেশের অর্থনৈতিক সমীক্ষা ২০২৪ [Bangladesh Economic Review 2024 Bangla.pdf] কম্পিউটার , ট্যাব ও স্মার্ট ফোন ভার্সন সহ সম্পূর্ণ বাংলা ই-বুক বা pdf বই " সুচিপত্র ...বুকমার্ক মেনু 🔖 ও হাইপার লিংক মেনু 📝👆 যুক্ত ..
আমাদের সবার জন্য খুব খুব গুরুত্বপূর্ণ একটি বই ..বিসিএস, ব্যাংক, ইউনিভার্সিটি ভর্তি ও যে কোন প্রতিযোগিতা মূলক পরীক্ষার জন্য এর খুব ইম্পরট্যান্ট একটি বিষয় ...তাছাড়া বাংলাদেশের সাম্প্রতিক যে কোন ডাটা বা তথ্য এই বইতে পাবেন ...
তাই একজন নাগরিক হিসাবে এই তথ্য গুলো আপনার জানা প্রয়োজন ...।
বিসিএস ও ব্যাংক এর লিখিত পরীক্ষা ...+এছাড়া মাধ্যমিক ও উচ্চমাধ্যমিকের স্টুডেন্টদের জন্য অনেক কাজে আসবে ...
How to Setup Warehouse & Location in Odoo 17 InventoryCeline George
In this slide, we'll explore how to set up warehouses and locations in Odoo 17 Inventory. This will help us manage our stock effectively, track inventory levels, and streamline warehouse operations.
Communicating effectively and consistently with students can help them feel at ease during their learning experience and provide the instructor with a communication trail to track the course's progress. This workshop will take you through constructing an engaging course container to facilitate effective communication.
it describes the bony anatomy including the femoral head , acetabulum, labrum . also discusses the capsule , ligaments . muscle that act on the hip joint and the range of motion are outlined. factors affecting hip joint stability and weight transmission through the joint are summarized.
Philippine Edukasyong Pantahanan at Pangkabuhayan (EPP) CurriculumMJDuyan
(𝐓𝐋𝐄 𝟏𝟎𝟎) (𝐋𝐞𝐬𝐬𝐨𝐧 𝟏)-𝐏𝐫𝐞𝐥𝐢𝐦𝐬
𝐃𝐢𝐬𝐜𝐮𝐬𝐬 𝐭𝐡𝐞 𝐄𝐏𝐏 𝐂𝐮𝐫𝐫𝐢𝐜𝐮𝐥𝐮𝐦 𝐢𝐧 𝐭𝐡𝐞 𝐏𝐡𝐢𝐥𝐢𝐩𝐩𝐢𝐧𝐞𝐬:
- Understand the goals and objectives of the Edukasyong Pantahanan at Pangkabuhayan (EPP) curriculum, recognizing its importance in fostering practical life skills and values among students. Students will also be able to identify the key components and subjects covered, such as agriculture, home economics, industrial arts, and information and communication technology.
𝐄𝐱𝐩𝐥𝐚𝐢𝐧 𝐭𝐡𝐞 𝐍𝐚𝐭𝐮𝐫𝐞 𝐚𝐧𝐝 𝐒𝐜𝐨𝐩𝐞 𝐨𝐟 𝐚𝐧 𝐄𝐧𝐭𝐫𝐞𝐩𝐫𝐞𝐧𝐞𝐮𝐫:
-Define entrepreneurship, distinguishing it from general business activities by emphasizing its focus on innovation, risk-taking, and value creation. Students will describe the characteristics and traits of successful entrepreneurs, including their roles and responsibilities, and discuss the broader economic and social impacts of entrepreneurial activities on both local and global scales.
LAND USE LAND COVER AND NDVI OF MIRZAPUR DISTRICT, UPRAHUL
This Dissertation explores the particular circumstances of Mirzapur, a region located in the
core of India. Mirzapur, with its varied terrains and abundant biodiversity, offers an optimal
environment for investigating the changes in vegetation cover dynamics. Our study utilizes
advanced technologies such as GIS (Geographic Information Systems) and Remote sensing to
analyze the transformations that have taken place over the course of a decade.
The complex relationship between human activities and the environment has been the focus
of extensive research and worry. As the global community grapples with swift urbanization,
population expansion, and economic progress, the effects on natural ecosystems are becoming
more evident. A crucial element of this impact is the alteration of vegetation cover, which plays a
significant role in maintaining the ecological equilibrium of our planet.Land serves as the foundation for all human activities and provides the necessary materials for
these activities. As the most crucial natural resource, its utilization by humans results in different
'Land uses,' which are determined by both human activities and the physical characteristics of the
land.
The utilization of land is impacted by human needs and environmental factors. In countries
like India, rapid population growth and the emphasis on extensive resource exploitation can lead
to significant land degradation, adversely affecting the region's land cover.
Therefore, human intervention has significantly influenced land use patterns over many
centuries, evolving its structure over time and space. In the present era, these changes have
accelerated due to factors such as agriculture and urbanization. Information regarding land use and
cover is essential for various planning and management tasks related to the Earth's surface,
providing crucial environmental data for scientific, resource management, policy purposes, and
diverse human activities.
Accurate understanding of land use and cover is imperative for the development planning
of any area. Consequently, a wide range of professionals, including earth system scientists, land
and water managers, and urban planners, are interested in obtaining data on land use and cover
changes, conversion trends, and other related patterns. The spatial dimensions of land use and
cover support policymakers and scientists in making well-informed decisions, as alterations in
these patterns indicate shifts in economic and social conditions. Monitoring such changes with the
help of Advanced technologies like Remote Sensing and Geographic Information Systems is
crucial for coordinated efforts across different administrative levels. Advanced technologies like
Remote Sensing and Geographic Information Systems
9
Changes in vegetation cover refer to variations in the distribution, composition, and overall
structure of plant communities across different temporal and spatial scales. These changes can
occur natural.
LAND USE LAND COVER AND NDVI OF MIRZAPUR DISTRICT, UP
Studies On Traffic Management Models for Wireless Communication Network
1. Studies On Traffic
Management Models For
Wireless Communication
Network
Presented By:
Neeta Singh
Center for Information and Decision Sciences,
Dr. B.R. Ambedkar University,
Agra-282002 (India)
Visit: https://www.rdcsolution.com,
Youtube: https://youtu.be/jYBglnf4VvA
2. Studies On Traffic Management Models
For Wireless Communication Network
WLL Cellular
WCNs
VOD
application
3. Chapters
Chapter 1: Introduction
Chapter 2: Some Markov Models
Chapter 3: Performance Analysis Of WLL
Chapter 4: Multilayer Cellular Network
Chapter 5: Performance Analysis Of Cellular Radio System Using
Soft-Computing Approach
Chapter 6: Performance Analysis Of Video Servers
Chapter 7: Servicing Schemes In Video-On-Demand
4. 1.1: Motivation
1.2: Performance Modeling of WCNs
1.3: Traffic Management in WCNs
1.4: Some Perspectives of WCNs
1.5: Methodological Aspects
1.6: Performance Measures
Chapter 1: Introduction
5. Motivation
The popularity of WCNs is due to several
advantages
The latter advantage enables what is often
called the 3A paradigm communications
Ultimate goal of wireless communication is to
ensure information exchange (Voice,
Data/Video) with any one, any where and at
any time.
6. Performance is one of the important issues that
effects the design, development, configuration and
tuning of a wireless communication system.
The performance analysis of WCNs can be done by
evaluating various performance measures viz.
throughput, delay, carried load, queue length,
blocking probability of traffic in the network, etc.
Thus performance analysis is needed throughout the
life cycle of such system.
Performance Modeling of WCNs
7. Traffic management is the art of providing users with
the service they need and have paid for.
An additional goal of traffic management is to make
efficient use of network resources.
The amount of traffic capacity required in a wireless
network is highly dependent on the type of traffic.
It appears that the integration of traffic voice, images,
data and video, each with its own multi objective QoS
requires the development of rather sophisticated
traffic models to carry out accurate design and
performance evaluation.
Traffic Management
9. Performance Measures
Blocking probability (new/handoff)
Delay probability
Dropping probability
Utilization
Average waiting time
Average number of calls
Average number of calls in the system
Response time in the system
Queue size distribution
Throughput/ Utilization
Traffic delay
10. Some Perspectives of WCNs
Public
Switched
Telephone
Network
MTSO
BTS
BTS
BTS
BTS
MTSO: Mobile Telecommunication Switching Office
Also known as MSC (Mobile Switching Center)
BTS: Base Transceiver Station
11. Call from conventional telephone
Call arrives at MSC via the PSTN
MSC then sends out a paging message via all BTS on
the FCC (Forward Control Channel).
The paging message contains subscriber’s Mobile
Identification Number (MIN)
The mobile unit responds with an acknowledgement on
the RCC (Reverse Control Channel)
MSC directs BS to assign FVC (Forward Voice
Channel) and RVC (Reverse Voice Channel)
BS also assigns a SAT tone (Supervisory Audio Tone)
and the VMAC (Voice Mobile Attenuation Code)
14. Chapter 2
M/M/1 Queue With Working Vacation And
Service Interruption (Published in CSI)
Markovian Queue With Randomly Changing
Arrival Rates Under N-Policy
Optimal Policy for Retrial Single Server
Queue With Reneging
back
15. Section 2A
What is Working Vacation ?
The free server may offer service to the customer, which are
not registered previously in normal case.
The free server is called on ‘working vacation’ as it can hear
the request of other type traffic via control distributed channel
and returns back after a random interval to establish its normal
connection, if there is any packet of routine type to be
transmitted in the buffer.
Systems is based on:
Unreliable Server
Breakdown
Repair
Setup
Techniques
Matrix geometric
back
16. Model Description
P0,0 P1,0 P2,0 P3,0 P4,0 Pn,0
l0
l0 l0 l0 l0 l0
mv mv mv mv mv mv
P1,1 P2,1 P3,1 P4,1 Pn,1
l1 l1 l1 l1 l1
mB mB mB mB mB
0 0 0
P1,2 P2,2 P3,2 P4,2 Pn,2
l2 l2 l2 l2 l2
P1,3 P2,3 P3,3 P4,3 Pn,3
l3 l3 l3 l3 l3
0 0 0
0 0 0
0 0 0
mv
h h h h h
a a a a a
q q q q q
b b b b b
l3
l1
l2
l0
mB
Busy state
Down state
Repair state
Vacation
state
0 0 0
0 0 0
0 0 0
0 0 0
state
customers
back
17. Probabilities
P(n,0) Probability of n customers being in the
system when the server is on working
vacation.
P(n,1) Probability of n customers being in the
system when the server is busy.
P(n,2) Probability of n customers being in the
system when the server is under
breakdown state.
P(n,3) Probability of n customers being in the
system when the server is under repair
state.
back
18. Performance Measures
The average number of customers in the
working vacation period:
The average number of customers in the system
when the server is in the busy state:
The average number of customers in the system
when the server is in broken down state:
0
)0,()(
n
nnPVE
1
)1,()(
n
nnPBE
1
)2,()(
n
nnPDE
back
19. Cont…
The average number of customers in the
working vacation period
The average number of customers in the
busy state
The average number of customers in the
broken down state
0
)0,()(
n
nnPVE
1
)1,()(
n
nnPBE
1
)2,()(
n
nnPDE
back
20. The average number of customers in the
repair state
The average number of customers in the
system
Throughput
Average delay
1
)3,()(
n
nnPRE
)()()()()( REDEBEVENE
1
)1,(
1
)0,(
n
nB
n
nv pp mm
)(NE
D
Numerical Result back
21. Concluding Remark
M/M/1 queueing model
unreliable server , working vacation and setup
time.
state-dependent arrival rate
We have facilitated sensitivity analysis which
can be further used to determine the optimal
control parameter.
back
22. Section: 2B
What is Randomly Changing Arrival Rates ?
A communication network system is the typical example of
changing arrival rate with a sudden increase in the traffic due
to an external phenomenon.
Systems is based on:
Two Channel
Random Intensity
N-Policy
Techniques
Generating function,
Matrix geometric
back
24. Steady State Probabilities
Pn,0 Probability that channel P is in Idle state and there are
‘n’ number of messages in the queue in front of P
Pn,1 Probability that channel P is in Busy state and there
are ‘n’ number of messages in the queue including in
service in front of P
Qn,0 Probability that channel Q is in Idle state and there are
‘n’ number of messages in the queue in front of Q
Qn,1 Probability that channel Q is in Busy state and there
are ‘n’ number of messages in the queue including in
service in front of Q
back
25. 1 2 n N-1 N N+1
0 1
0 1 N-1
pl0 pl0 pl0pl0
m0
m0
m0
m0 m0 m0 m0 m0
pl0 pl0
pl0 pl0 pl0
rl1 rl1 rl1 rl1 rl1rl1 rl1
m1 m1
m1 m1 m1m1 m1
rl1
rl1 rl1
m1
2
2 rl1
n
n
000
000 N-1
1 2 n N-1 N N+1
pl0
000
000
000
000
000
000
i
i
000
000
000
000
pl0
m0
rl1
m1
pl0
m0
rl1
m1
pl0
m0
rl1
m1
State Transition Diagram
Model Description
back
26. Performance Measures
Expected number of messages
Throughput
Average delay
0n
1,n1,n
1N
1n
0,n0,n
QPnQPn)N(E
1n
1,n1
1n
1,n0
QP mm
)N(E
D
back
27. 0
20
40
60
80
100
120
140
1.0 1.2 1.4 1.6 1.8 2.0
l0
E(N)
r=.3
r=.5
r=.7
0
10
20
30
40
50
60
1.0 1.2 1.4 1.6 1.8 2.0
l0
E(N)
p=.5
p=.7
p=.9
3
4
5
6
7
8
9
10
11
1.0 1.2 1.4 1.6 1.8 2.0
l1
E(N)
r=.3
r=.5
r=.7
2
3
4
5
6
7
8
9
10
11
1.0 1.2 1.4 1.6 1.8 2.0
l1
E(N)
p=.5
p=.7
p=.9
Fig. 2(a-b): Comparison of E(N) by varying l0 for different values of r and p respectively
Fig. 3(a-b): Comparison of E(N) by varying l1 for different values of r and p respectively
31. Concluding Remarks
The two service channels system are analysied by
considering switchover of messages from one channel to
another as can be realized in case of voice and data traffic
over ISDN network.
The model studied in this paper is capable to predict the
performance indices of real time system of
telecommunications wherein exclusive resources such as
transmission lines and switching nodes are shared by mixed
type traffic.
The further extension of work is possible by considering the
multi-class traffic which is the demand of multimedia services.
The computational tractability of the matrix geometric method
is validated by taking numerical illustrations.
Our study may be helpful to prevent congestion by routing
the traffic of excessive busy channel to less busy channel.
back
32. Section : 2C
In this section we consider, a Markovian retrial queue
with reneging
by considering the limited space in orbit.
The expressions for various performance measures
system state probabilities
number of customers in orbit
the expected waiting time in the queue
the expected waiting time in system
Numerical results are obtained to facilitate the comparison
of the corresponding model with infinite orbit capacity and
without reneging.
back
34. Assumptions
We consider a single server queue with Poisson input
rate l0 and l when server is idle and busy,
respectively.
The service time and retrial time are exponential
distributed with rate m and , respectively.
If server is busy then customer goes in the retrial
orbit of size N.
The customers in the orbit may retry for service with
probability r.
After joining the queue the customer may also renege
from the system.
The reneging is assumed to exponential distributed
with parameter .
back
35. Model Description
Let {St, Xt} denotes the system state space
where St is the number of customer being served at
time t
Xt represents the number of customers in the orbit at
time t.
The system is in state (i, j) if ith customer is being
served and j customers are in the orbit for i {0,1} and
j {0,1,2, …}.
The stationary probabilities
P0,j=P( S=0, X=j ), P1,j=P( S=1, X=j ),
back
36. The governing equations are constructed as
follows:
Solving above equations, we get
NjPjPj jj
0,)()( ,1,00
ml
10
,)1()1)(1()1( 1,01,11,1,00,1
Nj
PjPjrPrPPjrjr jjjjj
llml
1,1,00,1
)1(
NNN
PrPPjrN llm
NjP
j
j
P jj
0,
)(
,1
0
,0
l
m
back
38. Special Cases
1. Taking l0=l, we can derive the results for
homogeneous arrival rate.
2. Non-reneging behavior of customers has
obtained by putting =0
3. On substituting l0=l and =0, our results
coincide with the results of Elcan (1994) for
an M/M/1 queueing system with retrials.
39. Numerical Results
0
2
4
6
8
10
12
1.0 2.0 3.0 4.0 5.0 6.0 7.0 8.0 9.0
l0
E(K)
3
0.0
1.0
2.0
3.0
4.0
5.0
6.0
7.0
8.0
9.0
10.0
1.0 2.0 3.0 4.0 5.0 6.0 7.0 8.0 9.0
l
E(K)
3
0
2
4
6
8
10
12
14
16
0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9
E(K)
3
Figs. 1(a-c): E (K) by varying (a) l0 , (b) l and (c) g for different values of n
40. 0
2
4
6
8
10
12
1.0 2.0 3.0 4.0 5.0 6.0 7.0 8.0 9.0
l0
E(L)
3
0.0
1.0
2.0
3.0
4.0
5.0
6.0
7.0
8.0
9.0
10.0
1.0 2.0 3.0 4.0 5.0 6.0 7.0 8.0 9.0
l
E(L)
3
0
2
4
6
8
10
12
14
16
0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9
E(L)
3
Figs. 2(a-c): E (L) by varying (a) l0 , (b) l and (c) g for different values of n
41. 0
1
2
3
4
5
6
7
1.0 2.0 3.0 4.0 5.0 6.0 7.0 8.0 9.0
l0
E(K) r=.4
r=.6
r=.8
0.0
1.0
2.0
3.0
4.0
5.0
6.0
7.0
8.0
9.0
10.0
1.0 2.0 3.0 4.0 5.0 6.0 7.0 8.0 9.0
l
E(K)
r=.4
r=.6
r=.8
0.0
5.0
10.0
15.0
20.0
25.0
30.0
0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9
E(K)
r=.4
r=.6
r=.8
Figs. 3(a-c): E (K) by varying (a) l0 , (b) l and (c) g for different values of r
0.0
1.0
2.0
3.0
4.0
5.0
6.0
7.0
8.0
1.0 2.0 3.0 4.0 5.0 6.0 7.0 8.0 9.0
l0
E(L)
r=.4
r=.6
r=.8
0.0
2.0
4.0
6.0
8.0
10.0
1.0 2.0 3.0 4.0 5.0 6.0 7.0 8.0 9.0
l
E(L)
r=.4
r=.6
r=.8
0.0
5.0
10.0
15.0
20.0
25.0
30.0
0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9
E(L)
r=.4
r=.6
r=.8
Figs. 4(a-c): E (K) by varying (a) l0 , (b) l and (c) g for different values of r
42. 0
2
4
6
8
10
12
14
0.1 0.3 0.5 0.7 0.9
E(K)
l0l
l0l3
l0l
0.0
0.5
1.0
1.5
2.0
2.5
3.0
0.1 0.3 0.5 0.7 0.9r
E(K)
l0l
l0l3
l0l
Figs. 5(a-b): E (K) by varying (a) g , (b) r for different set of l
0
2
4
6
8
10
12
14
0.1 0.3 0.5 0.7 0.9
E(L)
l0l
l0l3
l0l
0.0
0.5
1.0
1.5
2.0
2.5
3.0
3.5
0.1 0.3 0.5 0.7 0.9
r
E(L)
l0l
l0l3
l0l
Figs. 6(a-b): E (L) by varying (a) g, (b) r for different set of l
43. Conclusion
finite orbit M/M/1 retrial queue with reneging.
The incorporation of reneging parameter makes our
model more closer to real life situations.
The model, which presented here, has wide utility in
computer system, communication system and
manufacturing systems, etc.
44. Chapter : 3
we study the performance of Wireless Local
Loop (WLL) system in term of call loss and
delay probabilities.
We predict the performance measures for the
prioritized channel assignment scheme
The traffic in the system is considered as
integrated (voice/data).
We drive several analytical results based on
based on channel assignments
population size
back
47. loss system
wherein a new call to ST is lost if si=ci-chi
channels in the corresponding BS are busy
S=TC-R trunks in the BSC are occupied.
The handoff calls are lost if
all the reserved channels in the corresponding
BS are occupied
all the reserved trunks in the BSC are busy.
48. IPLM
Infinite traffic source i.e STs.
When there is heavy traffic on the network,
then it becomes desirable to serve the new
calls in a different manner.
This can be done by using modified scheme
where the new calls can use the r reserved
channels also in case of light traffic of
handover calls provided they are free
n
nf
2
1
)(
50. Loss probabilities of new calls at ith
(i=1,2,…,B) BS
Loss probability of handoff data and handoff
voice calls
ic
isn
ininewi
snfPL )(1,,
icicehandoffvoiiahandoffdati
PLL ,,,
51. At BSC
Loss probabilities new calls, handoff data and
handoff voice calls
TCnSP
n
Sjf
SnP
n
P
bscn
n
Sj
newbschandoffbsc
S
bsc
bscn
n
bsc
nbsc
1,
)(!
)(
0,
)(!
0,
1
,,
0,
,
hm
lll
hm
l
TC
Sn
nbscnewbsc
SnfPL )(1,,
TCbsccehandoffvoibscahandoffdatbsc
PLL ,,,
52. Delay Models
where handoff calls are allowed to wait in a
buffer of size Ni, if channels are not available.
we consider finite population model with
reserved channels and function.
It is assumed that the traffic at each BS is
originated from finite population of size K.
54. Conclusion
Reserving a fixed number of channels for handoff
calls reduces their call loss and delay
probabilities
The function scheme in IDMS and FDMM offers
least blocking to the handoff voice calls in
comparison new and handoff data.
Furthermore, releasing function used in channels
allocation for providing service to handoff voice
calls reduces blocking to the new calls also.
55. Chapter4
The double layer architecture is based
Macro layer :
The outer layer has connection to subscribers and
receives fresh traffic destinated for the network
Used to cover large areas with low traffic density
Radius: 1-20km
High-speed moving terminals (HSMT)
Micro layer :
The inner layer only deals with traffic inside the
network structure.
Used in areas with high traffic density
Radius:200m-2km
Low speed moving terminals (LSMT).
back
56. Hierarchical Cellular Architecture
Larger cells serve users with lower number of handoff but the
capacity is also reduced
Smaller cells lead to increase in capacity but also increase
handoffs
If a hierarchical architecture is used proper cell assignment can
lead to increased capacity
57. Analytical Models
Double Layer Cellular Model
New Call Bounding
Cuttoff Priority Scheme
Cuttoff Priority With Releasing Function
Double Layer Cellular Model With Subrating
New Call Bounding With Subrating
Cuttoff Priority With Subrating
Cuttoff Priority With Releasing Function and
Subrating
58. New Call Bounding Scheme
Threshold number for new
call bounding (NCB) scheme
is k
if the number of new calls in
the cell exceeds k, the new
call will be blocked.
Otherwise it will be admitted.
The handoff call is rejected
only when all channels in the
cell are used up.
59. )0,0(),(
!!
P
nm
P
n
h
m
n
nm
1
0 0
)0,0(
!!
k
m
mc
n
n
h
m
n
nm
P
0,,0 ncnmkm
Steady state probability in each micro cell
where,
k
m
mc
n
n
Lh
m
n
k
m
mc
Lh
m
n
Lh
nm
mcm
B
0 0
0
!!
)!(!
Blocking probability of handoff calls of LSMT
k
m
mc
n
n
Lh
m
n
kc
n
k
m
mc
Lh
m
n
n
Lh
k
n
n
nm
mcmnk
B
0 0
0
1
0
!!
)!(!!!
Blocking probability of new calls
60. For the macro cell, consisting N number of micro layers
i=1,2,…,C
0
!
.
q
i
N
q
i
Hh
i
For Macro cell
where
1
0
0
!
.
C
i
i
Hh
i
N
q
61. Handoff call of HSMT will be blocked in the macro cell if
Overall blocking probability
Carried Load
!
.
C
N
B
C
Hh
Hh
l
lll HhHhLhLhnn BBB
B
l
lll )1()1()1( HhHhLhLhnn BBB
CL
62. Cutoff Priority Scheme (COP1)
Threshold number for cutoff
priority scheme is s
if the total number of busy
channels exceeds a threshold
limit s, and a new call arrives,
the new call will be blocked
otherwise it will be admitted.
The handoff call is rejected only
when all channels in the cell are
used up.
if we assume that there is no
new call bounding but r=c-s
channels are reserved to give
priority to handoff traffic in micro
cell.
63. Steady state probability
cis,P
!i
si,P
!iP si
Lh
s
Lhn
i
Lhn
i
1
0
0
0
s
i
c
si
si
Lh
s
Lhn
i
Lhn
c
si
si
Lh
s
Lhn
n
!i!i
!iB
0 1
1
s
i
c
si
si
Lh
s
Lhn
i
Lhn
sc
Lh
s
Lhn
Lh
ii
cB
0 1 !!
!
64. Cutoff Priority Scheme With Releasing
Function (COPF1 )
Steady state probability
cisP
i
sif
siP
iP si
n
s
Lhn
i
Lhn
i
Lh
1,
!
)(
0,
!
0
0
…13
P0 is also obtained by using normalization condition i.e. .
1
1
0
c
i
P
65. Blocking probability of new calls
s
i
c
si
si
n
s
Lhn
i
Lhn
c
si
si
n
s
Lhn
n
i
sif
i
i
sif
B
Lh
Lh
0 1
1
!
)(
!
!
)(
…14
Blocking probability of handoff calls
s
i
c
si
si
n
s
Lhn
i
Lhn
si
n
s
Lhn
Lh
i
sif
i
c
sif
B
Lh
Lh
0 1
!
)(
!
!
)(
…15
Numerical Result
66. Optimal Channel Allocation
Our aim in this section is to decide the number of
channels to be allocated in each cell so that the
blocking probabilities of the new and hand-off calls
could be minimized.
Three channel assignment schemes are concerned
to reduce the blocking probability of handoff attempts.
The channel assignment schemes are based on new
call bounding and cutoff priority criteria.
back
67. we propose an algorithm to assign optimal number of
unreserved channels (si) and guard channels (ri) to
each cell in the cluster;
we have total C channels in a cluster of a cellular
radio network depending on the blocking probability
of the new and handoff calls.
By applying the proposed algorithm to each cluster in
the overlaid area, the prioritized channel assignment
for double layer cellular network is proposed for the
whole network.
68. We want to find the smallest integer such
that
We formulate a Non-Linear Integer
Programming Problem (NIPP) for calculating
the optimal number of channels in each cell
which minimize the overall handoff call
blocking probability as:
0
js
max
0
,
)0,( BsB jnj
72. Chapter 5
Cellular Radio System Supporting Integrated Traffic
Call Admission Control And Blocking Probability
Estimation In PCS Networks
Handoff Prioritization Scheme And Optimal Allocation
back
73. Soft Computing
Provides flexile Information processing
capabilities for real life situations
Has the properties of approximation ad
dispositionality
74. Artificial Neural Network
We can simulate the structure of human brain
it is closely modeled on biological process
Such a structure is formed as “Artificial
Neural Network” structure.
We can train a neural network to perform a
particular function by adjusting the values of
the connection between elements.
76. Performance measures
The blocking probability of new and handoff
calls are calculated as
The overall blocking and carried load are
cknmrc
n knmpB ),,(
cknm
h knmpB ),,(
hhnn
BB
B
l
)1()1( hhnn
BB
CL
l
79. Section 5B
two-dimensional traffic is studied
by using Neuro-fuzzy approach
which readjusts the connection weight, by using
Backpropogation algorithm and simplifies the fuzzy rule
proposed prioritized scheme
by subrating an occupied channel on a blocked port
can be spilitted into two half rated channels to
accommodate more voice handoff attempts.
83. Section 5C
we consider the channel assignment scheme for two
traffic classes, voice and data by incorporating
balking
reneging
two-threshold guard channel policies.
channel allocation scheme
There is a provision of buffer for class-2 handoff.
In the proposed call admission scheme, the total
number of channels is sub divided into three subsets
ordinary channel, shared channels and dedicated guard
channels
84. 0 1
l
mh
C-k C
l h2
(C-k+1)(mh
C-
r-k
ll
2mh
C+
N
(C-r-k)(mh
00
0
l
h
(C-r-k+1)
(mh
l
h
(C-k)
(mh
l
h2b
l
h2b
C(mhNC
(mh
00
0
00
0
l h2
C(mh
00
0
NCnCP
ClCC
CnrCP
n
rCnkrCP
n
krCnP
n
P
n
Cj
Cn
h
r
h
k
h
krC
rCn
h
k
h
krC
krCn
h
krC
n
n
,
)()(!
,
!
,
!
0,
!
0
1
22
0
)(
2
0
)(
0
hm
bl
87. if
2h2h P)C,C,C(B
then
return (C,C)
end if
set
Cr
while
)P)r,k,C(B( 2h2h
do
set
1rr
end while
set
rk
while
)P)r,k,C(B( 1hh
do
if
)P)1r,k,C(B( 2h2h
then
set
1rr
else
set
1kk
end if
end while
return (k,r)
88. Properties of Blocking Probabilities
Property for blocking probability of new calls
Blocking probability of Bn decreases by increasing the number
of ordinary channels (C).
Blocking probability of new calls increases by increasing the
number of shared guard channels (k).
Blocking probability of new calls increases by increasing the
number of dedicated guard channels (r).
Property for blocking probability of handoff calls
Bh decreases as the number of ordinary channels (C)
increases.
Blocking probability of handoff calls decreases as the number of
shared guard channels (k) increases.
Blocking probability of handoff calls increases as the number of
dedicated guard channels (r) increases.
89. (c) Property for blocking probability of handoff
calls of class-2 traffic
Blocking probability of Bh2 decreases with the
increase in the number of ordinary channels (C).
Blocking probabilities of Bh2 decreases with the
increase in the number of shared guard channels (k).
Blocking probabilities of Bh2 decreases by increasing
the number of dedicated guard channels (r).
90. Conclusion
The incorporation of balking and reneging behavior
improves the model as it deals with more realistic
situations.
An optimal allocation algorithm is developed which
can be easily implemented as validated by
performing extensive numerical experiment.
The inclusion of two threshold levels in place of one
threshold level for allocation of guard channels
makes our model more versatile to deal with real time
wireless communication systems.
92. About VoD…
A video server stores compressed video for delivery (MPEG
Compressed format) to clients connected by a network.
The request of a particular file depends on the popularity or
demand.
Video data are distributed among the streams and multiple
streams
where the user can watch any movie at any time
he can pause / resume the video or rewind/forward it as per
his convenience
The request categorized into two types
Prioritized
Non-prioritized
VoD is based on:
programming
client-server architecture
93. Mathematical Modeling
IUM
The number of users are
assumed to be infinite
FUM
The number of users are
taken as finite
We Investigate analytical models
Models are compared on the basis of the blocking probabilities
We consider two models for analyzing the performance of the
video server
94. Infinite User Model (IUM)
The steady state probabilities of being ith streams in the disk is
…1
where
…2
!
!
)(
i
i
P
i
j
RIi
r
Ri
i
j
i
jjjj
a
a
jjj
jj
IiRI
RIi
10
1)(1
0
0
!!
ii
P
i
j
RIi
r
RiIj
RjIji
i
j
RjIj
i
jjjj
aa
96. The overall blocking probability of the jth disk
pn
p
jp
n
jn
ρρ
ΒρΒρ
jB
The overall blocking probability of video server
D
1j
jjBαB
The overall blocking probability of the jth disk
pn
p
jp
n
jn
ρρ
ΒρΒρ
jB
The overall blocking probability of video server
D
1j
jjBαB
…5
…6
…7
…8
97. Finite Users Model (FUM)
Ij
RjIji
i
j
RjIji
r
RjIj
RjIj
i
i
j
Ij
RjIji
i
j
n
j
i
M
i
M
ii
M
B
aa
a
)(
1
0
()(
!
)(
Ij
RjIji
i
j
RjIji
r
RjIjRjIj
i
i
j
Ij
j
Rj
r
RjIj
p
j
ii
M
ii
M
i
M
B
!
(
!
)( )(1
0
aa
a
…10
…9
Blocking probabilities of the prioritized
Blocking probabilities of non – prioritized
98. OPTIMAL TRAFFIC ALLOCATION
Here we suggest an iterative algorithm for determining the optimal
portion of the traffic to be allocated on the disks of the video
server, such that the overall blocking probability could be
minimized.
Overall blocking probability
Where
For minimizing
is the blocking probability of disk j at
D
j
jj BB
1
a
D
j
j
1
1a
D
j
jKBL
1
1a
opt
jj
j
opt
j BB aa
)(
opt
jB opt
ja
99. Fig.1 (a): File allocation for disk in the VoD
server
D=15, Ij=20; 1<=j<=4 ,Ij=15;
5<=j<=15
Two type of disks
Disks 1-4 have 20 I/O streams, qi =80%, for j=1-4
Disk 5-15 have 15 I/O streams, qj =6% for j=5-15.
Two different disks having equal I/O streams get equal percentage of traffic.
8%
8%
9%
9%
6%
6%6%6%
6%
6%
6%
6%
6%
6% 6%
File allocation for disk in the VoD server
D=15, Ij=20; 1<=j<=4 ,Ij=15; 5<=j<=15
100. Blocking probabilities of the
individual disk for prioritized
users request
Blocking probability of disk
and server
1.E-33
1.E-31
1.E-29
1.E-27
1.E-25
1.E-23
1.E-21
1.E-19
1.0 1.5 2.0 2.5 3.0 3.5 4.0 4.5
l
blockingprobability
bp 1-4
bp 5-15
Fig. 2(b): Blocking of individual disks for
prioritized traffic in IUM
1.E-24
1.E-22
1.E-20
1.E-18
1.E-16
1.E-14
1.E-12
1.E-10
1.E-08
1.E-06
1.0 1.5 2.0 2.5 3.0 3.5 4.0 4.5
l
blockingprobability
bq 1-4
bq 5-15
B
Fig. 2(c): Overall blocking of disks and
server for IUM
101. Fig 3(a): Blocking of individual disks for non -
prioritized traffic in FUM
1.E-21
1.E-19
1.E-17
1.E-15
1.E-13
1.E-11
1.E-09
1.E-07
0.2 0.4 0.6 0.8 1
l
blockingprobability
bu 1-4
bu 5-15
Fig. 3(b): Blocking of individual disks for
prioritized traffic in FUM
1.E-40
1.E-37
1.E-34
1.E-31
1.E-28
1.E-25
1.E-22
1.E-19
1.E-16
0.2 0.4 0.6 0.8 1
l
blockingprobability
br 1-4
br 5-15
1.E-22
1.E-20
1.E-18
1.E-16
1.E-14
1.E-12
1.E-10
1.E-08
1.E-06
0.2 0.4 0.6 0.8 1l
blockingprobability
bq 1-4
bq 5-15
B
a
Fig. 3(c): Overall blocking of disks and
server for FUM
Blocking probabilities of the
individual disk for prioritized
Users.
Blocking probability of the
disk for non-prioritized
users.
Overall blocking probabilities of
the disk and the video server
102. Fig. 4(a): Blocking of individual disks for non -
prioritized traffic in IUM
1.E-32
1.E-28
1.E-24
1.E-20
1.E-16
1.E-12
1.E-08
1.E-04
2 4 6 8 10 12
r
blockingprobability
bn 1-4
bn 5-15
Fig. 4(b): Blocking of individual disks for
prioritized traffic in IUM
1.E-22
1.E-21
1.E-20
1.E-19
1.E-18
1.E-17
1.E-16
2 4 6 8 10 12
r
blockingprobability
bp 1-4
bp 5-15
Fig. 4(c): Overall blocking of disks and server
for IUM
1.E-20
1.E-18
1.E-16
1.E-14
1.E-12
1.E-10
1.E-08
1.E-06
1.E-04
1.E-02
2 4 6 8 10 12
r
blockingprobability
dq 1-4
dq 5-15
B
Both the models, the increase in
the number of reserved channels
result in low blocking of prioritized
user request.
Blocking of non- prioritized user
increases with the increase in
reserved channels.
Optimal value of r
103. 1.E-08
1.E-07
1.E-06
1.E-05
1.E-04
1.E-03
2 3 4 5 6 7 8 9 10
r
blockingprobability
br 1-4
br 5-15
Fig. 5(a): Blocking of individual disks for
non prioritized traffic in FUM
Fig. 5(b): Blocking of individual disks for
prioritized traffic in FUMs
1.E-37
1.E-34
1.E-31
1.E-28
1.E-25
1.E-22
1.E-19
1.E-16
2 3 4 5 6 7 8 9 10
r
blockingprobability
bu 1-4
bu 5-15
1.E-09
1.E-08
1.E-07
1.E-06
1.E-05
1.E-04
1.E-03
2 3 4 5 6 7 8 9 10
r
blockingprobability
bq 1-4
bq 5-15
B
Fig. 5(c): Overall blocking of disks and
server for FUM
Blocking of individual disks
non prioritized traffic in FUM
Increase in the number of reserved
channels result in low blocking of
prioritized user request
Optimal value of r
104. Blocking probabilities for
FUM are shown by varying N.
More number of subscribers
(users) lead to higher B. P.
of the disk as well as of the
server.
Fig. 6(a): Blocking of reserve streams by
varying N for FUM
1.E-10
1.E-09
1.E-08
1.E-07
1.E-06
30 31 32 33 34 35 36 37N
blockingprobability
br 1-4
br 5-15
1.E-10
1.E-09
1.E-08
1.E-07
1.E-06
30 31 32 33 34 35 36N
blockingprobability
bq 1-4
q 5-15
b
Fig 6(b): Overall Blocking disks and server of
reserve streams by varying N for FUM
105. Conclusion
The performance of a VoD.
Minimizing the overall blocking probability.
Reserving fixed number of streams for the prioritized users can
considerably minimize there blocking probability.
Optimal value of the number of reserved channels.
The optimal load sharing policy
Optimal Allocation
The total capacity usage
107. Section 1
use of client buffering
to reduce bandwidth requirement
for Video broadcasting over broadband network
which needs a high number of streams for low
user delay
schemes
(JAS), in which a movie is broadcasted in
staggered manner and short unicast streams
are used.
(SBB), which provides a broadcasting
strategy for popular movies.
108. Aim
Our aim in this section is two folds:
(i) analyse and optimize JAS and SSB schemes,
which is appropriate for movies of intermediate
request rate and popular movies
(ii) to achieve minimum server bandwidth.
Traffic
hot
old movies
109. Model Description
the request of a particular file depends on the
popularity of that file.
Video data are distributed
uni streams
multiple streams
which work together to serve Video-streaming
requests from other streams.
110. movie of length Lmin at every Dmax minutes to satisfy the
delay goal.
In scheme-1, the Video
is multicasted in a
staggered manner at
regular offset point of
Ts minutes.
If a request arrives less
than Dmax minutes
before the start of
multicast, it waits till the
start of multicast and
join the stream
otherwise it is served
immediately.
In scheme-2, the server
streams are grouped
into multicast channels.
111. The number of multicast streams is L/Ts.
The distribution f (x) of inter-arrival time is
the number of concurrent unicast stream is
x
exf l
l
)(
dx
T
xxf
N
DsT
s
max
0
)(
112. Buffering Schemes
Join-and-Stream (JAS)
the total number of streams is the sum of the
multicast and unicast streams.
optimal batching
dx
T
ex
N
DsT
s
x
u
max
0
1
l
l
s
m
T
L
N 1
max
DTB s
113. Stream-Bundling Broadcasting (SBB)
For increasing bandwidth with an increment of C
bit/min the server streams are bundled together
so that more customers can serve quickly
the number of streams required is the sum of the
broadcast/multicast streams and the stream in the
bundled channel.
The average bundled streams used is
the total number of streams required
2
1
2
/
max
max
1
max1
s
s
DsT
i
su
D
T
TiDN
2
1
2 max
s
s
s
D
T
T
L
N
115. Section 2
we study the use of client buffering to reduce such
bandwidth requirement.
In a proposed framework, a video will be delivered to
customer through one of two channels,
unicast and multicast,
with Neighbors buffering based Video-on-Demand
(NBB-VoD) architecture.
The two schemes are developed
to select appropriate delivery channel
An adaptive batching scheme
is suggested in which the optimal batching time
is calculated on the basis of arrival rate.
116. Batching Schemes
unicast bandwidth 2 Cbit bandwidth
for multicast transmission customers need Cbit
bandwidth.
batching time
In this policy time is divided into an interval of Wmin
each interval multicast stream is opened.
They will be group together and served by one
multicast group
then bandwidth requirement B for one multicast group
is
))(2()2)((...)2)(2()2(1 bithbitbitbitu
CxLCxCxCxB b
the customer can join the multicast group only when first unicast stream is released
because the multicast stream is started when the first customer joins it.
117. The probability density function f (x)
Unified VoD
In this case, i = 2 and a = 2.
n
i
i
ixii
ii
xexxf 1
1
0,1,)( aal
ala
min
1min
0
1
1
.
)(.
WC
dxxfB
N
bit
W
u
u
1min
0
)())(2()1)((
w
bithbit
dxxfCxLxC bb
118. Multicast Transmission
Multicast streams start transmitting data after
the arrival of first request
the requests with a waiting time x will have
their desired data from upcoming multicast
channel, multicast bandwidth during one slot
of time is given by:
minmin,
min,
1
1
10)(
WxWCL
WxCxL
B
bith
bith
m
min
1min
1min
0
1
)()()(
w
W
bith
w
bithm
dxxfCLdxxfCxLN
119. NBB-VoD
the highest buffering occurs when the user
arrives slightly before the next multicast to
hold one slot time.
For the first request we assign unicast
channel to transmit x time unit for request.
Then the remainder of the video data will be
transmitted via a multicast channel.
120. Unicast Transmission
Thus the required unicast bandwidth is given
the average number of unicast bandwidth
requirement in NBB-VoD
1
0,)1(
min,
2
WxkxC
kxxC
B
bit
bit
u
1min
0
22
)(.
W
uu
dxxfBN
k W
k
bitbit
dxxfxCdxxfxC
0
min
)()(
2
)1(
121. Multicast Transmission
The multicast bandwidth requirements in
case of NBB-VoD are identical with those of
Unified-VoD case
123. Contribution to knowledge
Optimize or fine-tune the telecommunication
infrastructure to increase capacity flexibility
performance without necessarily increasing
cost.
CCN studied will deal with in a wide variety of
applications like remote login, distributed
database systems, parallel computing,
distance education and manufacturing
control etc.
To diagnose and improve the situations that
are creating delay and blocking.