• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1930
  • 183
  • 182
  • 147
  • 36
  • 25
  • 25
  • 25
  • 25
  • 25
  • 24
  • 16
  • 11
  • 9
  • 7
  • Tagged with
  • 2841
  • 2841
  • 732
  • 632
  • 504
  • 494
  • 387
  • 331
  • 309
  • 297
  • 296
  • 289
  • 284
  • 276
  • 275
  • 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.
81

BCQ bin-based core stateless packet scheduler for scalable and flexible support of guaranteed services /

Parsha, Karthik P. Duan, Zhenhai. January 2005 (has links)
Thesis (M.S.)--Florida State University, 2005. / Advisor: Zhenhai Duan, Florida State University, College of Arts and Sciences, Dept. of Computer Science. Title and description from dissertation home page (viewed Jan. 26, 2006). Document formatted into pages; contains x, 50 pages. Includes bibliographical references.
82

Network-supported internet multicast congestion and error control

Zhang, Zaichen., 張在琛. January 2002 (has links)
published_or_final_version / Electrical and Electronic Engineering / Doctoral / Doctor of Philosophy
83

The market potential of local area networks in Hong Kong.

January 1986 (has links)
by Chan Kwok-sum, Mak Wai-sing. / Bibliography: leaves 85-86 / Thesis (M.B.A.)--Chinese University of Hong Kong, 1986
84

Providing resilient quality of service connections in provider-based virtual private networks

Rosenbaum, Gustav Filip, Computer Science & Engineering, Faculty of Engineering, UNSW January 2005 (has links)
This thesis focuses on efficient provisioning of resilient Virtual Private Network (VPN) services. It first confirms the intuition that network resources can be more efficiently utilized when resilience mechanisms are implemented by a network provider in the physical network than by its VPN customers in their VPNs. Next, a Multiprotocol Label Switching-based programmable VPN architecture is presented that delivers virtual links as resilient quality of service (QoS) connections and virtual sites. Virtual sites allow customers to implement functionality like customized routing and content adaptation ???in the cloud???, as opposed to the current network model where all functionality is implemented at the network edge. To provision a resilient QoS connection, two paths need to be computed from the ingress to the egress nodes, such that both paths meet the given QoS constraints. Two different frameworks have been proposed in the literature to compute resilient QoS connections when the QoS constraints are bandwidth and end-to-end delay. They both use a preprocessing step whereby either all links with less residual capacity than the given bandwidth constraint are pruned, or the given end-to-end delay is converted to an effective bandwidth. The frameworks thus reduce the problem to one with only a single constraint. We argue in this thesis that these frameworks individually lead to poor network utilization and propose a new framework where both constraints are considered simultaneously. Our framework exploits the dependency between endto- end delay, provisioned bandwidth and chosen path through using the provisioned bandwidth as a variable. Here, two link-disjoint paths are computed together with their respective minimum bandwidths such that both the bandwidth and end-to-end delay constraints are satisfied. Given our framework we first propose a new generic algorithm that decomposes the problem into subproblems where known algorithms can be applied. Then we propose two new linear programming (LP) formulations that return the two paths and their respective bandwidths such that they have the minimum combined cost. To make our framework applicable in a production environment, we develop two new algorithms with low run times that achieve even higher network performance than their LP formulation counterpart. These algorithms systematically use an algorithm that computes non-resilient QoS connections. As no algorithm for computing nonresilient QoS connections with sufficiently low run time has been proposed in the current literature we develop two new algorithms and their respective heuristics with a run time comparable to Dijkstra???s shortest-path algorithm. Our simulations show that exploiting the dependency between end-to-end delay, provisioned bandwidth and chosen path can significantly improve the network performance.
85

Scalable application-aware router mechanisms

Awad, Ashraf A. 01 December 2003 (has links)
No description available.
86

Between local and global : scale and boundary in the emerging network society /

Uncapher, Neil Willard, January 2000 (has links)
Thesis (Ph. D.)--University of Texas at Austin, 2000. / Vita. Includes bibliographical references (leaves 349-382). Available also in a digital version from Dissertation Abstracts.
87

Providing resilient quality of service connections in provider-based virtual private networks

Rosenbaum, Gustav Filip, Computer Science & Engineering, Faculty of Engineering, UNSW January 2005 (has links)
This thesis focuses on efficient provisioning of resilient Virtual Private Network (VPN) services. It first confirms the intuition that network resources can be more efficiently utilized when resilience mechanisms are implemented by a network provider in the physical network than by its VPN customers in their VPNs. Next, a Multiprotocol Label Switching-based programmable VPN architecture is presented that delivers virtual links as resilient quality of service (QoS) connections and virtual sites. Virtual sites allow customers to implement functionality like customized routing and content adaptation ???in the cloud???, as opposed to the current network model where all functionality is implemented at the network edge. To provision a resilient QoS connection, two paths need to be computed from the ingress to the egress nodes, such that both paths meet the given QoS constraints. Two different frameworks have been proposed in the literature to compute resilient QoS connections when the QoS constraints are bandwidth and end-to-end delay. They both use a preprocessing step whereby either all links with less residual capacity than the given bandwidth constraint are pruned, or the given end-to-end delay is converted to an effective bandwidth. The frameworks thus reduce the problem to one with only a single constraint. We argue in this thesis that these frameworks individually lead to poor network utilization and propose a new framework where both constraints are considered simultaneously. Our framework exploits the dependency between endto- end delay, provisioned bandwidth and chosen path through using the provisioned bandwidth as a variable. Here, two link-disjoint paths are computed together with their respective minimum bandwidths such that both the bandwidth and end-to-end delay constraints are satisfied. Given our framework we first propose a new generic algorithm that decomposes the problem into subproblems where known algorithms can be applied. Then we propose two new linear programming (LP) formulations that return the two paths and their respective bandwidths such that they have the minimum combined cost. To make our framework applicable in a production environment, we develop two new algorithms with low run times that achieve even higher network performance than their LP formulation counterpart. These algorithms systematically use an algorithm that computes non-resilient QoS connections. As no algorithm for computing nonresilient QoS connections with sufficiently low run time has been proposed in the current literature we develop two new algorithms and their respective heuristics with a run time comparable to Dijkstra???s shortest-path algorithm. Our simulations show that exploiting the dependency between end-to-end delay, provisioned bandwidth and chosen path can significantly improve the network performance.
88

Prospects for cyber deterrence

Moore, Ryan J. January 2008 (has links) (PDF)
Thesis (M.S. in Information Operations)--Naval Postgraduate School, December 2008. / Thesis Advisor(s): Arquilla, John J. ; Denning, Dorothy E. "December 2008." Description based on title screen as viewed on January 29, 2009. Includes bibliographical references (p. 77-83). Also available in print.
89

Intrusion detection in mobile adhoc networks /

Kumar, Kavitha. January 2009 (has links)
Thesis (M.S.)--University of Toledo, 2009. / Typescript. "Submitted to the Graduate Faculty as partial fulfillment of the requirements for the Master of Science Degree in Engineering." "A thesis entitled"--at head of title. Bibliography: leaves 80-84.
90

Direct online/offline digital signatures schemes

Yu, Ping. Tate, Stephen R., January 2008 (has links)
Thesis (Ph. D.)--University of North Texas, Dec., 2008. / Title from title page display. Includes bibliographical references.

Page generated in 0.1189 seconds