• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 14
  • 5
  • 3
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 19
  • 19
  • 19
  • 19
  • 9
  • 7
  • 7
  • 6
  • 6
  • 6
  • 4
  • 4
  • 4
  • 4
  • 4
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Flow-based dynamic routing in uncertain network environments

Su, Xun 28 August 2008 (has links)
Not available / text
2

Supporting rate adaptive multimedia streams on the Internet

Weber, Steven Patrick 28 August 2008 (has links)
Not available / text
3

Flow-size based differentiation to enhance user perceived performance on networks supporting best-effort traffic

Yang, Shan-chieh 28 August 2008 (has links)
Not available / text
4

Quality of service routing with path information aggregation

Tam, Wing-yan., 譚泳茵. January 2006 (has links)
published_or_final_version / abstract / Electrical and Electronic Engineering / Master / Master of Philosophy
5

An extensible design of a load-aware virtual router monitor in user space.

January 2011 (has links)
Choi, Fu Wing. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2011. / Includes bibliographical references (p. 54-57). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.2 / Chapter 2 --- Overview --- p.5 / Chapter 2.1 --- Summary of our Router Virtualization Architecture --- p.6 / Chapter 3 --- LVRM Design --- p.9 / Chapter 3.1 --- Socket Adapter --- p.9 / Chapter 3.2 --- VR Monitor --- p.11 / Chapter 3.3 --- VRI Monitor --- p.14 / Chapter 3.4 --- VRI Adapter --- p.16 / Chapter 3.5 --- Inter-Process Communication (IPC) Queue --- p.17 / Chapter 3.6 --- LVRM Adapter for VRI --- p.17 / Chapter 3.7 --- VRI --- p.18 / Chapter 3.8 --- Interfacing Between LVRM and VRs --- p.18 / Chapter 4 --- Experiments --- p.20 / Chapter 4.1 --- Experimental Setup --- p.20 / Chapter 4.2 --- Performance Overhead of LVRM --- p.23 / Chapter 4.3 --- Core Allocation --- p.31 / Chapter 4.4 --- Load Balancing --- p.38 / Chapter 4.5 --- Scalability --- p.43 / Chapter 4.6 --- Lessons Learned --- p.47 / Chapter 5 --- Related Work --- p.50 / Chapter 6 --- Conclusions --- p.52
6

Resource allocation and throughput analysis for multi-radio multi-channel networks.

January 2007 (has links)
Xu, Ceng. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2007. / Includes bibliographical references (p. 68-71). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgement --- p.iii / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Motivation --- p.3 / Chapter 1.2 --- Contributions --- p.5 / Chapter 1.3 --- Thesis Scope --- p.5 / Chapter 2 --- Background Study --- p.6 / Chapter 2.1 --- Wireless Mesh Networks --- p.6 / Chapter 2.1.1 --- Overview of Wireless Mesh Networks --- p.6 / Chapter 2.1.2 --- Challenges of Wireless Mesh Networks --- p.9 / Chapter 2.1.3 --- Capacity Analysis of Wireless Mesh Net- works --- p.11 / Chapter 2.2 --- Network Coding --- p.13 / Chapter 2.2.1 --- Overview of Network Coding --- p.13 / Chapter 2.2.2 --- Network Coding in Wireless Networks --- p.17 / Chapter 3 --- Throughput Analysis --- p.19 / Chapter 3.1 --- Introduction --- p.19 / Chapter 3.2 --- Preliminaries --- p.20 / Chapter 3.3 --- Proof of Theorem 3.2.1 when n = m --- p.23 / Chapter 3.4 --- Proof of Theorem 3.2.1 when n≠ m --- p.36 / Chapter 3.4.1 --- Proof of Theorem 3.2.1 when m <n --- p.36 / Chapter 3.4.2 --- Proof of Theorem 3.2.1 when m > n --- p.37 / Chapter 3.5 --- Applying network coding into multi-radio multichannel networks --- p.37 / Chapter 3.6 --- Some simulation results --- p.40 / Chapter 3.6.1 --- String Topology --- p.40 / Chapter 3.6.2 --- Grid Topology --- p.41 / Chapter 3.6.3 --- Random Topology --- p.42 / Chapter 4 --- Interface Reduction in Wireless Mesh Networks --- p.43 / Chapter 4.1 --- Introduction --- p.43 / Chapter 4.2 --- Preliminaries --- p.44 / Chapter 4.2.1 --- Assumptions and Objectives of the Algorithm --- p.44 / Chapter 4.2.2 --- Definitions --- p.45 / Chapter 4.3 --- Steps of the Algorithm and an Example --- p.49 / Chapter 4.4 --- Simulation Results and Discussions --- p.53 / Chapter 4.5 --- Generalization --- p.54 / Chapter 5 --- Conclusion --- p.66 / Bibliography --- p.68
7

A scalable and deployable approach for achieving fair rate allocation in high speed networks

Blanpain, Yannick 08 1900 (has links)
No description available.
8

Online algorithms for the provision of quality of service in networks

Fung, Ping-yuen., 馮秉遠. January 2005 (has links)
published_or_final_version / abstract / Computer Science / Doctoral / Doctor of Philosophy
9

Deadline-ordered parallel iterative matching with QoS guarantee.

