• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1926
  • 182
  • 176
  • 147
  • 36
  • 25
  • 25
  • 25
  • 25
  • 25
  • 24
  • 16
  • 11
  • 9
  • 7
  • Tagged with
  • 2830
  • 2830
  • 731
  • 628
  • 504
  • 494
  • 385
  • 331
  • 309
  • 297
  • 293
  • 287
  • 282
  • 275
  • 274
  • 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.

Layered decision model for cost-effective network safeguarding /

Wei, Huaqiang. January 1900 (has links)
Thesis (Ph. D., Computer Science)--University of Idaho, December 6, 2006. / Major professor: Jim Alves-Foss. Includes bibliographical references (leaves 102-109). Also available online (PDF file) by subscription or by purchasing the individual file.

Building reliable applications in overlay networks

Liu, Xiaomei. January 2008 (has links)
Thesis (Ph. D.)--Michigan State University. Computer Science and Engineering Dept., 2008. / Title from PDF t.p. (viewed on Apr. 8, 2009) Includes bibliographical references (p. 176-184). Also issued in print.

Algorithms for multiconstrained quality-of-service paths and restoration

Song, Meongchul. January 2005 (has links)
Thesis (Ph. D.)--University of Florida, 2005. / Title from title page of source document. Document formatted into pages; contains 88 pages. Includes vita. Includes bibliographical references.

Network management standards from the fault management perspective.

Aitken, William Theodore, Carleton University. Dissertation. Engineering, Electrical. January 1992 (has links)
Thesis (M. Eng.)--Carleton University, 1992. / Also available in electronic format on the Internet.

Setting up information technology structures for trade unions

Hecht, Harvey B. January 2006 (has links) (PDF)
Thesis (M.S.C.I.T.)--Regis University, Denver, Colo., 2006. / Title from PDF title page (viewed on Dec. 13, 2006). Includes bibliographical references.

Scalable and efficient distributed algorithms for defending against malicious Internet activity

Sung, Minho. January 2006 (has links)
Thesis (Ph. D.)--Computing, Georgia Institute of Technology, 2007. / Xu, Jun, Committee Chair ; Ahamad, Mustaque, Committee Member ; Ammar, Mostafa, Committee Member ; Bing, Benny, Committee Member ; Zegura, Ellen, Committee Member.

Secure remote network administration and power management /

Sullivan, Mark P. January 2004 (has links) (PDF)
Thesis (M.S. in Computer Science)--Naval Postgraduate School, June 2004. / Thesis advisor(s): Dale Courtney. Includes bibliographical references (p. 53). Also available online.

Alleviating problems due to resource constraints in computer networks using additional information /

Zhang, Lei. January 2006 (has links)
Thesis (Ph.D.)--Hong Kong University of Science and Technology, 2006. / Includes bibliographical references (leaves 106-113). Also available in electronic version.

Utilization and control of a packet switching multi-access channel

Saadat, Farivar January 1977 (has links)
No description available.

Load-balanced switch design and data center networking

He, Chunzhi, 何春志 January 2014 (has links)
High-speed routers and high-performance data centers share a common system-level architecture in which multiple processing nodes are connected by an interconnection network for high-speed communications. Load balancing is an important technique for maximizing throughput and minimizing delay of the interconnection network. In this thesis, efficient load balancing schemes are designed and analyzed for next-generation routers and data centers. In high-speed router design, two preferred switch architectures are input-queued switch and load-balanced switch. In an input-queued switch, time-domain load balancing can be carried out by an iterative algorithm that schedules packets for sending in different time slots. The complexity of an iterative algorithm increases rapidly with the number of scheduling iterations. To address this problem, a single-iteration scheduling algorithm called D-LQF is designed, in which exhaustive service policy is adopted for reusing the matched input-output pairs in the previous time slots to grow the match size. Unlike an input-queued switch, a load-balanced switch consists of two stages of crossbar switch fabrics, where load balancing is carried out in both time and space domains. Among various load-balanced switches, the feedback-based switch gives the best delay-throughput performance. In this thesis, the feedback-based switch is enhanced in three aspects. Firstly, we focus on reducing its switch fabric complexity. Instead of using crossbars, a dual-banyan network is proposed. The complexity of dual-banyan can be further reduced by merging the two banyans to form a Clos network, resulting in a Clos-banyan network. Secondly, we target at improving the delay performance of the feedback-based switch. A Clos-feedback switch architecture is devised where each switch module in the Clos network is a small feedback-based switch. With application-flow based load balancing, packet order is ensured and the average packet delay is reduced from O(N) to O(n), where N and n are the switch and switch module sizes, respectively. Thirdly, we extend the feedback-based switch to support multicast traffic. Based on the notion of pointer-based multicast VOQ, an efficient multicast scheduling algorithm with packet replication at the middle-stage ports only is proposed. In order to provide close-to-100% throughput for any admissible multicast traffic patterns, a three-stage implementation of feedback-based switch is also designed. In designing load balancing schemes for data centers, we focus on the most popular fat-tree based data centers. Notably, packet-based load balancing is widely considered infeasible for data centers. This is because the associated packet out-of-order problem will cause unnecessary TCP fast retransmits, and as a result, severely undermine TCP performance. In this thesis, we show that if packet-based load balancing is performed properly, the packet out-of-order problem can be easily addressed by slightly increasing the number of duplicate ACKs required for triggering fast retransmit. Admittedly, in case of a real packet loss, the loss recovery time will be increased. But our simulation results show that such an increase is far less than the reduction in the network queueing delay (due to a better load-balanced network). As compared to a flow-based load balancing scheme, our packet-based scheme consistently provides significantly higher goodput and noticeably smaller delay. / published_or_final_version / Electrical and Electronic Engineering / Doctoral / Doctor of Philosophy

Page generated in 0.068 seconds