TITRE Adaptive Packet Video Streaming Over IP Networks - LaBRI

More documents

Recommendations

Info

for supporting the traffic engineering of <strong>IP</strong>-based networks is presented in [170]. Different types monitoring measurements have been identified and are either passive or active. Passive measurement means that the statistics of the network element are maintained in the form of a Management Information Base (MIB), whereas in active measurement, test packets are injected into the network (like ping test) to gather information. Information collected about these packets are taken as representative of the behavior of the network. Metrics of this data are described in the framework presented in [171]. Different measurement can be made to collect information of the network. Here a list of not-exhaustive measurements: • Flow-based: gathers information about each flow in the network, but it causes a scalability problem. • Interface-based, link-based and node-based: collects information of each interface in the network element. • Node-pair-based: it is used essentially to calculate the performance of edge-to-edge performance of a core network. • Path-based: it is similar to pair-based measurement and may be used for admission control. In the rest of this section, we will interest to QoS measurement, essentially the bandwidth usage metrics. This measurement is protocol independent and media independent to ensure both portability and commonality in the measurements and allow a dynamic packet video marking. Figure 5-7 illustrates how hierarchical measurement estimates the traffic matrix for a large ISP. Each router performs a passive monitoring of incoming traffic (i.e. BW ij : bandwidth usage for router i in its interface j). Through regular update, each router provides a partial view of the network. MCA (Measurement Collection Agent) aggregate this partial measurement the result is given to the PDP. PDP aggregates all the measurement into a matrix that gives the PDP a global status of the network and can generate feedback from the network. PDP PDP ISP2 ISP1 MC A MCA MC A Regular Traffic Measurement MCA: Measurement Collection Agent Diffserv router Regular update of traffic measurement 118
Figure 5-7: Hierarchical aggregation of measurement 5.4 Implementation Issues Our prototype consists of three modules that perform dynamic packet video marking in an administrative domain; these modules are Policy-based network management tool, Network Monitoring System, and Policy System (Policy Decision Point and Policy Enforcement Point). Figure 5-8 shows the core components of our implementation. 5.4.1.1 Network Monitoring Agent Our implementation consists of an agent written in Java which collects information on each interface of the router. The collected information consists of a real-time traffic flow measurement in input and output of each interface. This way, the agent augments the functionality of PEP by reporting monitoring information to the PDP in the form of COPS Report State Message. The PDP, when it detects a significant modification in the network state, delivers to the PEP a new policy decision in term of new policy rules. Decision-making is based on the algorithm described in Figure 5-6. 5.4.1.2 Policy Management System This system is composed of a PDP and a PEP communicating using COPS protocol. All system components are implemented in Java. The COPS-PR implementation is simplified to exchange policy rule between PDP and PEP. Simplified COPS-PR implementation is used to exchange policy rules between the PDP and the PEP. The PEP is associated with the interfaces to which the marking must be applied (edge router). It is notified when the policy changes (or is newly) by a COPS provisioning operation. The PEP receives the policy information and transforms it into a form suitable for the device, e.g. using a Linux Diffserv Traffic Control API. After this, all incoming packets to this device will be marked according to the new marking policy. The PDP is responsible for decision making and uses for that the network monitoring agents. Our implementation is limited to one domain (there is no inter-domain communication). Our policy tool management is a Policy-based Web Bandwidth Broker. It consists essentially of a web interface installed in web application server. The administrator uses the web interface to configure the Diffserv domain and to enter new policy or to edit an old one. A Java Servlet engine is used to store all the information to a repository. We have used an OpenLDAP [172] server running on Linux. Other functions may be provided, such as validation, verification, conflict detection, etc. which are not yet available in our system. In the top right of Figure 5-8, a simple web-based interface of the bandwidth broker is shown. It illustrates the edge router configuration, specially the filter configuration and how setting PHB for the traffic entering the network. 119
Page 1:
UNIVERSITÉ DE VERSAILLES SAINT-QUE
Page 4 and 5:
Résumé Nous constatons aujourd’
Page 6 and 7:
3 Related Work ....................
Page 8 and 9:
5.5.1.2 Simulation Results.........
Page 10 and 11:
List of Figures Figure 1-1: Structu
Page 12 and 13:
Figure 5-15: End-to-end packet tran
Page 14 and 15:
Acknowledgments The first person I
Page 16 and 17:
[11] Toufik Ahmed, Guillaume Burida
Page 18 and 19:
d’accès. Les interactions de QoS
Page 20 and 21:
Métrique MAX_DELAY PREF_MAX_DELAY
Page 22 and 23:
1.1.2 Proposition dun Protocole d'E
Page 24 and 25:
des paquets RTP. Reste toujours le
Page 26 and 27:
Nous pouvons distinguer trois possi
Page 28 and 29:
1.1.2.5.2 Multiplexage des Flux El
Page 30 and 31:
l’horloge est par défaut égale
Page 32 and 33:
La valeur R TCP représente le déb
Page 34 and 35:
Pour ces raisons, nous nous intére
Page 36 and 37:
Telles que illustrés par la Figure
Page 38 and 39:
3. DMIF2SIP vérifie si son propre
Page 40 and 41:
utilisée optionnellement pour loca
Page 42 and 43:
Chapter 2 2 Introduction 2.1 Motiva
Page 44 and 45:
conditions. Based on end-to-end fee
Page 46 and 47:
Chapter 3 3 Related Work Nowadays,
Page 48 and 49:
• multicasting: it takes the stre
Page 50 and 51:
expensive, fixed delivery and recep
Page 52 and 53:
3.1.6 Static vs. Dynamic Channels T
Page 54 and 55:
environment because they require a
Page 56 and 57:
H.261 is called video codec for aud
Page 58 and 59:
VideoScene (VS) VideoObject (VO) Vi
Page 60 and 61:
The emphasis of MPEG-7 will be the
Page 62 and 63:
Temporal scalability involves parti
Page 64 and 65:
multitude of streams. It can switch
Page 66 and 67:
increased linearly in the absence o
Page 68 and 69:
3.2.2.1 End-to-End Retransmission R
Page 70 and 71:
correctly received block. The missi
Page 72 and 73:
epresent user traffic. The delay ca
Page 74 and 75:
3.2.5 IP Signaling Protocols for Pa
Page 76 and 77:
two H.323 endpoints or between an e
Page 79 and 80:
Chapter 4 4 Adaptive Packet Video T
Page 81 and 82:
4.1.1 Video Classification Model Pr
Page 83 and 84: attributes can refer to the QoS par
Page 85 and 86: In RBF, 2 D = X − is the distance
Page 87 and 88: Figure 4-6: Experiment testbed In t
Page 89 and 90: 190 180 170 End-to-end delay MPEG-4
Page 91 and 92: Sync Layer. The SL-packetized strea
Page 93 and 94: conveyed by MIME format parameters
Page 95 and 96: the same value. This timing informa
Page 97 and 98: 4.2.2.1 Fragmentation We propose to
Page 99 and 100: Timestamp: Indicates the sampling i
Page 101 and 102: When G is used as generator matrix,
Page 103 and 104: 4.2.3 Performance Evaluation Intens
Page 105 and 106: 0.3 0.25 our proposal classical app
Page 107 and 108: lost packet at the receiver. Conseq
Page 109 and 110: marking scheme. The server must be
Page 111 and 112: The video server adds audio-visual
Page 113 and 114: Marker (TR3CM) [131] to mark the ba
Page 115 and 116: VO1 VO2 AVO Scenario Audio BL EL1 E
Page 117 and 118: Throughput (Kbits) 3000 2500 2000 1
Page 119 and 120: Throughput (Kbits) 3000 2500 2000 1
Page 121 and 122: 4000 3500 3000 2500 2000 1500 1000
Page 123 and 124: 45 40 Original Quality Received Qua
Page 125 and 126: Chapter 5 5 A Dynamic Packet Video
Page 127 and 128: The TCM algorithm is based on a tok
Page 129 and 130: BEGIN Initialize the classification
Page 131 and 132: User Profile (Token Bucket) Traffic
Page 133: 5.3.3 QoS Management Algorithm Spec
Page 137 and 138: • Filters: to put packets into cl
Page 139 and 140: mechanism associated with the Drop
Page 141 and 142: Figure 5-16: Packets loss with IP D
Page 143 and 144: 5.5.2.3 Experimental Results Figure
Page 145 and 146: 1 MPEG-4 Based Layer Stream -AF11 M
Page 147 and 148: 0.2 0.18 MPEG-4 Based Layer Stream
Page 149 and 150: By using our PBNM tool, we allocate
Page 151 and 152: Id Condition Indicator Action 1 Net
Page 153 and 154: The proposed marking algorithm bett
Page 155 and 156: Chapter 6 6 A SIP/MPEG-4 Multimedia
Page 157 and 158: performed by many ways like SLA (Se
Page 159 and 160: 6.1.1.4 SIP Communication Model SIP
Page 161 and 162: • It assign a value (network sess
Page 163 and 164: 6.2.1 SIP2DMIF Subsystem The SIP2DM
Page 165 and 166: Step 1: The MPEG-4 Terminal passes
Page 167 and 168: 1. Set the result C to the empty se
Page 169 and 170: TCP/UDP port, our implementation us
Page 171 and 172: Control & Data Plan Video Rate Cont
Page 173 and 174: characteristics and relevance of ea
Page 175 and 176: References [1] Kazaa Media Desktop
Page 177 and 178: [43] B. Schuster, “Fine granular
Page 179 and 180: [79] D. Bansal and H. Balakrishnan,
Page 181 and 182: [115] N. Laoutaris, I. Stavrakakis,
Page 183 and 184: [154] W. Almesberger, J. H. Salim,
Page 185 and 186:
Appendix A A Appendix A: Overview o
Page 187 and 188:
Media aware Delivery unaware ISO/IE
Page 189 and 190:
A.3.3 Scene Description Streams Sce
Page 191:
This appendix presents structure ex
show all

TITRE Adaptive Packet Video Streaming Over IP Networks - LaBRI

Create successful ePaper yourself

Delete template?

Save as template?