- MPLS can be used to create virtual private networks (VPNs) that provide wide-area connectivity between sites of a large organization through dedicated label switched paths. This gives the appearance of a dedicated network while transmitting through a public or shared MPLS network.
- The integrated services model was developed by IETF to provide different levels of quality of service in the Internet. It uses resource reservation, packet classification, and scheduling to ensure applications receive their requested QoS.
- The Resource Reservation Protocol (RSVP) is used by the integrated services model to signal resource requirements and set up flows with a requested QoS across a network. RSVP uses soft state and receiver-initiated reservations.
Grid monitoring aims to measure and publish the state of distributed computing resources in real-time. Autopilot is an infrastructure that provides real-time adaptive control of distributed resources. It uses sensors to monitor applications and systems, and actuators to control application behavior and sensor operations. The Autopilot manager registers sensors and actuators and allows clients to access resource information.
this ppt is useful for both b.e/b.tech students as well as for mca students. in this ppt u will find different types of security issues in manet and their countermeasures.
RTP and RTCP are protocols used for delivering audio and video over IP networks. RTP carries the media streams, while RTCP monitors transmission quality and aids synchronization. RTCP sends periodic reports containing statistics like packet loss to allow senders to adapt transmission rates. While TCP is not suitable due to retransmissions causing delay, RTP supports features needed for real-time multimedia like sequencing, timestamps, error concealment, and quality of service feedback.
This document discusses Point-to-Point Protocol (PPP), which establishes a direct connection between two nodes over various physical link layers. PPP has several layers and frame types to negotiate options, authenticate users, and encapsulate network layer protocols like IP. It can also bundle multiple physical links together through Multilink PPP for increased bandwidth.
Grid scheduling is a process of mapping Grid jobs to resources over multiple administrative domains.
A Grid job can be split into many small tasks.
The scheduler has the responsibility of selecting resources and scheduling jobs in such a way that the user and application requirements are met,in terms of overall execution time (throughput) and cost of the resources utilized.
Quality of service aims to provide different levels of priority to different applications, users, or data flows. It is achieved through techniques like scheduling, traffic shaping, resource reservation, and admission control. Scheduling methods include FIFO queuing, priority queuing, and weighted fair queuing. Traffic shaping uses leaky bucket and token bucket algorithms. Resource reservation reserves buffer space, bandwidth, and other resources beforehand. Admission control restricts packet admission based on specifications. Models for QoS include the Integrated Services Model, which requires resource reservation in advance using RSVP, and the Differentiated Services Model, which differentiates traffic into classes.
The document discusses the leaky bucket algorithm for traffic shaping. It begins with an introduction to congestion and traffic shaping. It then provides an overview of the leaky bucket algorithm, describing it as a method that converts bursty traffic into fixed-rate traffic by allowing packets to accumulate in a virtual "leaky bucket" at a set rate before entering the network. The document includes an example demonstrating how the algorithm works with different sized packets in a queue. It discusses parameters like burst rate and average rate and describes uses of the algorithm in networks including shaping bursty traffic to a sustained cell flow rate.
Grid monitoring aims to measure and publish the state of distributed computing resources in real-time. Autopilot is an infrastructure that provides real-time adaptive control of distributed resources. It uses sensors to monitor applications and systems, and actuators to control application behavior and sensor operations. The Autopilot manager registers sensors and actuators and allows clients to access resource information.
this ppt is useful for both b.e/b.tech students as well as for mca students. in this ppt u will find different types of security issues in manet and their countermeasures.
RTP and RTCP are protocols used for delivering audio and video over IP networks. RTP carries the media streams, while RTCP monitors transmission quality and aids synchronization. RTCP sends periodic reports containing statistics like packet loss to allow senders to adapt transmission rates. While TCP is not suitable due to retransmissions causing delay, RTP supports features needed for real-time multimedia like sequencing, timestamps, error concealment, and quality of service feedback.
This document discusses Point-to-Point Protocol (PPP), which establishes a direct connection between two nodes over various physical link layers. PPP has several layers and frame types to negotiate options, authenticate users, and encapsulate network layer protocols like IP. It can also bundle multiple physical links together through Multilink PPP for increased bandwidth.
Grid scheduling is a process of mapping Grid jobs to resources over multiple administrative domains.
A Grid job can be split into many small tasks.
The scheduler has the responsibility of selecting resources and scheduling jobs in such a way that the user and application requirements are met,in terms of overall execution time (throughput) and cost of the resources utilized.
Quality of service aims to provide different levels of priority to different applications, users, or data flows. It is achieved through techniques like scheduling, traffic shaping, resource reservation, and admission control. Scheduling methods include FIFO queuing, priority queuing, and weighted fair queuing. Traffic shaping uses leaky bucket and token bucket algorithms. Resource reservation reserves buffer space, bandwidth, and other resources beforehand. Admission control restricts packet admission based on specifications. Models for QoS include the Integrated Services Model, which requires resource reservation in advance using RSVP, and the Differentiated Services Model, which differentiates traffic into classes.
The document discusses the leaky bucket algorithm for traffic shaping. It begins with an introduction to congestion and traffic shaping. It then provides an overview of the leaky bucket algorithm, describing it as a method that converts bursty traffic into fixed-rate traffic by allowing packets to accumulate in a virtual "leaky bucket" at a set rate before entering the network. The document includes an example demonstrating how the algorithm works with different sized packets in a queue. It discusses parameters like burst rate and average rate and describes uses of the algorithm in networks including shaping bursty traffic to a sustained cell flow rate.
The document provides an overview of compilers and interpreters. It discusses how compilers translate source code into target code like machine language while interpreters directly execute source code. It also describes the different stages of compilation from preprocessing to assembly and linking. Key points made include:
- Compilers translate entire programs at once while interpreters translate and execute one line at a time.
- Compilers generate error reports after full translation while interpreters stop at the first error.
- Compilation takes more time than interpretation but executed code runs faster.
- Some languages use hybrid approaches that interpret translated bytecode for faster execution.
- Larger programs are compiled in pieces and linked together with libraries before execution.
The document discusses the medium access control sub layer and various protocols used for channel allocation in computer networks, including ALOHA, carrier sense multiple access, collision-free protocols, and Ethernet. It describes how these protocols handle situations where multiple devices attempt to access shared network resources simultaneously to avoid collisions. Key aspects covered include how the protocols determine which device gets to use the channel, detect collisions, and retransmit frames when collisions occur to maximize throughput.
The document discusses various transport layer protocols for mobile computing environments:
- Traditional TCP faces problems with high error rates and mobility-induced packet losses in wireless networks. It can lead to severe performance degradation.
- Indirect TCP segments the TCP connection and uses a specialized TCP for the wireless link, isolating wireless errors. But it loses end-to-end semantics.
- Snooping TCP buffers packets near the mobile host and performs local retransmissions transparently. But wireless errors can still propagate to the server.
- Mobile TCP splits the connection and uses different mechanisms on each segment. It chokes the sender window during disconnections to avoid retransmissions and slow starts. This maintains throughput during
Aloha protocol in data communication and networkingkritikadas3
ALOHA: ALOHA is a system for coordinating and arbitrating access to a shared communication Networks channel. It was developed in the 1970s by Norman Abramson and his colleagues at the University of Hawaii. The original system used for ground based radio broadcasting, but the system has been implemented in satellite communication systems.
This document discusses radio channels and interfaces in GSM networks. It covers topics like:
- The Um interface between the mobile station and base station subsystem.
- Processing of the voice signal from analog to digital conversion through encoding, interleaving and modulation for transmission.
- The different types of radio channels used including traffic channels, control channels, and their logical and physical combinations in bursts and frames.
- Technologies used for efficient transmission like frequency hopping, discontinuous transmission, and power control.
1. The document discusses network security and provides details about stream ciphers and block ciphers. It explains how each type of cipher works and provides examples of each.
2. Details are given about the Feistel cipher structure and how it provides diffusion and confusion through repeated rounds. The Data Encryption Standard (DES) algorithm is described as a prominent example of a Feistel cipher.
3. Principles of block cipher design are outlined, emphasizing the importance of number of rounds, design of the round function F, and the key schedule algorithm in providing security.
1) The document discusses various transposition ciphers including the rail fence cipher, route cipher, simple columnar transposition, and double transposition cipher. It explains how each cipher works through encrypting and decrypting sample messages.
2) Detection methods for transposition ciphers are also covered, such as frequency analysis and finding anagrams in the ciphertext. Simpler transposition ciphers can be vulnerable to these kinds of cryptanalysis techniques.
3) Genetic algorithms are mentioned as a way for cryptanalysts to find the most likely decryption key through probability calculations.
3G cellular networks aimed to provide higher bandwidth and data rates, global roaming, and support for multimedia services. The ITU defined the IMT-2000 standard to enable these capabilities. Major 3G technologies included W-CDMA, CDMA2000, and UWC-136. Early 3G networks rolled out starting in 2001, with the Japanese and Koreans among the first to offer services meeting IMT-2000 specifications. Key technologies like higher bandwidths, packet switching, coherent modulation, smart antennas, and interference management helped 3G networks provide improved performance over 2G networks.
Its about the need for standard in networking, and caters to IEEE 802 standard in detail. FI you want to listen to this lecture
https://www.youtube.com/watch?v=IVD5sOpA0lc
Pgp-Pretty Good Privacy is the open source freely available tool to encrypt your emails then you can very securely send mails to others over internet without fear of eavesdropping by cryptanalyst.
Lecture 23 27. quality of services in ad hoc wireless networksChandra Meena
The document discusses quality of service (QoS) in mobile ad hoc networks (MANETs). It covers several key topics:
1) The challenges of providing QoS in MANETs due to their dynamic and decentralized nature.
2) Different approaches to QoS classification and provisioning at various network layers. This includes MAC layer solutions like IEEE 802.11e and network layer solutions like QoS-aware routing protocols.
3) Specific QoS routing protocols discussed, including ticket-based, predictive location-based, and trigger-based distributed protocols.
This document discusses network protocol architectures and reference models. It begins by explaining the need for a protocol architecture to break communication tasks into modular layers. It then describes the two main protocol architectures: TCP/IP and the OSI model. The TCP/IP architecture organizes communication into 5 layers - physical, data link, internet, transport, and application. It relies primarily on IP for internet layer functions and TCP and UDP for transport layer functions. The OSI model also divides communication into 7 layers for interoperability between different systems.
Telnet and SSH configuration on ubuntu and windows. this presentation show how we can configure telnet and ssh on windows and linux and what additional software we will have to required.
AMPS was the first-generation analog cellular system developed in the 1970s and 1980s. It used analog FM modulation with 30 kHz channel bandwidths. AMPS was deployed across North America in the early 1980s and introduced cellular communications. However, it had limitations like low capacity and lack of privacy. Successor 2G digital standards like NAMPS and D-AMPS improved capacity but have now been replaced by newer 3G and 4G technologies.
Distributed shared memory (DSM) provides processes with a shared address space across distributed memory systems. DSM exists only virtually through primitives like read and write operations. It gives the illusion of physically shared memory while allowing loosely coupled distributed systems to share memory. DSM refers to applying this shared memory paradigm using distributed memory systems connected by a communication network. Each node has CPUs, memory, and blocks of shared memory can be cached locally but migrated on demand between nodes to maintain consistency.
The document discusses various congestion control algorithms and quality of service techniques used in computer networks. It describes approaches like traffic-aware routing, admission control, traffic throttling, and load shedding to control congestion. It also explains how quality of service is achieved through integrated services, differentiated services, and techniques like traffic shaping, packet scheduling, buffering, and jitter control.
Symmetric and asymmetric key cryptographyMONIRUL ISLAM
The document discusses symmetric and asymmetric key cryptography. It begins with an introduction to cryptography and its objectives of confidentiality, integrity, authentication and non-repudiation. It then explains the differences between symmetric and asymmetric cryptosystems. Symmetric cryptosystems involve a shared key between sender and receiver, while asymmetric cryptosystems use public and private key pairs. Examples of traditional symmetric ciphers like simple substitution and transposition ciphers are provided. The document also outlines the RSA algorithm as an example of asymmetric cryptography and discusses some limitations of both symmetric and asymmetric approaches.
Unit 4 -2 energy management in adhoc wireless networkdevika g
Unit 4 -2 energy management in adhoc wireless network unit 4-2 mobile computing ,classification of energy management transimmission power power management
This document proposes an emerging approach for resource over-provisioning using SDN and NFV in 5G networks. It introduces a SDN control network (SDNC) that is responsible for granting network access, ensuring QoS, and load balancing traffic. The SDNC contains components like a control information repository to store network and session data, service admission control policies to manage resource access, and network resource provisioning to define over-reservation parameters. It describes how the SDNC can dynamically provision end-to-end paths across network operators to support low-latency services while minimizing signaling overhead through integrated resource over-reservation.
This document provides an overview of Quality of Service (QoS) in computer networks. It discusses several key IP QoS mechanisms including resource reservation using RSVP, admission control with bandwidth brokers, packet classification and marking, queuing disciplines like priority queuing and weighted fair queuing, traffic shaping using leaky bucket and token bucket algorithms, and policing. It also describes QoS frameworks like IntServ and DiffServ that systematically apply these mechanisms. Finally, it covers QoS in wireless networks, focusing on support in 802.11 networks and interactions with mobility protocols.
The document provides an overview of compilers and interpreters. It discusses how compilers translate source code into target code like machine language while interpreters directly execute source code. It also describes the different stages of compilation from preprocessing to assembly and linking. Key points made include:
- Compilers translate entire programs at once while interpreters translate and execute one line at a time.
- Compilers generate error reports after full translation while interpreters stop at the first error.
- Compilation takes more time than interpretation but executed code runs faster.
- Some languages use hybrid approaches that interpret translated bytecode for faster execution.
- Larger programs are compiled in pieces and linked together with libraries before execution.
The document discusses the medium access control sub layer and various protocols used for channel allocation in computer networks, including ALOHA, carrier sense multiple access, collision-free protocols, and Ethernet. It describes how these protocols handle situations where multiple devices attempt to access shared network resources simultaneously to avoid collisions. Key aspects covered include how the protocols determine which device gets to use the channel, detect collisions, and retransmit frames when collisions occur to maximize throughput.
The document discusses various transport layer protocols for mobile computing environments:
- Traditional TCP faces problems with high error rates and mobility-induced packet losses in wireless networks. It can lead to severe performance degradation.
- Indirect TCP segments the TCP connection and uses a specialized TCP for the wireless link, isolating wireless errors. But it loses end-to-end semantics.
- Snooping TCP buffers packets near the mobile host and performs local retransmissions transparently. But wireless errors can still propagate to the server.
- Mobile TCP splits the connection and uses different mechanisms on each segment. It chokes the sender window during disconnections to avoid retransmissions and slow starts. This maintains throughput during
Aloha protocol in data communication and networkingkritikadas3
ALOHA: ALOHA is a system for coordinating and arbitrating access to a shared communication Networks channel. It was developed in the 1970s by Norman Abramson and his colleagues at the University of Hawaii. The original system used for ground based radio broadcasting, but the system has been implemented in satellite communication systems.
This document discusses radio channels and interfaces in GSM networks. It covers topics like:
- The Um interface between the mobile station and base station subsystem.
- Processing of the voice signal from analog to digital conversion through encoding, interleaving and modulation for transmission.
- The different types of radio channels used including traffic channels, control channels, and their logical and physical combinations in bursts and frames.
- Technologies used for efficient transmission like frequency hopping, discontinuous transmission, and power control.
1. The document discusses network security and provides details about stream ciphers and block ciphers. It explains how each type of cipher works and provides examples of each.
2. Details are given about the Feistel cipher structure and how it provides diffusion and confusion through repeated rounds. The Data Encryption Standard (DES) algorithm is described as a prominent example of a Feistel cipher.
3. Principles of block cipher design are outlined, emphasizing the importance of number of rounds, design of the round function F, and the key schedule algorithm in providing security.
1) The document discusses various transposition ciphers including the rail fence cipher, route cipher, simple columnar transposition, and double transposition cipher. It explains how each cipher works through encrypting and decrypting sample messages.
2) Detection methods for transposition ciphers are also covered, such as frequency analysis and finding anagrams in the ciphertext. Simpler transposition ciphers can be vulnerable to these kinds of cryptanalysis techniques.
3) Genetic algorithms are mentioned as a way for cryptanalysts to find the most likely decryption key through probability calculations.
3G cellular networks aimed to provide higher bandwidth and data rates, global roaming, and support for multimedia services. The ITU defined the IMT-2000 standard to enable these capabilities. Major 3G technologies included W-CDMA, CDMA2000, and UWC-136. Early 3G networks rolled out starting in 2001, with the Japanese and Koreans among the first to offer services meeting IMT-2000 specifications. Key technologies like higher bandwidths, packet switching, coherent modulation, smart antennas, and interference management helped 3G networks provide improved performance over 2G networks.
Its about the need for standard in networking, and caters to IEEE 802 standard in detail. FI you want to listen to this lecture
https://www.youtube.com/watch?v=IVD5sOpA0lc
Pgp-Pretty Good Privacy is the open source freely available tool to encrypt your emails then you can very securely send mails to others over internet without fear of eavesdropping by cryptanalyst.
Lecture 23 27. quality of services in ad hoc wireless networksChandra Meena
The document discusses quality of service (QoS) in mobile ad hoc networks (MANETs). It covers several key topics:
1) The challenges of providing QoS in MANETs due to their dynamic and decentralized nature.
2) Different approaches to QoS classification and provisioning at various network layers. This includes MAC layer solutions like IEEE 802.11e and network layer solutions like QoS-aware routing protocols.
3) Specific QoS routing protocols discussed, including ticket-based, predictive location-based, and trigger-based distributed protocols.
This document discusses network protocol architectures and reference models. It begins by explaining the need for a protocol architecture to break communication tasks into modular layers. It then describes the two main protocol architectures: TCP/IP and the OSI model. The TCP/IP architecture organizes communication into 5 layers - physical, data link, internet, transport, and application. It relies primarily on IP for internet layer functions and TCP and UDP for transport layer functions. The OSI model also divides communication into 7 layers for interoperability between different systems.
Telnet and SSH configuration on ubuntu and windows. this presentation show how we can configure telnet and ssh on windows and linux and what additional software we will have to required.
AMPS was the first-generation analog cellular system developed in the 1970s and 1980s. It used analog FM modulation with 30 kHz channel bandwidths. AMPS was deployed across North America in the early 1980s and introduced cellular communications. However, it had limitations like low capacity and lack of privacy. Successor 2G digital standards like NAMPS and D-AMPS improved capacity but have now been replaced by newer 3G and 4G technologies.
Distributed shared memory (DSM) provides processes with a shared address space across distributed memory systems. DSM exists only virtually through primitives like read and write operations. It gives the illusion of physically shared memory while allowing loosely coupled distributed systems to share memory. DSM refers to applying this shared memory paradigm using distributed memory systems connected by a communication network. Each node has CPUs, memory, and blocks of shared memory can be cached locally but migrated on demand between nodes to maintain consistency.
The document discusses various congestion control algorithms and quality of service techniques used in computer networks. It describes approaches like traffic-aware routing, admission control, traffic throttling, and load shedding to control congestion. It also explains how quality of service is achieved through integrated services, differentiated services, and techniques like traffic shaping, packet scheduling, buffering, and jitter control.
Symmetric and asymmetric key cryptographyMONIRUL ISLAM
The document discusses symmetric and asymmetric key cryptography. It begins with an introduction to cryptography and its objectives of confidentiality, integrity, authentication and non-repudiation. It then explains the differences between symmetric and asymmetric cryptosystems. Symmetric cryptosystems involve a shared key between sender and receiver, while asymmetric cryptosystems use public and private key pairs. Examples of traditional symmetric ciphers like simple substitution and transposition ciphers are provided. The document also outlines the RSA algorithm as an example of asymmetric cryptography and discusses some limitations of both symmetric and asymmetric approaches.
Unit 4 -2 energy management in adhoc wireless networkdevika g
Unit 4 -2 energy management in adhoc wireless network unit 4-2 mobile computing ,classification of energy management transimmission power power management
This document proposes an emerging approach for resource over-provisioning using SDN and NFV in 5G networks. It introduces a SDN control network (SDNC) that is responsible for granting network access, ensuring QoS, and load balancing traffic. The SDNC contains components like a control information repository to store network and session data, service admission control policies to manage resource access, and network resource provisioning to define over-reservation parameters. It describes how the SDNC can dynamically provision end-to-end paths across network operators to support low-latency services while minimizing signaling overhead through integrated resource over-reservation.
This document provides an overview of Quality of Service (QoS) in computer networks. It discusses several key IP QoS mechanisms including resource reservation using RSVP, admission control with bandwidth brokers, packet classification and marking, queuing disciplines like priority queuing and weighted fair queuing, traffic shaping using leaky bucket and token bucket algorithms, and policing. It also describes QoS frameworks like IntServ and DiffServ that systematically apply these mechanisms. Finally, it covers QoS in wireless networks, focusing on support in 802.11 networks and interactions with mobility protocols.
QOS-BASED PACKET SCHEDULING ALGORITHMS FOR HETEROGENEOUS LTEADVANCED NETWORKS...ijwmn
The number of LTE (Long-Term Evolution) users and their applications has increased significantly in the
last decade, which increased the demand on the mobile network. LTE-Advanced (LTE-A) comes with many
features that can support this increasing demand. LTE-A supports Heterogeneous Networks (HetNets)
deployment, in which it consists of a mix of macro-cells, remote radio heads, and low power nodes such as
Pico-cells, and Femto-cells. Embedding this mix of base-stations in a macro-cellular network allows for
achieving significant gains in coverage, throughput and system capacity compared to the use of macrocells only. These base-stations can operate on the same wireless channel as the macro-cellular network,
which will provide higher spatial reuse via cell splitting. Also, it allows network operators to support
higher data traffic by offloading it to smaller cells, such as Femto-cells. Hence, it enables network
operators to provide their growing number of users with the required Quality of Service (QoS) that meets
with their service demands. In-order for the network operators to make the best out of the heterogeneous
LTE-A network, they need to use QoS-based packet scheduling algorithms that can efficiently manage the
spectrum resources in the HetNets deployment. In this paper, we survey Quality of Service (QoS) based
packet scheduling algorithms that were proposed in the literature for the use of packet scheduling in
Heterogeneous LTE-A Networks. We start by explaining the concepts of QoS in LTE, heterogeneous LTE-A
networks, and how traffic is classified within a packet scheduling architecture for heterogeneous LTE-A
networks. Then, by summarising the proposed QoS-based packet scheduling algorithms in the literature for
Heterogeneous LTE-A Networks, and for Femtocells LTE-A Networks. And finally, we provide some
concluding remarks in the last section.
QoS-based Packet Scheduling Algorithms for Heterogeneous LTE-Advanced Network...ijwmn
The number of LTE (Long-Term Evolution) users and their applications has increased significantly in the last decade, which increased the demand on the mobile network. LTE-Advanced (LTE-A) comes with many features that can support this increasing demand. LTE-A supports Heterogeneous Networks (HetNets) deployment, in which it consists of a mix of macro-cells, remote radio heads, and low power nodes such as Pico-cells, and Femto-cells. Embedding this mix of base-stations in a macro-cellular network allows for achieving significant gains in coverage, throughput and system capacity compared to the use of macrocells only. These base-stations can operate on the same wireless channel as the macro-cellular network, which will provide higher spatial reuse via cell splitting. Also, it allows network operators to support higher data traffic by offloading it to smaller cells, such as Femto-cells. Hence, it enables network operators to provide their growing number of users with the required Quality of Service (QoS) that meets with their service demands. In-order for the network operators to make the best out of the heterogeneous LTE-A network, they need to use QoS-based packet scheduling algorithms that can efficiently manage the spectrum resources in the HetNets deployment. In this paper, we survey Quality of Service (QoS) based packet scheduling algorithms that were proposed in the literature for the use of packet scheduling in Heterogeneous LTE-A Networks. We start by explaining the concepts of QoS in LTE, heterogeneous LTE-A networks, and how traffic is classified within a packet scheduling architecture for heterogeneous LTE-A networks. Then, by summarising the proposed QoS-based packet scheduling algorithms in the literature for Heterogeneous LTE-A Networks, and for Femtocells LTE-A Networks. And finally, we provide some concluding remarks in the last section.
Our approach in this thesis is that, we have designed and built a National Carrier based core and edge network to simulate a real live scenario that spans the kingdom of Saudi Arabia. Some of the results in the thesis are presented against simulation time and some against network load.how to implement mpls on network
Two-level scheduling scheme for integrated 4G-WLAN network IJECEIAES
In this paper, a novel scheduling scheme for the Fourth Generation (4G)-Wireless Local Area Network (WLAN) network is proposed to ensure that end to end traffic transaction is provisioned seamlessly. The scheduling scheme is divided into two stages; in stage one, traffic is separated into Actual Time Traffic (ATT) and Non-Actual-Time Traffic (NATT), while in stage two, complex queuing strategy is performed. In stage one, Class-Based Queuing (CBQ) and Deficit Round Robin(DRR) are used for NATT and ATT applications, respectively to separate and forward traffic themselves according to source requirements. Whereas in the stage, two Control Priority Queuing (CPQ) is used to assign each class the appropriate priority level. Evaluation of the performance of the integrated network was done according to several metrics such as end-to-end delay, jitter, packet loss, and network’s throughput. Results demonstrate major improvements for AT services with minor degradation on NAT applications after implementing the new scheduling scheme.
The document discusses QoS models and implementation techniques. It describes IntServ and DiffServ models, with IntServ providing guaranteed service but limited scalability, and DiffServ providing "almost guaranteed" service while being more scalable. It then covers classification and marking tools, congestion avoidance/management tools, and techniques like traffic shaping, policing, queueing strategies, and trust boundaries.
The document discusses QoS models and implementation techniques. It describes IntServ and DiffServ models, with IntServ providing guaranteed service but limited scalability, and DiffServ providing "almost guaranteed" service while being more scalable. It also covers classification and marking tools, congestion avoidance/management tools, and techniques for traffic marking including using VLAN, IPv4 ToS, IPv6 traffic class, and DiffServ code points.
NETWORK PERFORMANCE EVALUATION WITH REAL TIME APPLICATION ENSURING QUALITY OF...ijngnjournal
The quality of service is a need in recent computer network developments. The present paper evaluates some characteristics in a proposed network topology such as dropped packets and bandwidth use, using two traffic sources, firstly a VoIP source over an UDP agent, then a CBR traffic source over an UDP agent as well as the previous one. Two possible configurations are proposed, implementing both of them in the Network Simulator, and implementing in one of them differentiated services to compare the results. Statistics results are shown, in both cases showing the accumulative dropped packet number and the throughput in the link, obtaining a reducer number of dropped packets in the stage with differentiated services, and an improvement in the bandwidth use.
This document provides an overview of quality of service (QoS) technologies for computer networks. It discusses two main QoS frameworks: Differentiated Services, which classifies traffic into groups and handles each group differently without resource reservation; and Integrated Services, which involves reserving resources for each session to guarantee performance levels. The document also compares the two frameworks and their approaches to service type, service scope, complexity, and scalability.
Assessing Buffering with Scheduling Schemes in a QoS Internet RouterIOSR Journals
This document examines different scheduling algorithms that could be used with RIO-C penalty enforcement buffering in a multi-queue QoS router to improve network performance. It simulates priority, round robin, and weighted round robin scheduling with RIO-C buffering. The results show that priority scheduling achieved the lowest loss rates, with 29.46% scheduler drop rate and 14.95% RED loss rate. Round robin was second with 29.53% and 10.50% losses. Weighted round robin was third with 30.28% and 3.04% losses. The document concludes that a network seeking quality of service could adopt priority scheduling with RIO-C admission control.
The follow list restates these 3 fundamental levels of service for Q.pdfshanki7
The follow list restates these 3 fundamental levels of service for QoS:
Best-effort service: the normal type of connectivity without some guarantee. This kind of
service, in orientation to Catalyst switch, use first-in first-out queue, which only transmit packet
as they get there in a line with no special treatment.
Integrated services: IntServ, also known as solid QoS, is a complete condition of services. In
additional terms, the IntServ model implies that traffic flow is kept openly by all midway system
and possessions.
Differentiated services—DiffServ, also known as flexible QoS, is class base, where a few
module of traffic obtain special behavior more additional traffic classes. differentiate services
use arithmetical preference, not a hard assurance like incorporated services. In additional terms,
DiffServ categorize traffic and then sort it into line of different efficiencies.
The IntServ model, distinct in RFC 1633, guarantees a unsurprising performance of the
association for application. IntServ give several services that accommodate several QoS
necessities. IntServ is implementing throughout the use of the supply Reservation Protocol,
enable at together the endpoints and the net devices connecting. This enabled application needs
an exact type of service from this enabled system previous to it send information. Open signal
via RSVP make the appeal, and the request inform the network of its traffic report and needs a
exacting type of service that can include its bandwidth and holdup necessities. The application is
predictable to send information only following it gets verification as of the network. The network
as well expect the application to propel information that deceit in it’s describe traffic profile
IntServ follow the signaled QoS form where the end hosts sign their QoS necessities to the
system. Each individual message stream wants to request capital from the network. Rim routers
utilize the Resource Reservation Protocol to indicator and keep the pet bandwidth for every flood
in the network.
The DiffServ model provides several levels of examine that convince differing QoS necessities.
Though, different with the IntServ model, an request that use DiffServ do not plainly signal the
network strategy before transfer information. DiffServ is a QoS completion method that is
modified for current networks and their explanation. DiffServ reassigns bit in the kind of service
pasture of an IP packet title. DiffServ use differentiates services code points as the QoS main
concern descriptor importance and supports 64 stage of categorization
For example, VoIP require extremely small jitter, a one way holdup in the arrange of 150 ms
plus certain bandwidth in the range of 8Kbps to 64Kbps, needy on the codec use. In one more
example, a case move request, base on ftp, do not undergo from jitter, as packet failure will be
extremely damaging to the throughput.
Solution
The follow list restates these 3 fundamental levels of service for QoS:
Best-e.
Four issues must be addressed to ensure quality of service:
Application Requirements.
Traffic shaping.
Packet scheduling.
Admission control.
Versions of quality of service for the Internet:
Integrated Services.
Differentiated Services.
This document provides an overview of quality of service (QoS) frameworks for the Internet, including Integrated Services, RSVP, Differentiated Services, MPLS, Traffic Engineering, and Constraint Based Routing. It describes what each component is, how they relate to and work with each other, and presents two potential service architectures for delivering end-to-end QoS. The goal is to give readers a comprehensive understanding of the emerging Internet QoS framework.
This document discusses RSVP and differentiated services (DS) network models. It provides details on:
1) RSVP uses objects like INTEGRITY, SCOPE, and RESV_CONFIRM carried in messages to establish and maintain reservations. Messages include a common header followed by objects.
2) The DS model aggregates traffic by service level agreements rather than per-flow reservations. Packets are marked with DS field codepoints to receive different per-hop behaviors like expedited forwarding or assured forwarding.
3) DS routers classify and condition traffic at ingress based on DS fields and traffic agreements. Core routers provide behaviors like low latency for expedited forwarding or high assurance delivery for assured forwarding traffic within configured rates.
This document summarizes and evaluates scheduling algorithms for wireless IP networks that support multiclass traffic. It begins by describing the challenges of providing quality of service (QoS) over wireless networks due to time-varying transmission quality and location-dependent errors. It then reviews existing scheduling algorithms like weighted fair queuing (WFQ) and discusses their limitations in wireless environments. The document proposes a new scheduling mechanism that differentiates service between traffic classes and subclasses, allows compensation for non-real time traffic, and adjusts weights of real-time flows in error states to maintain throughput. Overall, the scheduling algorithm aims to provide QoS, fairness between flows, and flexibility to adapt to changing wireless channel conditions.
The document discusses policy and charging control (PCC) procedures in mobile data networks. PCC allows mobile providers to guarantee bandwidth for high revenue services, allow market segmentation, ensure fair network usage, and optimize the end user experience. It discusses how PCC uses policy and charging rules to identify and authorize IP traffic flows based on source/destination addresses and ports. PCC supports online and offline charging methods to appropriately charge service flows based on user subscriptions.
Dynamic Routing for Data Integrity and Delay Differentiated Services in Wirel...1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
The International Journal of Engineering and Science (The IJES)theijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
This document discusses quality of service (QoS) techniques for prioritizing different types of network traffic such as voice over IP. It describes several QoS mechanisms including weighted fair queuing, priority queuing, class-based weighted fair queuing, IP precedence, policy routing, and resource reservation protocol. These mechanisms allow administrators to classify and manage network traffic to ensure sufficient bandwidth and latency for applications like VoIP that have sensitive network requirements.
Similar to Integrated services and RSVP - Protocol (20)
The document outlines the steps for implementing an ERP system, including identifying problems, defining the scope and team, customizing the system, managing change, and testing before going live. It also lists the life cycle steps of selecting a package, planning the project, analyzing gaps, re-engineering processes, providing training, testing, applying the system, and ongoing maintenance.
Electronic customer relationship management (e crm)Pradnya Saval
Electronic customer relationship management (E-CRM) uses internet technologies like email, websites and chatrooms to achieve customer relationship management goals. It automates marketing, sales and customer service processes through collecting customer data. E-CRM provides benefits like improved customer service, productivity and satisfaction by allowing personalized interactions and insights through a consolidated customer database. However, it also faces disadvantages such as security issues and over-reliance on systems reducing human interactions.
A data warehouse is a database that collects and manages data from various sources to provide business insights. It contains consolidated historical data kept separately from operational databases. A data warehouse helps executives analyze data to make strategic decisions. Data mining extracts valuable patterns and knowledge from large amounts of data through techniques like classification, clustering, and neural networks. It is used along with data warehouses for applications like churn analysis, fraud detection, and market segmentation.
An ERP system is an enterprise-wide software that coordinates resources, activities, and information needed to complete business processes. It has modules for human resources, supply chain management, customer relationship management, finance, and manufacturing. ERP architecture is organized into three layers - the data tier focuses on data structure, the business tier includes business logic and user interaction, and the presentation tier is the user interface. ERP systems can use two-tier, three-tier client/server, web-based, or oriented architectures. The logical architecture separates components while the physical focuses on efficiency. ERP features include separation of code and data and modules for business functions, sales, production, materials, finance, and personnel.
The document discusses several major functional systems of organizations, including marketing and sales, finance and accounting, manufacturing/production/inventory, and human resources. It provides details on the components and functions of marketing information systems, such as types of marketing information and the marketing information system model. It also describes the roles and sub-systems of other functional areas like finance and accounting, manufacturing, and human resources.
Supply chain management involves the management of the flow of goods and services from raw materials to final products being delivered to customers. It provides advantages like efficiency, reduced costs and inventory, just-in-time delivery, and increased revenue. The components of an e-supply chain management system include planning, information, sourcing, inventory, production, location, transportation, and return of goods. The architecture of an e-supply chain involves internal operations, inter-organizational operations through shared visions and process modeling, and inter-organizational technologies like integration and networking. Trends in supply chain management include warehouse robotics, autonomous transportation, blurred lines with technology services, and an emphasis on social responsibility.
Knowledge Process Outsourcing (KPO) involves outsourcing knowledge-based activities like research, analytics and business processes to countries like India. KPO is a subset of Business Process Outsourcing (BPO) that also includes other types of outsourcing like Creative, Legal, Recruitment, Human Resources, IT, and Medical outsourcing. A study by NASSCOM projects growth in KPO opportunities in areas like IT, web services, legal and finance processes through both traditional outsourcing and cloud computing models.
The document discusses several major ERP software systems - SAP ERP, Oracle Apps, Microsoft Dynamics NAV, and PeopleSoft. It provides overview information on each software, describing what they are used for and some of their key modules. The major ERP software systems are designed to integrate various business operations like finance, supply chain management, human resources, and customer relationship management.
DBMS stands for Database Management System. A DBMS allows for the storage and management of data in an organized manner. It uses tables to store data with rows and columns, where each row represents a record or tuple of data. Entities, attributes, keys, and relationships help define the structure and integrity of data within the database. The three schema architecture separates the physical storage, logical design, and external user views to provide data independence and abstraction between different levels.
Recurrent neural networks (RNNs) and convolutional neural networks (CNNs) are two common types of deep neural networks. RNNs include feedback connections so they can learn from sequence data like text, while CNNs are useful for visual data due to their translation invariance from pooling and convolutional layers. The document provides examples of applying RNNs and CNNs to tasks like sentiment analysis, image classification, and machine translation. It also discusses common CNN architecture components like convolutional layers, activation functions like ReLU, pooling layers, and fully connected layers.
The document discusses the Integrated Services model which reserves resources like bandwidth and buffers for data flows to ensure requested quality of service (QoS). It requires packet classifiers, schedulers, admission control using the Resource Reservation Protocol, and flow descriptors. The model provides two services: Guaranteed Services which gives a firm delay bound using token bucket algorithms; and Controlled Load Services which tolerates delay but prevents overload for adaptive applications.
This document provides an overview of ATM (Asynchronous Transfer Mode) technology. It discusses the basic concepts of circuit switching, packet switching, and virtual circuit approaches. It then describes ATM including that it is connection-oriented, uses fixed size 53 byte cells, and operates at speeds of 155Mbps or 622Mbps. It outlines the ATM layers including the physical layer, ATM layer, ATM adaptation layer, and upper layers. It also discusses AAL types and the advantages of ATM in supporting different traffic types and efficient bandwidth usage.
Data Communication and Optical Network Pradnya Saval
Defining Data Communication needs, Transmission Hierarchy, Optical Networks: SONET/SDH standard, Architecture, Format, Hardware, Configuration, advantages
Data Communications and Optical Network - ForouzanPradnya Saval
Defining Data Communication needs, Transmission Hierarchy
Optical Networks: SONET/SDH standard, Architecture, Format, Hardware, Configuration, advantages
Introduction to TCP/IP: Issues in IPV4, IPV6 protocol
Mature Packet Switching Protocols:ITU Recommendation X.25, User Connectivity, Theory of Operations, Network Layer Functions, X.75 Internetworking Protocol, Advantages and
Drawbacks
Protocols and Interfaces - IPv4, IPv6, X.25, X.75Pradnya Saval
Introduction to TCP/IP: Issues in IPV4, IPV6 protocol, Mature Packet Switching Protocols: ITU Recommendation X.25, User Connectivity, Theory of Operations, Network Layer Functions, X.75 Internetworking Protocol, Advantages and Drawbacks
X.75 is an ITU-T protocol that defines how to interconnect multiple private X.25 packet switching data networks, allowing them to share resources and data across international and multiprovider areas by connecting backbone packet switches and translating addresses between networks. It supports multilink procedures between signaling terminal exchanges to facilitate communication between devices in separate X.25 networks located in different countries, like the US and UK, with the X.75 link being transparent to the end users.
Theory of operations - Mature Packet Switching ProtocolsPradnya Saval
This document discusses the theory of operations for packet switching networks. It describes traffic characteristics such as bursty traffic that is delay-insensitive and asymmetrical, making it well-suited for packet switching. The document then explains the basic operation of X.25 packet switching, where data is divided into packets and routed through a network of nodes before being reassembled. Each node acts as a data circuit-terminating equipment and routes packets based on its routing table while performing error checking and retransmission.
User connectivity - Mature Packet Switching ProtocolsPradnya Saval
X.25 defines link-level protocols that allow asynchronous terminals to connect to packet switching networks via low-speed connections. It provides both asynchronous and synchronous user connectivity options. Specifically, ITU-T Recommendations X.3, X.28 and X.29 define the interface protocols for asynchronous terminal connections, while X.22 defines synchronous dial-up connectivity for DTE services.
Harnessing WebAssembly for Real-time Stateless Streaming PipelinesChristina Lin
Traditionally, dealing with real-time data pipelines has involved significant overhead, even for straightforward tasks like data transformation or masking. However, in this talk, we’ll venture into the dynamic realm of WebAssembly (WASM) and discover how it can revolutionize the creation of stateless streaming pipelines within a Kafka (Redpanda) broker. These pipelines are adept at managing low-latency, high-data-volume scenarios.
International Conference on NLP, Artificial Intelligence, Machine Learning an...gerogepatton
International Conference on NLP, Artificial Intelligence, Machine Learning and Applications (NLAIM 2024) offers a premier global platform for exchanging insights and findings in the theory, methodology, and applications of NLP, Artificial Intelligence, Machine Learning, and their applications. The conference seeks substantial contributions across all key domains of NLP, Artificial Intelligence, Machine Learning, and their practical applications, aiming to foster both theoretical advancements and real-world implementations. With a focus on facilitating collaboration between researchers and practitioners from academia and industry, the conference serves as a nexus for sharing the latest developments in the field.
A SYSTEMATIC RISK ASSESSMENT APPROACH FOR SECURING THE SMART IRRIGATION SYSTEMSIJNSA Journal
The smart irrigation system represents an innovative approach to optimize water usage in agricultural and landscaping practices. The integration of cutting-edge technologies, including sensors, actuators, and data analysis, empowers this system to provide accurate monitoring and control of irrigation processes by leveraging real-time environmental conditions. The main objective of a smart irrigation system is to optimize water efficiency, minimize expenses, and foster the adoption of sustainable water management methods. This paper conducts a systematic risk assessment by exploring the key components/assets and their functionalities in the smart irrigation system. The crucial role of sensors in gathering data on soil moisture, weather patterns, and plant well-being is emphasized in this system. These sensors enable intelligent decision-making in irrigation scheduling and water distribution, leading to enhanced water efficiency and sustainable water management practices. Actuators enable automated control of irrigation devices, ensuring precise and targeted water delivery to plants. Additionally, the paper addresses the potential threat and vulnerabilities associated with smart irrigation systems. It discusses limitations of the system, such as power constraints and computational capabilities, and calculates the potential security risks. The paper suggests possible risk treatment methods for effective secure system operation. In conclusion, the paper emphasizes the significant benefits of implementing smart irrigation systems, including improved water conservation, increased crop yield, and reduced environmental impact. Additionally, based on the security analysis conducted, the paper recommends the implementation of countermeasures and security approaches to address vulnerabilities and ensure the integrity and reliability of the system. By incorporating these measures, smart irrigation technology can revolutionize water management practices in agriculture, promoting sustainability, resource efficiency, and safeguarding against potential security threats.
CHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECTjpsjournal1
The rivalry between prominent international actors for dominance over Central Asia's hydrocarbon
reserves and the ancient silk trade route, along with China's diplomatic endeavours in the area, has been
referred to as the "New Great Game." This research centres on the power struggle, considering
geopolitical, geostrategic, and geoeconomic variables. Topics including trade, political hegemony, oil
politics, and conventional and nontraditional security are all explored and explained by the researcher.
Using Mackinder's Heartland, Spykman Rimland, and Hegemonic Stability theories, examines China's role
in Central Asia. This study adheres to the empirical epistemological method and has taken care of
objectivity. This study analyze primary and secondary research documents critically to elaborate role of
china’s geo economic outreach in central Asian countries and its future prospect. China is thriving in trade,
pipeline politics, and winning states, according to this study, thanks to important instruments like the
Shanghai Cooperation Organisation and the Belt and Road Economic Initiative. According to this study,
China is seeing significant success in commerce, pipeline politics, and gaining influence on other
governments. This success may be attributed to the effective utilisation of key tools such as the Shanghai
Cooperation Organisation and the Belt and Road Economic Initiative.
ACEP Magazine edition 4th launched on 05.06.2024Rahul
This document provides information about the third edition of the magazine "Sthapatya" published by the Association of Civil Engineers (Practicing) Aurangabad. It includes messages from current and past presidents of ACEP, memories and photos from past ACEP events, information on life time achievement awards given by ACEP, and a technical article on concrete maintenance, repairs and strengthening. The document highlights activities of ACEP and provides a technical educational article for members.
Low power architecture of logic gates using adiabatic techniquesnooriasukmaningtyas
The growing significance of portable systems to limit power consumption in ultra-large-scale-integration chips of very high density, has recently led to rapid and inventive progresses in low-power design. The most effective technique is adiabatic logic circuit design in energy-efficient hardware. This paper presents two adiabatic approaches for the design of low power circuits, modified positive feedback adiabatic logic (modified PFAL) and the other is direct current diode based positive feedback adiabatic logic (DC-DB PFAL). Logic gates are the preliminary components in any digital circuit design. By improving the performance of basic gates, one can improvise the whole system performance. In this paper proposed circuit design of the low power architecture of OR/NOR, AND/NAND, and XOR/XNOR gates are presented using the said approaches and their results are analyzed for powerdissipation, delay, power-delay-product and rise time and compared with the other adiabatic techniques along with the conventional complementary metal oxide semiconductor (CMOS) designs reported in the literature. It has been found that the designs with DC-DB PFAL technique outperform with the percentage improvement of 65% for NOR gate and 7% for NAND gate and 34% for XNOR gate over the modified PFAL techniques at 10 MHz respectively.
Embedded machine learning-based road conditions and driving behavior monitoringIJECEIAES
Car accident rates have increased in recent years, resulting in losses in human lives, properties, and other financial costs. An embedded machine learning-based system is developed to address this critical issue. The system can monitor road conditions, detect driving patterns, and identify aggressive driving behaviors. The system is based on neural networks trained on a comprehensive dataset of driving events, driving styles, and road conditions. The system effectively detects potential risks and helps mitigate the frequency and impact of accidents. The primary goal is to ensure the safety of drivers and vehicles. Collecting data involved gathering information on three key road events: normal street and normal drive, speed bumps, circular yellow speed bumps, and three aggressive driving actions: sudden start, sudden stop, and sudden entry. The gathered data is processed and analyzed using a machine learning system designed for limited power and memory devices. The developed system resulted in 91.9% accuracy, 93.6% precision, and 92% recall. The achieved inference time on an Arduino Nano 33 BLE Sense with a 32-bit CPU running at 64 MHz is 34 ms and requires 2.6 kB peak RAM and 139.9 kB program flash memory, making it suitable for resource-constrained embedded systems.
1. con®gure a separate LSP to carry each class of traf®c between each pair of edge
LSRs. A more practical solution is to merge LSPs of the same traf®c class to
obtain multipoint-to-point ¯ows that are rooted at an egress LSR. The LSRs
serving each of these ¯ows would be con®gured to provide the desired levels of
performance to each traf®c class.
MPLS can also be used to create Virtual Private Networks (VPNs). A VPN
provides wide-area-connectivity to a large multilocation organization. MPLS
can provide connectivity between VPN sites through LSPs that are dedicated
to the given VPN. The LSPs can be used to exchange routing information
between the various VPN sites, transparently to other users of the MPLS net-
work, thus giving the appearance of a dedicated wide area network. VPNs
involve many security issues related to ensuring privacy in the public or shared
portion of a network. These issues are discussed in Chapter 11.
10.4 INTEGRATED SERVICES IN THE INTERNET
Traditionally, the Internet has provided best-effort service to every user regard-
less of its requirements. Because every user receives the same level of service,
congestion in the network often results in serious degradation for applications
that require some minimum amount of bandwidth to function propertly. As the
Internet becomes universally available, there is also interest in providing real-
time service delivery to applications such as IP telephony. Thus an interest has
developed in having the Internet provide some degree of QoS.
To provide different QoS commitments, the IETF developed the integrated
services model that requires resources such as bandwidth and buffers to be expli-
citly reserved for a given data ¯ow to ensure that the application receives its
requested QoS. The model requires the use of packet classi®ers to identify ¯ows
that are to receive a certain level of service as shown in Figure 10.18. It also
requires the use of packet schedulers to handle the forwarding of different packet
¯ows in a manner that ensures that QoS commitments are met. Admission control
is also required to determine whether a router has the necessary resources to
accept a new ¯ow. Thus the integrated services model is analogous to the ATM
model where admission control coupled with policing are used to provide QoS to
individual applications.
The Resource Reservation Protocol (RSVP), which is discussed later in the
chapter, is used by the integrated services model to provide the reservation
messages required to set up a ¯ow with a requested QoS across the network.
RSVP is used to inform each router of the requested QoS, and if the ¯ow is found
admissible, each router in turn adjusts its packet classi®er and scheduler to
handle the given packet ¯ow.
A ¯ow descriptor is used to describe the traf®c and QoS requirements of a
¯ow. The ¯ow descriptor consists of two parts: a ®lter speci®cation (®lterspec)
and a ¯ow speci®cation (¯owspec). The ®lterspec provides the information
10.4 Integrated Services in the Internet 693
| | | Textbook Table of Contentse-Text Main Menu
v
v
2. required by the packet classi®er to identify the packets that belong to the ¯ow.
The ¯owspec consists of a traf®c speci®cation (Tspec) and a service request
speci®cation (Rspec). The Tspec speci®es the traf®c behavior of the ¯ow in
terms of a token bucket as discussed in Chapter 7. The Rspec speci®es the
requested QoS in terms of bandwidth, packet delay, or packet loss.
The integrated services model introduces two new services: guaranteed ser-
vice and controlled-load service.
10.4.1 Guaranteed Service
The guaranteed service in the Internet can be used for applications that require
real-time service delivery. For this type of application, data that is delivered to
the application after a certain time is generally considered worthless. Thus guar-
anteed service has been designed to provide a ®rm bound on the end-to-end
packet delay for a ¯ow. How does guaranteed service provide a ®rm delay
bound?
Recall that from Chapter 7, if a ¯ow is shaped by a …b; r† token bucket and is
guaranteed to receive at least R bits/second, then the delay experienced by the
¯ow will be bounded by b=R with a ¯uid ¯ow model, assuming that R > r. This
delay bound has to be adjusted by error terms accounting for the deviation from
the ¯uid ¯ow model in the actual router or switch.
To support guaranteed service, each router must know the traf®c character-
istics of the ¯ow and the desired service. Based on this information, the router
uses admission control to determine whether a new ¯ow should be accepted.
Once a new ¯ow is accepted, the router should police the ¯ow to ensure com-
pliance with the promised traf®c characteristics.
694 CHAPTER 10 Advanced Network Architectures
Routing
agent
Reservation
agent
Admission
control
Traffic control databaseRouting database
Classifier
Input
driver
Internet
forwarder Output driver
Packet scheduler
Management
agent
FIGURE 10.18 Router model in integrated services IP
| | | Textbook Table of Contentse-Text Main Menu
v
v
3. 10.4.2 Controlled-Load Service
The controlled-load service is intended for adaptive applications that can tolerate
some delay but that are sensitive to traf®c overload conditions. These applica-
tions typically perform satisfactorily when the network is lightly loaded but
degrade signi®cantly when the network is heavily loaded. Thus the controlled-
load service was designed to provide approximately the same service as the best-
effort service in a lightly loaded network regardless of the actual network con-
dition. The above interpretation is deliberately imprecise for a reason. Unlike the
guaranteed service that speci®es a quantitative guarantee, the controlled-load
service is qualitative in the sense that no target values on delay or loss are
speci®ed. However, an application requesting a controlled-load service can
expect low queueing delay and low packet loss, which is a typical behavior of
a statistical multiplexer that is not congested. Because of these loose de®nitions
of delay and loss, the controlled-load service requires less implementation com-
plexity than the guaranteed service requires. For example, the controlled-load
service does not require the router to implement the weighted fair queueing
algorithm.
As in the guaranteed service, an application requesting a controlled-load
service has to provide the network with the token bucket speci®cation of its
¯ow. The network uses admission control and policing to ensure that enough
resources are available for the ¯ow. Flows that conform to the token bucket
speci®cation should be served with low delay and low loss. Flows that are non-
conforming should be treated as best-effort service.
10.5 RSVP
The resource ReSerVation Protocol (RSVP) was designed as an IP signaling
protocol for the integrated services model. RSVP can be used by a host to
request a speci®c QoS resource for a particular ¯ow and by a router to provide
the requested QoS along the path(s) by setting up appropriate states.6
Because IP traditionally did not have any signaling protocol, the RSVP
designers had the liberty of constructing the protocol from scratch. RSVP has
the following features:
Performs resource reservations for unicast and multicast (multipoint-to-multi-
point) applications, adapting dynamically to changing group membership and
changing routes.
10.5 RSVP 695
6
RSVP can be extended for use in other situations. For example RSVP has been proposed to reserve
resources and install state related to forwarding in MPLS [RFC 2430].
| | | Textbook Table of Contentse-Text Main Menu
v
v
4. Requests resource in one direction from a sender to a receiver (i.e., a simplex
resource reservation). Bidirectional resource reservation requires both end
systems to initiate separate reservations.
Requires the receiver to initiate and maintain the resource reservation.
Maintains soft state at each intermediate router: A resource reservation at a
router is maintained for a limited time only, and so the sender must periodi-
cally refresh its reservation.
Does not require each router to be RSVP capable. Non-RSVP-capable routers
use a best-effort delivery technique.
Provides different reservation styles so that requests may be merged in several
ways according to the applications.
Supports both IPv4 and IPv6.
To enable resource reservations an RSVP process (or daemon) in each node
has to interact with other modules, as shown in Figure 10.19. If the node is a
host, then the application requiring a QoS delivery service ®rst has to make a
request to an RSVP process that in turn passes RSVP messages from one node to
another. Each RSVP process passes control to its two local control modules:
policy control and admission control. The policy control determines whether the
application is allowed to make the reservation. Relevant issues to be determined
include authentication, accounting, and access control. The admission control
determines whether the node has suf®cient resources to satisfy the requested
QoS. If both tests succeed, parameters are set in the classi®er and packet sche-
duler to exercise the reservation. If one of the tests fails at any node, an error
noti®cation is returned to the originated application.
In RSVP parlance a session is de®ned to be a data ¯ow identi®ed by its
destination. Speci®cally, an RSVP session is de®ned by its destination IP address,
IP protocol number, and optionally destination port. The destination IP address
can be unicast or multicast. The optional destination port may be speci®ed by a
696 CHAPTER 10 Advanced Network Architectures
Host Router
RSVP
process
Packet
scheduler
ClassifierClassifier
Application
Admission
control
DataData
Data
RSVP
Policy
control
RSVP
process
Packet
scheduler
Admission
control
Policy
control
Routing
process
FIGURE 10.19 RSVP architecture
| | | Textbook Table of Contentse-Text Main Menu
v
v
5. TCP or UDP port number. When the destination address is multicast, it is not
necessary to include the destination port, since different applications typically
use different multicast addresses. For multicast transmission, there may be multi-
ple senders and multiple destinations in a group. For unicast transmission, there
may be multiple senders but one destination.
An RSVP reservation request consists of a ¯owspec and a ®lterspec. The
¯owspec is used to set parameters in the node's packet scheduler. Generally,
the parameters include a service class, an Rspec (R for reserve) that de®nes
the requested QoS, and a Tspec (T for traf®c) that describes the sender's traf®c
characteristics. The ®lterspec speci®es the set of packets that can use the reserva-
tion in a given session and is used to set parameters in the packet classi®er. The
set of packets is typically de®ned in terms of sender IP address and sender port.
10.5.1 Receiver-Initiated Reservation
RSVP adopts the receiver-initiated reservation principle, meaning that the recei-
ver rather than the sender initiates the resource reservation. This principle is
similar in spirit to many multicast routing algorithms where each receiver joins
and leaves the multicast group independently without affecting other receivers in
the group. The main motivation for adopting this principle is that RSVP is
primarily designed to support multiparty conferencing with heterogeneous recei-
vers. In this environment the receiver actually knows how much bandwidth it
needs. If the sender were to make the reservation request, then the sender must
obtain the bandwidth requirement from each receiver. This process may cause an
implosion problem for large multicast groups.
One problem with the receiver-initiated reservation is that the receiver does
not directly know the path taken by data packets. RSVP solves this by introdu-
cing Path messages that originate from the sender and travel along the unicast/
multicast routes toward the receiver(s). The main purposes of the Path message
are to store the ``path state'' in each node along the path and to carry informa-
tion regarding the sender's traf®c characteristics and the end-to-end path proper-
ties. The path state includes the unicast IP address of the previous RSVP-capable
node. The Path message contains the following information:
Phop: The address of the previous-hop RSVP-capable node that forwards the
Path message.
Sender template: The sender IP address and optionally the sender port.
Sender Tspec: The sender's traf®c characteristics.
Adspec: Information used to advertise the end-to-end path to receivers. The
contents of the Adspec may be updated by each router along the path.
Upon receiving the Path message, the receiver sends Resv messages in a
unicast fashion toward the sender along the reverse path that the data packets
use. A Resv message carries reservation requests to the routers along the path.
Figure 10.20 illustrates the traces of Path and Resv messages. When sender S
has data to send to receiver Rx, S sends Path messages periodically toward Rx
10.5 RSVP 697
| | | Textbook Table of Contentse-Text Main Menu
v
v
6. along the path determined by the routing protocol. The nodes that receive the
Path message record the state of the path. When Rx receives a Path message, Rx
can begin installing the reservation by sending a Resv message along the reverse
path. The IP destination address of a Resv message is the unicast address of a
previous-hop node, obtained from the path state. RSVP messages are sent as
``raw'' IP datagrams with protocol 46. However, it is also possible to encapsulate
RSVP messages as UDP messages for hosts that don't support the raw I/O
capability.
10.5.2 Reservation Merging
When there are multiple receivers, the resource is not reserved for each receiver
but is shared up to the point where the paths to different receivers diverge. From
the receiver's point of view, RSVP merges the reservation requests from different
receivers at the point where multiple requests converge. When a reservation
request propagates upstream toward the sender, it stops at the point where
there is already an existing reservation that is equal to or greater than that
being requested. The new reservation request is merged with the existing reserva-
tion and is not forwarded further. This practice may reduce the amount of RSVP
traf®c appreciably when there are many receivers in the multicast tree. Figure
10.21 illustrates the reservation merging example. Here the reservation requests
from Rx1 and Rx2 are merged at R3, which are in turn merged at R2 with the
request coming from Rx3.
698 CHAPTER 10 Advanced Network Architectures
Path
Resv
Path
Resv
Path Path
Resv Resv
S RxR1
R2
R3
FIGURE 10.20 RSVP Path
and Resv messages
Path
Resv
Path
Path
Path
Resv
Resv
Resv
Path
Path
Path
Resv
Resv
Resv
S
Rx1
Rx2
Rx3
R1
R2
R4
R3
FIGURE 10.21 Merging reservations
| | | Textbook Table of Contentse-Text Main Menu
v
v
7. 10.5.3 Reservation Styles
Three reservation styles are de®ned in RSVP: wildcard ®lter, ®xed ®lter, and
shared explicit. Figure 10.22 shows a router con®guration somewhere in a dis-
tribution tree for the purpose of distinguishing reservation styles. Three senders
and three receivers are attached to the router. It is assumed that packets from S1,
S2, and S3 are forwarded to both output interfaces.
The wildcard-®lter (WF) style creates a single reservation shared by all
senders. This style can be thought of as a shared pipe whose resource is the
largest of the resource requests from all receivers, independent of the number
of senders. The WF-style reservation request is symbolically represented by
WF(*{Q}), where the asterisk denotes wildcard sender selection and Q denotes
the ¯owspec. WF style is suitable for applications that are unlikely to have
multiple senders transmitting simultaneously. Such applications include audio
conferencing.
Figure 10.23 shows the WF-style reservation. For simplicity, the ¯owspec is
assumed to be of one-dimensional quantity in multiples of some base resource
quantity B. Interface (c) receives a request with a ¯owspec of 4B from a down-
stream node, and interface (d) receives two requests with ¯owspects of 3B and
2B. The requests coming from interface (d) are merged into one ¯owspec of 3B so
that this interface can support the maximum requirement. When forwarded by
the input interfaces, the requests from interfaces (c) and (d) are further merged
into a ¯owspec of 4B.
The ®xed-®lter (FF) style creates a distinct reservation for each sender.
Symbolically, this reservation request can be represented by FF(S1{Q1},
S2{Q2}, . . .), where Si is the selected sender and Qi is the resource request for
sender i. The total reservation on a link for a given session is the sum of all Qi's.
Figure 10.24 shows the FF-style reservation. Interface (c) receives a request
with a ¯owspec of 4B for sender S1 and 5B for sender S2 and forwards
FF(S1{4B}) to (a) and FF(S2{5B}) to (b). Note that the FF-style reservation
is shared by all destinations. Interface (d) receives two requests: FF(S1{3B},
S3{B}) and FF(S1{B}). Interface (d) then reserves 3B for S1 and B for S3 and
forwards FF(S1{3B}) to (a) and FF(S3{B}) to (b). Interface (a) then merges the
two requests received from (c) and (d) and forwards FF(S1{4B}) upstream.
Interface (b) packs the two requests from (c) and (d) and forwards FF(S2{5B},
S3{B}) upstream.
The shared-explicit (SE) style creates a single reservation shared by a set of
explicit senders. Symbolically, this reservation request can be represented by
SE(S1, S2 . . . {Q}), where Si is the selected sender and Q is the ¯owspec.
10.5 RSVP 699
R1
c
d
a
b
S1
S2, S3
Router
R2
R3
FIGURE 10.22 Example for different reservation
styles
| | | Textbook Table of Contentse-Text Main Menu
v
v
8. Figure 10.25 shows the SE-style reservation. When reservation requests are
merged, the resulting ®lterspec is the union of the original ®lterspecs and the
resulting ¯owspec is the largest ¯owspec.
10.5.4 Soft State
The reservation states that are maintained by RSVP at each node are refreshed
periodically by using Path and Resv messages. When a state is not refreshed
within a certain time-out, the state is deleted. The type of state that is maintained
by a timer is called soft state as opposed to hard state where the establishment
and teardown of a state are explicitly controlled by signaling messages.
Because RSVP messages are delivered as IP datagrams with no reliability
requirement, occasional losses can be tolerated as long as at least one of the K
consecutive messages gets through. Currently, the default value of K is 3. Refresh
messages are transmitted once every R seconds, where the default value is 30
seconds. To avoid periodic message synchronization, the actual refresh period
for each message should be randomized, say, using a uniform distribution in the
range of ‰0:5R; 1:5RŠ. Each Path and Resv message carries a TIME_VALUES
object containing the refresh period R. From this value, a local node can deter-
mine its state lifetime L, which is L ! 1:5 Ã
K Ã
R.7
700 CHAPTER 10 Advanced Network Architectures
Receive
WF(*{4B})WF(*{4B})
*{4B}
*{3B}
(a)
(b)
(c)
(d)
WF(*{3B})
WF(*{2B})WF(*{4B})
ReserveSend
FIGURE 10.23 Wildcard-®lter reservation example
Receive
FF(S1{4B})
(a)
(b)
(c)
(d)
FF(S2{5B}, S3{B})
FF(S1{4B}, S2{5B})
S1{4B}
S2{5B}
S1{3B}
S3{B}
FF(S1{3B}, S3{B})
FF(S1{B})
ReserveSend
FIGURE 10.24 Fixed-®lter reservation example
7
The RSVP speci®cation instead gives this formula: L ! …K ‡ 0.5† Ã
1.5 Ã
R, which the author thinks is not
correct.
| | | Textbook Table of Contentse-Text Main Menu
v
v
9. There is a trade-off between the refresh traf®c overhead period and recovery
time. The amount of refresh traf®c overhead is (Path_size + Resv_size)/R bits/
second. A short refresh period increases the refresh traf®c overhead, while a long
refresh period lengthens the recovery time.
Although a time-out will eventually occur in a path or reservation state if the
corresponding refresh message is absent, RSVP can speed up state removals by
utilizing teardown messages. There are two types of teardown messages:
PathTear and ResvTear. A PathTear message travels from the point of origin,
following the same paths as the Path messages toward the receivers, deleting the
path state and dependent reservation state along the paths. A ResvTear message
travels from the point of origin toward the upstream senders, deleting the reser-
vation state along the way.
10.5.5 RSVP Message Format
Each RSVP message consists of a common header and a body consisting of a
variable number of objects that depend on the message type. The objects in the
message provide the information necessary to make resource reservations. The
format of the common header is shown in Figure 10.26.
The current protocol version is 1, and no ¯ag bits are currently de®ned. The
seven message types are Path, Resv, PathErr, ResvErr, PathTear, ResvTear, and
ResvConf.
The RSVP checksum uses the 1s complement algorithm common in TCP/IP
checksum computation. The Send_TTL represents the IP TTL value with which
the message was sent. It can be used to detect a non-RSVP hop by comparing the
Send_TTL value in the RSVP common header and the TTL value in the IP
10.5 RSVP 701
Receive
(a)
(b)
(c)
(d)
SE((S1, S2){B})
SE((S1, S3){3B})
SE(S2{2B})
SE(S1{3B})
(S1, S2){B}
(S1, S2, S3)
{3B}
SE((S2, S3){3B})
ReserveSend
FIGURE 10.25 Shared-explicit reservation example
0 4 8 16
RSVP checksum
RSVP length
Message type
Reserved
FlagsVersion
Send_TTL
31
FIGURE 10.26 Format of common header
| | | Textbook Table of Contentse-Text Main Menu
v
v
10. header. The RSVP length ®eld indicates the total length of the RSVP message in
octets, including the common header.
The format of the objects that follow the common header is shown in Figure
10.27. The length ®eld indicates the total object length in octets. The length must
be a multiple of four.
The Class-Num ®eld identi®es the object class. The C-Type value identi®es
the subclass of the object. The following object classes are de®ned:
NULL: A NULL object is ignored by the receiver.
SESSION: A SESSION object speci®es the session for the other objects that
follow. It is indicated by the IP destination address, IP protocol number,
and destination port number. The session object is required in every mes-
sage.
RSVP_HOP: This object carries the IP address of the RSVP-capable router
that sent this message. For downstream messages (e.g., Path from source
to receiver), this object represents the previous hop; for upstream messages
(e.g., Resv from receiver to source), this object represents the next hop.
TIME_VALUES: This object contains the value of the refresh period R.
STYLE: This object de®nes the reservation style information that is not in
the ¯owspec or ®lterspec objects. This object is required in the Resv mes-
sage.
FLOWSPEC: This object de®nes the desired QoS in a Resv message.
FILTER-SPEC: This object de®nes the set of packets that receive the desired
QoS in a Resv message.
SENDER_TEMPLATE: This object provides the IP address of the sender in
a Path message.
SENDER_TSPEC: This object de®nes the sender's traf®c characteristics in a
Path message.
ADSPEC: This object carries end-to-end path information (OPWA8
) in a
Path message.
ERROR_SPEC: This object speci®es errors in PathErr and ResvErr, or
errors in a con®rmation in ResvConf.
POLICY_DATA: This object carries policy information that enables the
policy module in a node to determine whether a request is allowed or not.
702 CHAPTER 10 Advanced Network Architectures
0
Length
16 24 31
Class-Num
(Object contents)
C-type
FIGURE 10.27 Format of each object
8
OPWA stands for one pass with advertising. It refers to a reservation model in which downstream
messages gather advertisement information that the receiver(s) can use to learn about the end-to-end
service.
| | | Textbook Table of Contentse-Text Main Menu
v
v
11. INTEGRITY: This object carries cryptographic and authentication informa-
tion that is used to verify the contents of an RSVP message.
SCOPE: This object provides an explicit list of senders that are to receive
this message. The object may be used in Resv, ResvErr, or ResvTear
messages.
RESV_CONFIRM: This object carries the receiver IP address that is to
receive the conformation.
RSVP messages are built from a common header followed by a number of
objects. For example, the format of a Path message is given as follows:
Path message::=Common Header[INTEGRITY]
SESSIONRSVP_HOP
TIME_VALUES
[POLICY_DATA...]
[sender descriptor]
sender descriptor::=SENDER_TEMPLATESENDER_TSPEC[ADSPEC]
Another important example is the Resv message, which is given as follows:
Resv message::=Common Header[INTEGRITY]
SESSIONRSVP_HOP
TIME_VALUES
[RESV_CONFIRM][SCOPE]
[POLICY_DATA...]
STYLEflow descriptor list
The ¯ow descriptor list depends on the reservation styles. For Wildcard
Filter (WF) style, the list is
flow descriptor list::=WF flow descriptor
WF flow descriptor::=FLOWSPEC
For Fixed FILTER (FF) style, the list is given by
flow descriptor list::=FLOWSPECFILTER_SPEC|
flow descriptor listFF flow descriptor
FF flow descriptor::=[FLOWSPEC]FILTER_SPEC
For Shared Explicit (SE) style, the ¯ow descriptor list is given by
flow descriptor::=SE flow descriptor
SE flow descriptor::=FLOWSPECfilter spec list
filter spec list::=FILTER_SPEC|
filter spec listFILTER_SPEC
10.6 DIFFERENTIATED SERVICES
The integrated services model was a ®rst step toward providing QoS in the
Internet. However, the integrated services model requires a router to keep a
10.6 Differentiated Services 703
| | | Textbook Table of Contentse-Text Main Menu
v
v