Fleksibilni Internet servisi na bazi kontrole kašnjenja i

More documents

Recommendations

Info

ABE Alternative Best-Effort AF Assured Forwarding AQM Active Queue Management List of Abbreviations and Acronyms BEDS Best-Effort Differentiated Services BPR Backlog-Proportional Rate BPR + Optimized Backlog-Proportional Rate CAC Call Admission Control CLS Controlled Load Service DiffServ Differentiated Services DS Delay-Sensitive DSD Duplicate Scheduling with Deadlines DSCP DiffServ Codepoint EDS Equivalent Differentiated Services EF Expedited Forwarding FIFO First-In First-Out FTP File Transfer Protocol GS Guaranteed Service HOL Head-of-Line HTTP Hypertext Transfer Protocol IETF Internet Engineering Task Force x
IntServ Integrated Services IP Internet Protocol ISP Internet Service Provider LHT Loss History Table NNTP Network News Transfer Protocol PLC Packet Loss Controller PHB Per-Hop Behaviour PLR Proportional Loss Rate QoS Quality of Service RED Random Early Detection RSVP Resource Reservation Protocol SMTP Simple Mail Transfer Protocol SLA Service Level Agreement TCA Traffic Conditioning Agreement TCP Transport Control Protocol TDP Time-Dependent Priorities TS Throughput-Sensitive UDP User Datagram Protocol WFQ Weighted Fair Queuing WTP Waiting-Time Priority xi
Page 1 and 2: UNIVERZITET U BEOGRADU ELEKTROTEHNI
Page 3 and 4: Abstract Vladimir V. Vukadinović D
Page 5 and 6: Table of Contents Abstrakt.........
Page 7 and 8: List of Figures Fig. 1. Traffic con
Page 9: List of Tables Table 1. Comparison
Page 13 and 14: The DiffServ model [8]-[10] offers
Page 15 and 16: [29]. Detailed description of these
Page 17 and 18: 2. Quality of Service in Internet:
Page 19 and 20: whose sole purpose is to detect and
Page 21 and 22: architectures (implemented or propo
Page 23 and 24: 2.2.2. Differentiated Services (Dif
Page 25 and 26: 2.2.3. Non-Elevated Services Non-El
Page 27 and 28: 3. Survey of existing proposals for
Page 29 and 30: RED [29] is an active queue managem
Page 31 and 32: The intersections of the RED contro
Page 33 and 34: flows. Quality of services received
Page 35 and 36: normalized loss rates among classes
Page 37 and 38: 4. Proposed service differentiation
Page 39 and 40: controller can be considered as an
Page 41 and 42: to a close-to-optimal rate assignme
Page 43 and 44: Fig. 8. Example of an input and out
Page 45 and 46: where I DS ( τ ) Z ( τ ) = . If (
Page 47 and 48: packet departure as: V V TS DS d
Page 49 and 50: 5.3.1. Influence of traffic load In
Page 51 and 52: differentiation. Similar result has
Page 53 and 54: In order to investigate the perform
Page 55 and 56: schedulers for proportional delay d
Page 57 and 58: 6. Packet Loss Controller Packet Lo
Page 59 and 60: described by Floyd and Jacobson [29
Page 61 and 62:
where R’ and p’ are round-trip
Page 63 and 64:
Since σ=σ0 ensures that T=T’, i
Page 65 and 66:
⎛ ⎜ ⎝ Based on (51) - (54),
Page 67 and 68:
7. Simulation results We evaluated
Page 69 and 70:
BPR scheduling without PLC, TCP flo
Page 71 and 72:
time of TCP packets continually inc
Page 73 and 74:
Fig. 27. Influence of UDP load on T
Page 75 and 76:
even in the case of multiple bottle
Page 77 and 78:
management, PLC controller and TCP
Page 79 and 80:
Appendix A The pseudocode for the h
Page 81 and 82:
Appendix B We describe here a proce
Page 83 and 84:
Fig. 30. TCP throughput as a functi
Page 85 and 86:
2 ⎛ 2 ⎞ 5 ⎛ 2 ⎞ 1 ⎛ ⎞
Page 87 and 88:
+Queue/PROBE set wait_ true +Queue/
Page 89 and 90:
}; #endif int idle_; /* queue is id
Page 91 and 92:
} if (!dsQueue.head() && tsQueue.he
Page 93 and 94:
* count and count_bytes keeps a tal
Page 95 and 96:
int PROBEQueue::length(int qos_clas
Page 97 and 98:
[13] S. Bodamer, “A new schedulin
Page 99 and 100:
[37] K. Nichols, S. Blake, F. Baker
show all

Fleksibilni Internet servisi na bazi kontrole kašnjenja i

Create successful ePaper yourself

Delete template?

Save as template?