January 2000 (has links)
by Lui Hung Ngai. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2000. / Includes bibliographical references (leaves 56-[59]). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Thesis Overview --- p.3 / Chapter 2 --- Background & Related work --- p.4 / Chapter 2.1 --- Scheduling problem in ATM switch --- p.4 / Chapter 2.2 --- Traffic Scheduling in output-buffered switch --- p.5 / Chapter 2.3 --- Traffic Scheduling in Input buffered Switch --- p.16 / Chapter 3 --- Deadline-ordered Parallel Iterative Matching (DLPIM) --- p.22 / Chapter 3.1 --- Introduction --- p.22 / Chapter 3.2 --- Switch model --- p.23 / Chapter 3.3 --- Deadline-ordered Parallel Iterative Matching (DLPIM) --- p.24 / Chapter 3.3.1 --- Motivation --- p.24 / Chapter 3.3.2 --- Algorithm --- p.26 / Chapter 3.3.3 --- An example of DLPIM --- p.28 / Chapter 3.4 --- Simulation --- p.30 / Chapter 4 --- DLPIM with static scheduling algorithm --- p.41 / Chapter 4.1 --- Introduction --- p.41 / Chapter 4.2 --- Static scheduling algorithm --- p.42 / Chapter 4.3 --- DLPIM with static scheduling algorithm --- p.48 / Chapter 4.4 --- An example of DLPIM with static scheduling algorithm --- p.50 / Chapter 5 --- Conclusion --- p.54 / Bibliography --- p.56
10

Congestion control and QoS provisioning in IP networks.

January 2002 (has links)
Hua Cunqing. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2002. / Includes bibliographical references (leaves 53-56). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Congestion Control in the IP Network --- p.1 / Chapter 1.2 --- Quality of Service in the IP network --- p.2 / Chapter 1.3 --- Structure of Thesis --- p.3 / Chapter 2 --- Background --- p.4 / Chapter 2.1 --- TCP and Congestion Control --- p.4 / Chapter 2.1.1 --- Slow Start --- p.4 / Chapter 2.1.2 --- Congestion Avoidance --- p.5 / Chapter 2.1.3 --- "Fast Retransmit, Fast Recovery and Timeout" --- p.5 / Chapter 2.2 --- Active Queue Management --- p.7 / Chapter 2.3 --- Integrated Services and Differentiated Services --- p.8 / Chapter 3 --- The Fairness of TCP Vegas in Networks with Multiple Congested Gate- ways --- p.10 / Chapter 3.1 --- Introduction --- p.10 / Chapter 3.2 --- TCP Vegas and related works --- p.11 / Chapter 3.3 --- Analysis --- p.13 / Chapter 3.4 --- Simulation Results --- p.15 / Chapter 3.4.1 --- Throughput for different number of active cross connections --- p.16 / Chapter 3.4.2 --- Throughput for different number of flows in each connection --- p.17 / Chapter 3.4.3 --- Multiple congestion vs Single congestion --- p.17 / Chapter 3.5 --- Summary --- p.19 / Chapter 4 --- The Joint Congestion Control for TCP/IP Networks --- p.21 / Chapter 4.1 --- Background --- p.21 / Chapter 4.2 --- The Joint Congestion Control --- p.23 / Chapter 4.2.1 --- Path Load Reduction Factor --- p.23 / Chapter 4.2.2 --- The Congestion Control Algorithm --- p.24 / Chapter 4.2.3 --- Probing Interval --- p.26 / Chapter 4.2.4 --- Parameter Setting --- p.26 / Chapter 4.2.5 --- Encoding of R --- p.27 / Chapter 4.3 --- Simulation Results --- p.28 / Chapter 4.3.1 --- Congestion Window Behavior --- p.28 / Chapter 4.3.2 --- Throughput Stability --- p.31 / Chapter 4.3.3 --- Packet Loss Ratio --- p.31 / Chapter 4.3.4 --- Fairness Index --- p.32 / Chapter 4.3.5 --- Fairness in Multiple-hop Network --- p.32 / Chapter 4.3.6 --- Parameter Sensitivity --- p.33 / Chapter 4.3.7 --- Interaction between JCC and Reno flows --- p.35 / Chapter 4.4 --- Summary --- p.35 / Chapter 5 --- S-WTP : Shifted Waiting Time Priority Scheduling for Delay Differ- entiated Services --- p.37 / Chapter 5.1 --- Introduction --- p.37 / Chapter 5.2 --- Scheduling Algorithms for Delay Differentiated Services --- p.38 / Chapter 5.3 --- Shifted Waiting Time Priority Scheduling --- p.41 / Chapter 5.3.1 --- Local Update --- p.42 / Chapter 5.3.2 --- Global Update --- p.42 / Chapter 5.3.3 --- Computational overhead --- p.42 / Chapter 5.4 --- Simulation Results --- p.43 / Chapter 5.4.1 --- Microscopic View of Individual Packet Delay of S-WTP and WTP --- p.43 / Chapter 5.4.2 --- Delay Ratios in Different Timescales --- p.44 / Chapter 5.4.3 --- Effects of aggregate traffic and class load distribution on delay ratio --- p.44 / Chapter 5.4.4 --- Delay Ratios with More Classes --- p.48 / Chapter 5.5 --- Summary --- p.48 / Chapter 6 --- Conclusions --- p.50 / Chapter 6.1 --- Congestion Control --- p.50 / Chapter 6.2 --- Quality of Service Provision --- p.51 / Chapter 6.3 --- Final Remarks --- p.51

Page generated in 0.0985 seconds