subject:(Computer networks)

Oregon State University

1. Albader, Bader. Some communication algorithms for Gaussian and Eisenstein-Jacobi networks.

Degree: PhD, Computer Science, 2009, Oregon State University

URL: http://hdl.handle.net/1957/11865

► Interconnection networks play important roles in designing high performance computers. Recently two new classes of interconnection networks based on the concept of Gaussian and Eisenstein-Jacobi… (more)

Subjects/Keywords: Computer networks

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Albader, B. (2009). Some communication algorithms for Gaussian and Eisenstein-Jacobi networks. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/11865

Chicago Manual of Style (16^th Edition):

Albader, Bader. “Some communication algorithms for Gaussian and Eisenstein-Jacobi networks.” 2009. Doctoral Dissertation, Oregon State University. Accessed April 11, 2021. http://hdl.handle.net/1957/11865.

MLA Handbook (7^th Edition):

Albader, Bader. “Some communication algorithms for Gaussian and Eisenstein-Jacobi networks.” 2009. Web. 11 Apr 2021.

Vancouver:

Albader B. Some communication algorithms for Gaussian and Eisenstein-Jacobi networks. [Internet] [Doctoral dissertation]. Oregon State University; 2009. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/1957/11865.

Council of Science Editors:

Albader B. Some communication algorithms for Gaussian and Eisenstein-Jacobi networks. [Doctoral Dissertation]. Oregon State University; 2009. Available from: http://hdl.handle.net/1957/11865

2. Subrahmanyam, J B V. Planning and optimization of unbalanced distribution networks.

Degree: Electrical Engineering, 2011, Jawaharlal Nehru Technological University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/3468

►

Over the last quarter of 20th century, many developments have been made in the power generation and major transmission networks optimization. For achieving this, digital… (more)

Subjects/Keywords: Computer networks

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Subrahmanyam, J. B. V. (2011). Planning and optimization of unbalanced distribution networks. (Thesis). Jawaharlal Nehru Technological University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/3468

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Subrahmanyam, J B V. “Planning and optimization of unbalanced distribution networks.” 2011. Thesis, Jawaharlal Nehru Technological University. Accessed April 11, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/3468.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Subrahmanyam, J B V. “Planning and optimization of unbalanced distribution networks.” 2011. Web. 11 Apr 2021.

Vancouver:

Subrahmanyam JBV. Planning and optimization of unbalanced distribution networks. [Internet] [Thesis]. Jawaharlal Nehru Technological University; 2011. [cited 2021 Apr 11]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/3468.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Subrahmanyam JBV. Planning and optimization of unbalanced distribution networks. [Thesis]. Jawaharlal Nehru Technological University; 2011. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/3468

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Oregon State University

3. Shamaei, Arash. Interconnection Networks Based on Gaussian and Eisenstein-Jacobi Integers.

Degree: PhD, Computer Science, 2015, Oregon State University

URL: http://hdl.handle.net/1957/57935

► Quotient rings of Gaussian and Eisenstein-Jacobi(EJ) integers can be deployed to construct interconnection networks with good topological properties. In this thesis, we propose deadlock-free deterministic… (more)

Subjects/Keywords: Interconnection networks; Computer networks

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Shamaei, A. (2015). Interconnection Networks Based on Gaussian and Eisenstein-Jacobi Integers. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/57935

Chicago Manual of Style (16^th Edition):

Shamaei, Arash. “Interconnection Networks Based on Gaussian and Eisenstein-Jacobi Integers.” 2015. Doctoral Dissertation, Oregon State University. Accessed April 11, 2021. http://hdl.handle.net/1957/57935.

MLA Handbook (7^th Edition):

Shamaei, Arash. “Interconnection Networks Based on Gaussian and Eisenstein-Jacobi Integers.” 2015. Web. 11 Apr 2021.

Vancouver:

Shamaei A. Interconnection Networks Based on Gaussian and Eisenstein-Jacobi Integers. [Internet] [Doctoral dissertation]. Oregon State University; 2015. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/1957/57935.

Council of Science Editors:

Shamaei A. Interconnection Networks Based on Gaussian and Eisenstein-Jacobi Integers. [Doctoral Dissertation]. Oregon State University; 2015. Available from: http://hdl.handle.net/1957/57935

4. Liu, Ying, 1984-. Robustness in ad hoc networks.

Degree: PhD, Electrical and Computer Engineering, 2017, Rutgers University

URL: https://rucore.libraries.rutgers.edu/rutgers-lib/55568/

►

Investigating the resilience of wireless network is critical since a network is susceptible to many types disturbances, ranging from natural (e.g. wind, building, hill, mobility)… (more)

▼

Investigating the resilience of wireless network is critical since a network is susceptible to many types disturbances, ranging from natural (e.g. wind, building, hill, mobility) to adversarial (e.g. jamming, eavesdropping, denial of service). The notion of network resilience describes a network's ability to recover its structure should damages occur when one or more terminals are shut down or whenever sensitive information is compromised due to impersonating adversaries. This thesis addresses the following three problems related to the reduction of robustness in an ad hoc network: (1) The backtracking problem in overlay networking, which occurs during packet delivery. This condition forces a packet to traverse an extended distance due to the lack of network-layer information being fully shared with the overlay routing functions. With the presence of backtracking, the packet delivery error rate increases in relation with the traversal distance; (2) The black hole problem, which is characterized by the network being punctured, such as is caused by a jammer emitting format-compliant packets in an attempt to overflow a legitimate node's buffer. As a consequence, targeted nodes are segregated from the rest of network; (3) The reduced connectivity problem, which results from a repetitive jamming attack where the weakest link or node is selected by the jammer to be attacked. In this thesis, the first problem is solved by redesigning an overlay routing protocol to be aware of the geographical location of cluster heads. The overlay hash table is re-organized in an order based on distance. The second problem is solved in two different ways: First, a method is presented that locates the jammer's approximate position. Reinforcement learning is applied at each node to learn the possible position of the jammer. The node's judgment is propagated by the routing protocol to interactively exchange the belief about the attacker's position. Second, a power control approach that is being used by wireless nodes is presented that adjusts the transmission power dynamically according to the Fiedler value, which is inferred from topology information carried inherently in the Optimized Link State Routing (OLSR) Protocol. By varying the radio range, packet flows can bypass the jamming area after topology transformation, making the network more resilient. The third problem is approached by developing a better mathematical understanding of connectivity when facing interference, which is achieved by analyzing the achievable throughput based on connectivity. A metric that measures the throughput and weighted throughput connectivity is introduced. Then, the connectivity issue under a jamming attack is solved by applying stochastic game theory to analyze the utility of connectivity and the interactive behaviors of both the jammer and the scanner. An optimal scanning strategy is designed to defend against repetitive jamming attacks involving different intents, and to strengthen the network connectivity at the same time.

Advisors/Committee Members: Trappe, Wade (chair), Lindqvist, Janne (internal member), Zhang, Yanyong (internal member), Kaya, Aliye Ozge (outside member), School of Graduate Studies.

Subjects/Keywords: Ad hoc networks (Computer networks)

10 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Liu, Ying, 1. (2017). Robustness in ad hoc networks. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/55568/

Chicago Manual of Style (16^th Edition):

Liu, Ying, 1984-. “Robustness in ad hoc networks.” 2017. Doctoral Dissertation, Rutgers University. Accessed April 11, 2021. https://rucore.libraries.rutgers.edu/rutgers-lib/55568/.

MLA Handbook (7^th Edition):

Liu, Ying, 1984-. “Robustness in ad hoc networks.” 2017. Web. 11 Apr 2021.

Vancouver:

Liu, Ying 1. Robustness in ad hoc networks. [Internet] [Doctoral dissertation]. Rutgers University; 2017. [cited 2021 Apr 11]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/55568/.

Council of Science Editors:

Liu, Ying 1. Robustness in ad hoc networks. [Doctoral Dissertation]. Rutgers University; 2017. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/55568/

University of Johannesburg

5. Van As, Benjamin Daniel. The internet as a strategic business management tool.

Degree: 2012, University of Johannesburg

URL: http://hdl.handle.net/10210/5662

►

M.Comm.

This study was conducted with the intent of understanding and evaluating the commercial use and possibilities that the Internet offers, as well as the… (more)

Subjects/Keywords: Business enterprises - Computer networks; Intranets (Computer networks); Extranets (Computer networks); Local area networks (Computer networks); Wide area networks (Computer networks)

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Van As, B. D. (2012). The internet as a strategic business management tool. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/5662

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Van As, Benjamin Daniel. “The internet as a strategic business management tool.” 2012. Thesis, University of Johannesburg. Accessed April 11, 2021. http://hdl.handle.net/10210/5662.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Van As, Benjamin Daniel. “The internet as a strategic business management tool.” 2012. Web. 11 Apr 2021.

Vancouver:

Van As BD. The internet as a strategic business management tool. [Internet] [Thesis]. University of Johannesburg; 2012. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/10210/5662.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Van As BD. The internet as a strategic business management tool. [Thesis]. University of Johannesburg; 2012. Available from: http://hdl.handle.net/10210/5662

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Michigan State University

6. Khakpour, Amir Reza. Network reachability : quantification, verification, troubleshooting, and optimization.

Degree: 2012, Michigan State University

URL: http://etd.lib.msu.edu/islandora/object/etd:88

►

Thesis Ph. D. Michigan State University, Computer Science and Engineering 2012.

Quantifying, verifying, troubleshooting, and optimizing the network reachability is essential for network management and… (more)

▼

Thesis Ph. D. Michigan State University, Computer Science and Engineering 2012.

Quantifying, verifying, troubleshooting, and optimizing the network reachability is essential for network management and network security monitoring as well as various aspects of network auditing, maintenance, and design. Although attempts to model network reachability have been made, feasible solutions for computing, maintaining and optimally designing network reachability have remained unknown. Network reachability control is very critical because, on one hand, reachability errors can cause network security breaches or service outages, leading to millions of dollars of revenue loss for an enterprise network. On the other hand, network operators suffer from lack of tools that thoroughly examine network access control configurations and audit them to avoid such errors. Besides, finding reachability errors is by no means easy. The access control rules, by which network reachability is restricted, are often very complex and manually troubleshooting them is extremely difficult. Hence, having a tool that finds the reachability errors and fix them automatically can be very useful. Furthermore, flawed network reachability design and deployment can degrade the network performance significantly. Thus, it is crucial to have a tool that designs the network configurations such that they have the least performance impact on the enterprise network.In this dissertation, we first present a network reachability model that considers connectionless and connection-oriented transport protocols, stateless and stateful routers/firewalls, static and dynamic NAT, PAT, IP tunneling, etc. We then propose a suite of algorithms for quantifying reachability based on network configurations (mainly access control lists (ACLs)) as well as solutions for querying network reachability. We further extend our algorithms and data structures for detecting reachability errors, pinpointing faulty access control lists, and fixing them automatically and efficiently. Finally, we propose algorithms to place rules on network devices optimally so that they satisfy the networks central access policies. To this end, we define correctness and performance criteria for rule placement and in turn propose cost-based algorithms with adjustable parameters (for the network operators) to place rules such that the correctness and performance criteria are satisfied.We implemented the algorithms in our network reachability tool called Quarnet and conducted experiments on a university network. Experimental results show that the offline computation of reachability matrices takes a few hours and the online processing of a reachability query takes 75 milliseconds on average. We also examine our reachability error detection and correction algorithms on a few real-life networks to examine their performance and ensure that Quarnet is efficient enough to be practically useful. The results indicate that we can find reachability errors in order of minutes and fix them in order of seconds depending on the…

Advisors/Committee Members: Liu, Alex X, Xiao, Li, Radha, Heydar, Liu, Alex, Esfahanian, Abdol H.

Subjects/Keywords: Computer networks; Computer networks – Access control; Computer networks – Management; Computer networks – Security measures; Computer science

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Khakpour, A. R. (2012). Network reachability : quantification, verification, troubleshooting, and optimization. (Thesis). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:88

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Khakpour, Amir Reza. “Network reachability : quantification, verification, troubleshooting, and optimization.” 2012. Thesis, Michigan State University. Accessed April 11, 2021. http://etd.lib.msu.edu/islandora/object/etd:88.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Khakpour, Amir Reza. “Network reachability : quantification, verification, troubleshooting, and optimization.” 2012. Web. 11 Apr 2021.

Vancouver:

Khakpour AR. Network reachability : quantification, verification, troubleshooting, and optimization. [Internet] [Thesis]. Michigan State University; 2012. [cited 2021 Apr 11]. Available from: http://etd.lib.msu.edu/islandora/object/etd:88.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Khakpour AR. Network reachability : quantification, verification, troubleshooting, and optimization. [Thesis]. Michigan State University; 2012. Available from: http://etd.lib.msu.edu/islandora/object/etd:88

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Drexel University

7. Thai, Peter. Packet-level QoS over RPL: routing protocol for low-power and Lossy networks.

Degree: 2011, Drexel University

URL: http://hdl.handle.net/1860/3741

►

Low-power and Lossy Networks (LLN) are composed of embedded devices constrained by computation capability, memory capacity, communication bandwidth, energy supply, and also node and link… (more)

Subjects/Keywords: Computer science; Lossy networks; Computer networks

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Thai, P. (2011). Packet-level QoS over RPL: routing protocol for low-power and Lossy networks. (Thesis). Drexel University. Retrieved from http://hdl.handle.net/1860/3741

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Thai, Peter. “Packet-level QoS over RPL: routing protocol for low-power and Lossy networks.” 2011. Thesis, Drexel University. Accessed April 11, 2021. http://hdl.handle.net/1860/3741.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Thai, Peter. “Packet-level QoS over RPL: routing protocol for low-power and Lossy networks.” 2011. Web. 11 Apr 2021.

Vancouver:

Thai P. Packet-level QoS over RPL: routing protocol for low-power and Lossy networks. [Internet] [Thesis]. Drexel University; 2011. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/1860/3741.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Thai P. Packet-level QoS over RPL: routing protocol for low-power and Lossy networks. [Thesis]. Drexel University; 2011. Available from: http://hdl.handle.net/1860/3741

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

8. Alasmar, Mohammed. Understanding the characteristics of Internet traffic and designing an efficient RaptorQ-based data transport protocol for modern data centres.

Degree: PhD, 2019, University of Sussex

URL: http://sro.sussex.ac.uk/id/eprint/89371/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.801030

► This thesis is the amalgamation of research on efficient data transport protocols for data centres and a comprehensive and systematic study of Internet traffic, which… (more)

▼ This thesis is the amalgamation of research on efficient data transport protocols for data centres and a comprehensive and systematic study of Internet traffic, which came as a result of the need to understand traffic patterns and workloads in modern computer networks. The first part of the thesis is on the development of efficient data transport pro- tocols for data centres. We study modern data transport protocols for data centres through large scale simulations using the OMNeT++ simulator. We developed and experimented with an OMNeT++ model of NDP. This has led to the identification of limitations of the state of the art and the formulation of research questions with respect to data transport protocols for modern data centres. The developed model includes an implementation of a Fat-tree topology and per-packet ECMP load bal- ancing. We discuss how we integrated the model with the INET Framework and validated it by running various experiments that test different model parameters and components. This work revealed limitations of NDP with respect to efficient one-to-many and many-to-one communication in data centres, which led to the de- velopment of SCDP, a novel and general-purpose data transport protocol for data centres that, in contrast to all other protocols proposed to date, natively supports one-to-many and many-to-one data communication, which is extremely common in modern data centres. SCDP does so without compromising on efficiency for short and long unicast flows. SCDP achieves this by integrating RaptorQ codes with receiver-driven data transport, in-network packet trimming and Multi-Level Feed- back Queuing (MLFQ); (1) RaptorQ codes enable efficient one-to-many and many- to-one data transport; (2) on top of RaptorQ codes, receiver- driven flow control, in combination with in-network packet trimming, enable efficient usage of network re- sources as well as multi-path transport and packet spraying for all transport modes. Incast and Outcast are eliminated; (3) the systematic nature of RaptorQ codes, in combination with MLFQ, enable fast, decoding-free completion of short flows. We extensively evaluated SCDP in a wide range of simulated scenarios with realistic data centre workloads. For one-to-many and many-to-one transport sessions, SCDP performs significantly better than NDP. For short and long unicast flows, SCDP performs equally well or better compared to NDP. In the second part of the thesis, we extensively study Internet traffic. Getting good statistical models of traffic on network links is a well-known, often-studied problem. A lot of attention has been given to correlation patterns and flow duration. The distribution of the amount of traffic per unit time is an equally important but less studied problem. We study a large number of traffic traces from many different networks including academic, commercial and residential networks using state-of-the-art statistical techniques. We show that the log-normal distribution is a better fit than the Gaussian distribution. We also investigate a second,…

Subjects/Keywords: TK5105.5 Computer networks

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Alasmar, M. (2019). Understanding the characteristics of Internet traffic and designing an efficient RaptorQ-based data transport protocol for modern data centres. (Doctoral Dissertation). University of Sussex. Retrieved from http://sro.sussex.ac.uk/id/eprint/89371/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.801030

Chicago Manual of Style (16^th Edition):

Alasmar, Mohammed. “Understanding the characteristics of Internet traffic and designing an efficient RaptorQ-based data transport protocol for modern data centres.” 2019. Doctoral Dissertation, University of Sussex. Accessed April 11, 2021. http://sro.sussex.ac.uk/id/eprint/89371/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.801030.

MLA Handbook (7^th Edition):

Alasmar, Mohammed. “Understanding the characteristics of Internet traffic and designing an efficient RaptorQ-based data transport protocol for modern data centres.” 2019. Web. 11 Apr 2021.

Vancouver:

Alasmar M. Understanding the characteristics of Internet traffic and designing an efficient RaptorQ-based data transport protocol for modern data centres. [Internet] [Doctoral dissertation]. University of Sussex; 2019. [cited 2021 Apr 11]. Available from: http://sro.sussex.ac.uk/id/eprint/89371/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.801030.

Council of Science Editors:

Alasmar M. Understanding the characteristics of Internet traffic and designing an efficient RaptorQ-based data transport protocol for modern data centres. [Doctoral Dissertation]. University of Sussex; 2019. Available from: http://sro.sussex.ac.uk/id/eprint/89371/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.801030

9. Messager, Antoine. Functional connectivity inference from time-series of events and application to computer networks.

Degree: PhD, 2020, University of Sussex

URL: http://sro.sussex.ac.uk/id/eprint/91098/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.804985

► Today's commercial and Internet Service Provider's networks are large, heterogeneous, fast-evolving and commonly emit millions of events per second. Monitoring, responding to, and predicting incidents… (more)

▼ Today's commercial and Internet Service Provider's networks are large, heterogeneous, fast-evolving and commonly emit millions of events per second. Monitoring, responding to, and predicting incidents is a key challenge for network management operators. This thesis argues that the concept of functional connectivity, widely used in neuroscience and defined in terms of the presence of statistical dependencies between nodes, can unlock informational value about event logs and assist operators in identifying (and even predicting) service outages. However, existing functional connectivity inference methods are not adapted to event data from computer networks. These methods may either require unavailable models of event propagation, be computationally too costly for large networks and/or long recordings, be not adapted to sparse and discrete activity, and/or assume a static network topology. We thus first describe in depth a major commercial network to highlight the challenges faced by network operators and the opportunities offered by thinking in terms of functional connectivities. Next, using a pair of independent Bernoulli processes as reference, we develop a new statistic aimed at measuring coupling strength by quantifying deviation from independence. However, because many statistics will be large by chance, identifying functional edges from the distribution of statistics over every pair of nodes is challenging. Hence, we then develop a method that infers, in specific contexts, the function that associates each statistic to the probability it accounts for the presence of a functional edge. Next, using the previously described statistic, we propose a novel framework to infer a time-varying functional topology from the time-series of emitted events. Applying this paradigm to two major commercial networks, we show that it can reveal a priori unknown groups of devices providing particular services. Finally, we argue that this thesis has implications beyond assisting network monitoring, such as enabling more robust inference of functional connectivity in neuroscience.

Subjects/Keywords: TK5105.5 Computer networks

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Messager, A. (2020). Functional connectivity inference from time-series of events and application to computer networks. (Doctoral Dissertation). University of Sussex. Retrieved from http://sro.sussex.ac.uk/id/eprint/91098/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.804985

Chicago Manual of Style (16^th Edition):

Messager, Antoine. “Functional connectivity inference from time-series of events and application to computer networks.” 2020. Doctoral Dissertation, University of Sussex. Accessed April 11, 2021. http://sro.sussex.ac.uk/id/eprint/91098/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.804985.

MLA Handbook (7^th Edition):

Messager, Antoine. “Functional connectivity inference from time-series of events and application to computer networks.” 2020. Web. 11 Apr 2021.

Vancouver:

Messager A. Functional connectivity inference from time-series of events and application to computer networks. [Internet] [Doctoral dissertation]. University of Sussex; 2020. [cited 2021 Apr 11]. Available from: http://sro.sussex.ac.uk/id/eprint/91098/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.804985.

Council of Science Editors:

Messager A. Functional connectivity inference from time-series of events and application to computer networks. [Doctoral Dissertation]. University of Sussex; 2020. Available from: http://sro.sussex.ac.uk/id/eprint/91098/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.804985

10. Zhong, Weisong. Consensus analysis and synthesis of networked multi-agent systems.

Degree: PhD, 2012, University of South Wales

URL: https://pure.southwales.ac.uk/en/studentthesis/consensus-analysis-and-synthesis-of-networked-multiagent-systems(2796462c-048b-450e-ba7a-0fcbb9f4872f).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581437

► As one of the major fields, Networked Multi-Agent Systems (NMAS), which deals with the study of how network architecture and interactions among network components influence… (more)

▼ As one of the major fields, Networked Multi-Agent Systems (NMAS), which deals with the study of how network architecture and interactions among network components influence global control goals, has received widely attention across science and engineering. A usual problem that appears in the coordination of NMAS is the consensus problem, i.e., given initial values (scalar or vector) of agents, establish conditions under which through local interactions and computations, the agents asymptotically achieve some kind of agreement, such as control of mobile vehicles, information processing in sensor networks and design of distributed algorithms. Researches mainly focused on the analysis of NMAS consensus in the past, the interconnection topology and some consensus algorithms were given in advance and the relevant research objective was to verify whether the states of all agents converge to some common value. Agents with single integrator dynamics, double integrator dynamics or more complicated dynamics are the present research emphasis. In addition, most of present research activities focus on theoretical study of consensus problems based on relatively simple simulation experiments, but it will still be a key element of research in the future. Although it is more complicated to consider consensus problems for a team of agents with more complex nonlinear dynamics and even heterogenous dynamics, such kind of problems are very important. To the best of our knowledge,there are few effective results on this topic. Usually, no common equilibrium for all agents exists even if each isolated agent has an equilibrium, but an NMAS with non-identical agents may still exhibit some consensus behaviors which are from being fully understood. Certain reasonable and satisfactory boundedness of state motion errors between different agents can be taken as useful consensus properties. This thesis focuses on the global consensus problems of NMAS consisting of identical or non-identical agent dynamics, and the proposed consensus property is formulated in terms of certain boundedness of state errors. Moreover, on special occasions, we still investigate their exact consensus conditions. Compared with many existing results, the thesis makes several significant contributions. Firstly, we generalize the related results for the case of identical agent dynamics to the case of non-identical agent dynamics and the proposed results cover the existing criteria of networks with identical agent dynamics as special cases. Secondly, we consider the communication delay among the agents, global consensus criteria are given based on solving a number of lower dimensional matrix inequalities and scalar inequalities, which generalize the criteria using the method of the master stability function for NMAS with identical agents. Finally, globally bounded consensus conditions for both delay-independent and delay-dependent conditions based on the Lyapunov-Krasovskii functional method are derived.

Subjects/Keywords: 004.65; Computer networks

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Zhong, W. (2012). Consensus analysis and synthesis of networked multi-agent systems. (Doctoral Dissertation). University of South Wales. Retrieved from https://pure.southwales.ac.uk/en/studentthesis/consensus-analysis-and-synthesis-of-networked-multiagent-systems(2796462c-048b-450e-ba7a-0fcbb9f4872f).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581437

Chicago Manual of Style (16^th Edition):

Zhong, Weisong. “Consensus analysis and synthesis of networked multi-agent systems.” 2012. Doctoral Dissertation, University of South Wales. Accessed April 11, 2021. https://pure.southwales.ac.uk/en/studentthesis/consensus-analysis-and-synthesis-of-networked-multiagent-systems(2796462c-048b-450e-ba7a-0fcbb9f4872f).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581437.

MLA Handbook (7^th Edition):

Zhong, Weisong. “Consensus analysis and synthesis of networked multi-agent systems.” 2012. Web. 11 Apr 2021.

Vancouver:

Zhong W. Consensus analysis and synthesis of networked multi-agent systems. [Internet] [Doctoral dissertation]. University of South Wales; 2012. [cited 2021 Apr 11]. Available from: https://pure.southwales.ac.uk/en/studentthesis/consensus-analysis-and-synthesis-of-networked-multiagent-systems(2796462c-048b-450e-ba7a-0fcbb9f4872f).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581437.

Council of Science Editors:

Zhong W. Consensus analysis and synthesis of networked multi-agent systems. [Doctoral Dissertation]. University of South Wales; 2012. Available from: https://pure.southwales.ac.uk/en/studentthesis/consensus-analysis-and-synthesis-of-networked-multiagent-systems(2796462c-048b-450e-ba7a-0fcbb9f4872f).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581437

University of Hawaii – Manoa

11. Liu, Xiaojiang. Maximizing network resource utilization through dynamic delay allocation adjustment.

Degree: MS, 2011, University of Hawaii – Manoa

URL: http://hdl.handle.net/10125/20567

►

ix, 73 leaves, bound ill. 29 cm

Quality of Service (QoS) has been an important topic in network research, and many solutions have been proposed… (more)

Subjects/Keywords: Routers (Computer networks)

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Liu, X. (2011). Maximizing network resource utilization through dynamic delay allocation adjustment. (Masters Thesis). University of Hawaii – Manoa. Retrieved from http://hdl.handle.net/10125/20567

Chicago Manual of Style (16^th Edition):

Liu, Xiaojiang. “Maximizing network resource utilization through dynamic delay allocation adjustment.” 2011. Masters Thesis, University of Hawaii – Manoa. Accessed April 11, 2021. http://hdl.handle.net/10125/20567.

MLA Handbook (7^th Edition):

Liu, Xiaojiang. “Maximizing network resource utilization through dynamic delay allocation adjustment.” 2011. Web. 11 Apr 2021.

Vancouver:

Liu X. Maximizing network resource utilization through dynamic delay allocation adjustment. [Internet] [Masters thesis]. University of Hawaii – Manoa; 2011. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/10125/20567.

Council of Science Editors:

Liu X. Maximizing network resource utilization through dynamic delay allocation adjustment. [Masters Thesis]. University of Hawaii – Manoa; 2011. Available from: http://hdl.handle.net/10125/20567

12. Klimis, Vasileios. Abstractions and optimisations for model-checking software-defined networks.

Degree: PhD, 2021, University of Sussex

URL: http://sro.sussex.ac.uk/id/eprint/97027/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.823784

► Software-Defined Networking introduces a new programmatic abstraction layer by shifting the distributed network functions (NFs) from silicon chips (ASICs) to a logically centralized (controller) program.… (more)

Subjects/Keywords: TK5105.5 Computer networks

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Klimis, V. (2021). Abstractions and optimisations for model-checking software-defined networks. (Doctoral Dissertation). University of Sussex. Retrieved from http://sro.sussex.ac.uk/id/eprint/97027/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.823784

Chicago Manual of Style (16^th Edition):

Klimis, Vasileios. “Abstractions and optimisations for model-checking software-defined networks.” 2021. Doctoral Dissertation, University of Sussex. Accessed April 11, 2021. http://sro.sussex.ac.uk/id/eprint/97027/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.823784.

MLA Handbook (7^th Edition):

Klimis, Vasileios. “Abstractions and optimisations for model-checking software-defined networks.” 2021. Web. 11 Apr 2021.

Vancouver:

Klimis V. Abstractions and optimisations for model-checking software-defined networks. [Internet] [Doctoral dissertation]. University of Sussex; 2021. [cited 2021 Apr 11]. Available from: http://sro.sussex.ac.uk/id/eprint/97027/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.823784.

Council of Science Editors:

Klimis V. Abstractions and optimisations for model-checking software-defined networks. [Doctoral Dissertation]. University of Sussex; 2021. Available from: http://sro.sussex.ac.uk/id/eprint/97027/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.823784

Bond University

13. Carter, Matt. Enabling Workspace Transference : a Cross-Environment Framework for Application and Data Portability.

Degree: 2012, Bond University

URL: https://epublications.bond.edu.au/theses/65

► Workspace transference is defined as the transportation of applications and associated data between different computer environments regardless of hardware, operating systems or networks. Existing research… (more)

Subjects/Keywords: Computer networks; Computer Science (0984)

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Carter, M. (2012). Enabling Workspace Transference : a Cross-Environment Framework for Application and Data Portability. (Thesis). Bond University. Retrieved from https://epublications.bond.edu.au/theses/65

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Carter, Matt. “Enabling Workspace Transference : a Cross-Environment Framework for Application and Data Portability.” 2012. Thesis, Bond University. Accessed April 11, 2021. https://epublications.bond.edu.au/theses/65.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Carter, Matt. “Enabling Workspace Transference : a Cross-Environment Framework for Application and Data Portability.” 2012. Web. 11 Apr 2021.

Vancouver:

Carter M. Enabling Workspace Transference : a Cross-Environment Framework for Application and Data Portability. [Internet] [Thesis]. Bond University; 2012. [cited 2021 Apr 11]. Available from: https://epublications.bond.edu.au/theses/65.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Carter M. Enabling Workspace Transference : a Cross-Environment Framework for Application and Data Portability. [Thesis]. Bond University; 2012. Available from: https://epublications.bond.edu.au/theses/65

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Rutgers University

14. Srinivasan, Suja, 1897-. GNRS assisted inter-domain services in MobilityFirst future internet architecture.

Degree: MS, Electrical and Computer Engineering, 2016, Rutgers University

URL: https://rucore.libraries.rutgers.edu/rutgers-lib/51470/

► This thesis involves the design and evaluation of an extension to the Global Name Resolution Service (GNRS) of the MobilityFirst Future Internet Architecture (MF- FIA),… (more)

Subjects/Keywords: Computer networks; Computer network architectures

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Srinivasan, Suja, 1. (2016). GNRS assisted inter-domain services in MobilityFirst future internet architecture. (Masters Thesis). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/51470/

Chicago Manual of Style (16^th Edition):

Srinivasan, Suja, 1897-. “GNRS assisted inter-domain services in MobilityFirst future internet architecture.” 2016. Masters Thesis, Rutgers University. Accessed April 11, 2021. https://rucore.libraries.rutgers.edu/rutgers-lib/51470/.

MLA Handbook (7^th Edition):

Srinivasan, Suja, 1897-. “GNRS assisted inter-domain services in MobilityFirst future internet architecture.” 2016. Web. 11 Apr 2021.

Vancouver:

Srinivasan, Suja 1. GNRS assisted inter-domain services in MobilityFirst future internet architecture. [Internet] [Masters thesis]. Rutgers University; 2016. [cited 2021 Apr 11]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/51470/.

Council of Science Editors:

Srinivasan, Suja 1. GNRS assisted inter-domain services in MobilityFirst future internet architecture. [Masters Thesis]. Rutgers University; 2016. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/51470/

University of Aberdeen

15. Gibson, Michael Scott. A knowledge-based approach to multiplayer games on peer-to-peer networks.

Degree: PhD, 2015, University of Aberdeen

URL: https://abdn.alma.exlibrisgroup.com/view/delivery/44ABE_INST/12152557000005941 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.641468

► Peer-to-peer networks are types of computer networks where each computer (a peer) may have several direct communication channels with other computers. This is similar to… (more)

Subjects/Keywords: 004; Computer games; Computer networks

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Gibson, M. S. (2015). A knowledge-based approach to multiplayer games on peer-to-peer networks. (Doctoral Dissertation). University of Aberdeen. Retrieved from https://abdn.alma.exlibrisgroup.com/view/delivery/44ABE_INST/12152557000005941 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.641468

Chicago Manual of Style (16^th Edition):

Gibson, Michael Scott. “A knowledge-based approach to multiplayer games on peer-to-peer networks.” 2015. Doctoral Dissertation, University of Aberdeen. Accessed April 11, 2021. https://abdn.alma.exlibrisgroup.com/view/delivery/44ABE_INST/12152557000005941 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.641468.

MLA Handbook (7^th Edition):

Gibson, Michael Scott. “A knowledge-based approach to multiplayer games on peer-to-peer networks.” 2015. Web. 11 Apr 2021.

Vancouver:

Gibson MS. A knowledge-based approach to multiplayer games on peer-to-peer networks. [Internet] [Doctoral dissertation]. University of Aberdeen; 2015. [cited 2021 Apr 11]. Available from: https://abdn.alma.exlibrisgroup.com/view/delivery/44ABE_INST/12152557000005941 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.641468.

Council of Science Editors:

Gibson MS. A knowledge-based approach to multiplayer games on peer-to-peer networks. [Doctoral Dissertation]. University of Aberdeen; 2015. Available from: https://abdn.alma.exlibrisgroup.com/view/delivery/44ABE_INST/12152557000005941 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.641468

University of California – Santa Cruz

16. Thurlow, Lincoln. Analysis of Applicability and Usability of Programmable Networks in Modern Networks.

Degree: Computer Engineering, 2016, University of California – Santa Cruz

URL: http://www.escholarship.org/uc/item/5kr2g7vn

► Software-Defined Networking and Network Function Virtualization lack a unified solution for general network programmability. OpenFlow, Software-Defined Networking’s de-facto standard for network programmability, is based on… (more)

Subjects/Keywords: Computer engineering; Computer science; Computer Networks; Programmable Networks; Software Defined Networks

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Thurlow, L. (2016). Analysis of Applicability and Usability of Programmable Networks in Modern Networks. (Thesis). University of California – Santa Cruz. Retrieved from http://www.escholarship.org/uc/item/5kr2g7vn

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Thurlow, Lincoln. “Analysis of Applicability and Usability of Programmable Networks in Modern Networks.” 2016. Thesis, University of California – Santa Cruz. Accessed April 11, 2021. http://www.escholarship.org/uc/item/5kr2g7vn.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Thurlow, Lincoln. “Analysis of Applicability and Usability of Programmable Networks in Modern Networks.” 2016. Web. 11 Apr 2021.

Vancouver:

Thurlow L. Analysis of Applicability and Usability of Programmable Networks in Modern Networks. [Internet] [Thesis]. University of California – Santa Cruz; 2016. [cited 2021 Apr 11]. Available from: http://www.escholarship.org/uc/item/5kr2g7vn.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Thurlow L. Analysis of Applicability and Usability of Programmable Networks in Modern Networks. [Thesis]. University of California – Santa Cruz; 2016. Available from: http://www.escholarship.org/uc/item/5kr2g7vn

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Ryerson University

17. Sahai, Michael Ryan. An Energy Aware Trust Based Multipath Routing Scheme For Mobile Ad Hoc Networks.

Degree: 2013, Ryerson University

URL: https://digital.library.ryerson.ca/islandora/object/RULA%3A2309

► Message security in multi-hop infrastructure-less networks such as Mobile Ad Hoc Net- works has proven to be a challenging task. A number of trust-based secure… (more)

Subjects/Keywords: Ad hoc networks (Computer networks) – Security measures; Ad hoc networks (Computer networks) – Quality control; Ad hoc networks (Computer networks) – Energy consumption

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Sahai, M. R. (2013). An Energy Aware Trust Based Multipath Routing Scheme For Mobile Ad Hoc Networks. (Thesis). Ryerson University. Retrieved from https://digital.library.ryerson.ca/islandora/object/RULA%3A2309

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Sahai, Michael Ryan. “An Energy Aware Trust Based Multipath Routing Scheme For Mobile Ad Hoc Networks.” 2013. Thesis, Ryerson University. Accessed April 11, 2021. https://digital.library.ryerson.ca/islandora/object/RULA%3A2309.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Sahai, Michael Ryan. “An Energy Aware Trust Based Multipath Routing Scheme For Mobile Ad Hoc Networks.” 2013. Web. 11 Apr 2021.

Vancouver:

Sahai MR. An Energy Aware Trust Based Multipath Routing Scheme For Mobile Ad Hoc Networks. [Internet] [Thesis]. Ryerson University; 2013. [cited 2021 Apr 11]. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A2309.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sahai MR. An Energy Aware Trust Based Multipath Routing Scheme For Mobile Ad Hoc Networks. [Thesis]. Ryerson University; 2013. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A2309

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Ryerson University

18. Kumar, Rishabh. Performance Evaluation Of 802.11P Vanets With Different Duty Cycles.

Degree: 2011, Ryerson University

URL: https://digital.library.ryerson.ca/islandora/object/RULA%3A2407

► With the improvement in technology, the number of vehicles on the roads has increased tremendously over the last decade. As large numbers of vehicles are… (more)

Subjects/Keywords: Vehicular ad hoc networks (Computer networks); Vehicular ad hoc networks (Computer networks) – Evaluation; Vehicular ad hoc networks (Computer networks) – Simulation methods

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Kumar, R. (2011). Performance Evaluation Of 802.11P Vanets With Different Duty Cycles. (Thesis). Ryerson University. Retrieved from https://digital.library.ryerson.ca/islandora/object/RULA%3A2407

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Kumar, Rishabh. “Performance Evaluation Of 802.11P Vanets With Different Duty Cycles.” 2011. Thesis, Ryerson University. Accessed April 11, 2021. https://digital.library.ryerson.ca/islandora/object/RULA%3A2407.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Kumar, Rishabh. “Performance Evaluation Of 802.11P Vanets With Different Duty Cycles.” 2011. Web. 11 Apr 2021.

Vancouver:

Kumar R. Performance Evaluation Of 802.11P Vanets With Different Duty Cycles. [Internet] [Thesis]. Ryerson University; 2011. [cited 2021 Apr 11]. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A2407.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kumar R. Performance Evaluation Of 802.11P Vanets With Different Duty Cycles. [Thesis]. Ryerson University; 2011. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A2407

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Cape Peninsula University of Technology

19. Gone, Thomas Alwala. Content distribution framework for wireless mesh networks : an information-centric approach .

Degree: 2017, Cape Peninsula University of Technology

URL: http://etd.cput.ac.za/handle/20.500.11838/2647

► Information Centric Networking (ICN) is an emerging research field that aims to replace the current host-centric model of Content distribution on the Internet. In ICN… (more)

Subjects/Keywords: Wireless communication systems; Gateways (Computer networks); Computer networks; Information networks

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Gone, T. A. (2017). Content distribution framework for wireless mesh networks : an information-centric approach . (Thesis). Cape Peninsula University of Technology. Retrieved from http://etd.cput.ac.za/handle/20.500.11838/2647

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Gone, Thomas Alwala. “Content distribution framework for wireless mesh networks : an information-centric approach .” 2017. Thesis, Cape Peninsula University of Technology. Accessed April 11, 2021. http://etd.cput.ac.za/handle/20.500.11838/2647.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Gone, Thomas Alwala. “Content distribution framework for wireless mesh networks : an information-centric approach .” 2017. Web. 11 Apr 2021.

Vancouver:

Gone TA. Content distribution framework for wireless mesh networks : an information-centric approach . [Internet] [Thesis]. Cape Peninsula University of Technology; 2017. [cited 2021 Apr 11]. Available from: http://etd.cput.ac.za/handle/20.500.11838/2647.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Gone TA. Content distribution framework for wireless mesh networks : an information-centric approach . [Thesis]. Cape Peninsula University of Technology; 2017. Available from: http://etd.cput.ac.za/handle/20.500.11838/2647

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Rhodes University

20. Igumbor, Osedum Peter. A proxy approach to protocol interoperability within digital audio networks.

Degree: Faculty of Science, Computer Science, 2010, Rhodes University

URL: http://hdl.handle.net/10962/d1004852

► Digital audio networks are becoming the preferred solution for the interconnection of professional audio devices. Prominent amongst their advantages are: reduced noise interference, signal multiplexing,… (more)

▼ Digital audio networks are becoming the preferred solution for the interconnection of professional audio devices. Prominent amongst their advantages are: reduced noise interference, signal multiplexing, and a reduction in the number of cables connecting networked devices. In the context of professional audio, digital networks have been used to connect devices including: mixers, effects units, preamplifiers, breakout boxes, computers, monitoring controllers, and synthesizers. Such networks are governed by protocols that define the connection management rocedures, and device synchronization processes of devices that conform to the protocols. A wide range of digital audio network control protocols exist, each defining specific hardware requirements of devices that conform to them. Device parameter control is achieved by sending a protocol message that indicates the target parameter, and the action that should be performed on the parameter. Typically, a device will conform to only one protocol. By implication, only devices that conform to a specific protocol can communicate with each other, and only a controller that conforms to the protocol can control such devices. This results in the isolation of devices that conform to disparate protocols, since devices of different protocols cannot communicate with each other. This is currently a challenge in the professional music industry, particularly where digital networks are used for audio device control. This investigation seeks to resolve the issue of interoperability between professional audio devices that conform to different digital audio network protocols. This thesis proposes the use of a proxy that allows for the translation of protocol messages, as a solution to the interoperability problem. The proxy abstracts devices of one protocol in terms of another, hence allowing all the networked devices to appear as conforming to the same protocol. The proxy receives messages on behalf of the abstracted device, and then fulfills them in accordance with the protocol that the abstracted device conforms to. Any number of protocol devices can be abstracted within such a proxy. This has the added advantage of allowing a common controller to control devices that conform to the different protocols.

Subjects/Keywords: Digital communications; Local area networks (Computer networks); Computer sound processing; Computer networks; Computer network protocols

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Igumbor, O. P. (2010). A proxy approach to protocol interoperability within digital audio networks. (Thesis). Rhodes University. Retrieved from http://hdl.handle.net/10962/d1004852

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Igumbor, Osedum Peter. “A proxy approach to protocol interoperability within digital audio networks.” 2010. Thesis, Rhodes University. Accessed April 11, 2021. http://hdl.handle.net/10962/d1004852.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Igumbor, Osedum Peter. “A proxy approach to protocol interoperability within digital audio networks.” 2010. Web. 11 Apr 2021.

Vancouver:

Igumbor OP. A proxy approach to protocol interoperability within digital audio networks. [Internet] [Thesis]. Rhodes University; 2010. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/10962/d1004852.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Igumbor OP. A proxy approach to protocol interoperability within digital audio networks. [Thesis]. Rhodes University; 2010. Available from: http://hdl.handle.net/10962/d1004852

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Michigan State University

21. Hajiaghajani Memar, Faezeh. Economic gain-aware routing protocols for device-to-device content dissemination.

Degree: 2017, Michigan State University

URL: http://etd.lib.msu.edu/islandora/object/etd:6685

"The objective of this dissertation is to investigate Device-to-Device content dissemination protocols for maximizing the economic gain of dissemination for given combinations of commercial and network parameters. " – Abstract.

Online resource;

Advisors/Committee Members: Biswas, Subir, Deb, Kalyanmoy, Ofria, Charles, Ren, Jian.

Subjects/Keywords: Computer networks; Computer engineering; Computer science

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Hajiaghajani Memar, F. (2017). Economic gain-aware routing protocols for device-to-device content dissemination. (Thesis). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:6685

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Hajiaghajani Memar, Faezeh. “Economic gain-aware routing protocols for device-to-device content dissemination.” 2017. Thesis, Michigan State University. Accessed April 11, 2021. http://etd.lib.msu.edu/islandora/object/etd:6685.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Hajiaghajani Memar, Faezeh. “Economic gain-aware routing protocols for device-to-device content dissemination.” 2017. Web. 11 Apr 2021.

Vancouver:

Hajiaghajani Memar F. Economic gain-aware routing protocols for device-to-device content dissemination. [Internet] [Thesis]. Michigan State University; 2017. [cited 2021 Apr 11]. Available from: http://etd.lib.msu.edu/islandora/object/etd:6685.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hajiaghajani Memar F. Economic gain-aware routing protocols for device-to-device content dissemination. [Thesis]. Michigan State University; 2017. Available from: http://etd.lib.msu.edu/islandora/object/etd:6685

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Johannesburg

22. De Wet, Anton Petrus Christiaan. An incremental learning system for artificial neural networks.

Degree: 2014, University of Johannesburg

URL: http://hdl.handle.net/10210/12024

►

M.Ing. (Electrical And Electronic Engineering)

This dissertation describes the development of a system of Artificial Neural Networks that enables the incremental training of feed forward… (more)

Subjects/Keywords: Neural networks (Computer science); Artificial Neural Networks

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

De Wet, A. P. C. (2014). An incremental learning system for artificial neural networks. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/12024

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

De Wet, Anton Petrus Christiaan. “An incremental learning system for artificial neural networks.” 2014. Thesis, University of Johannesburg. Accessed April 11, 2021. http://hdl.handle.net/10210/12024.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

De Wet, Anton Petrus Christiaan. “An incremental learning system for artificial neural networks.” 2014. Web. 11 Apr 2021.

Vancouver:

De Wet APC. An incremental learning system for artificial neural networks. [Internet] [Thesis]. University of Johannesburg; 2014. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/10210/12024.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

De Wet APC. An incremental learning system for artificial neural networks. [Thesis]. University of Johannesburg; 2014. Available from: http://hdl.handle.net/10210/12024

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Deakin University

23. Alrubaiey, Baker. Assuring virtual network reliability and resilience.

Degree: School of Information Technology, 2016, Deakin University

URL: http://hdl.handle.net/10536/DRO/DU:30089365

► A framework developed that uses reliability block diagrams and continuous-time Markov chains to model and analyse the reliability and availability of a Virtual Network Environment… (more)

Subjects/Keywords: Virtual networks; Internet; Computer networks; Cloud computing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Alrubaiey, B. (2016). Assuring virtual network reliability and resilience. (Thesis). Deakin University. Retrieved from http://hdl.handle.net/10536/DRO/DU:30089365

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Alrubaiey, Baker. “Assuring virtual network reliability and resilience.” 2016. Thesis, Deakin University. Accessed April 11, 2021. http://hdl.handle.net/10536/DRO/DU:30089365.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Alrubaiey, Baker. “Assuring virtual network reliability and resilience.” 2016. Web. 11 Apr 2021.

Vancouver:

Alrubaiey B. Assuring virtual network reliability and resilience. [Internet] [Thesis]. Deakin University; 2016. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/10536/DRO/DU:30089365.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Alrubaiey B. Assuring virtual network reliability and resilience. [Thesis]. Deakin University; 2016. Available from: http://hdl.handle.net/10536/DRO/DU:30089365

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Hong Kong University of Science and Technology

24. Guo, Ziyang ECE. Cyber-physical systems security : a control-theoretic approach.

Degree: 2018, Hong Kong University of Science and Technology

URL: http://repository.ust.hk/ir/Record/1783.1-96011 ; https://doi.org/10.14711/thesis-991012637167503412 ; http://repository.ust.hk/ir/bitstream/1783.1-96011/1/th_redirect.html

► This thesis investigates security issues for remote state estimation in the context of cyber-physical systems. Different problems are studied from the perspective of either a… (more)

▼ This thesis investigates security issues for remote state estimation in the context of cyber-physical systems. Different problems are studied from the perspective of either a malicious attacker or a system designer. In the problem from the attacker's perspective, a sensor monitors a dynamic process and transmits its measurement to a remote estimator through a wireless network where a malicious attacker may intercept and modify the transmitted data. A false-data detector is adopted to monitor system behaviors and check data anomalies. We propose an innovation-based integrity attack and present the feasibility constraint which guarantees the attack stealthiness. Under the proposed attack, the recursion of the remote estimation error covariance is derived. A closed-form expression of the optimal attack strategy that maximizes the remote estimation error covariance is obtained. The problem is then generalized from the following two aspects. On the one hand, we consider an ∈-stealthy innovation-based integrity attack, where the Kullback-Leibler divergence is used as a stealthiness metric. Based on the evolution of remote estimation error covariance, a two-stage optimization problem is formulated to investigate the optimal attack strategy. We first prove that the optimal attack is Gaussian distributed and provide a closed-form expression of the corresponding covariance matrix. Then, the optimal attack is obtained by semi-definite programming. On the other hand, we consider an innovation-based integrity attack under different information sets. It is assumed that the attacker is not only able to compromise the transmitted data but also able to measure the system state itself. The attack strategy thus can be designed based on the intercepted data, the sensing data, or alternatively the combined information. For each attack scenario, we analyze the remote estimation performance and obtain the optimal attack strategy. For scalar systems, we further derive the closed-form expressions of the optimal attacks and compare the attack consequences between different information sets. The secure state estimation problem from the system's perspective is studied in a multi-sensor system. Suppose there are N sensors measuring the same dynamic process and a subset of the sensors can potentially be compromised by an attacker. To locate the compromised sensors and obtain a robust state estimate, we propose a Gaussian-mixture-model-based detection algorithm. It is able to cluster the local state estimate autonomously and provide a belief for each sensor, based on which measurements from different sensors can be fused accordingly. The performance of the proposed detection algorithm is evaluated by the remote estimation performance and the average belief. The applications of the proposed detection algorithm to other attack scenarios are also discussed.

Subjects/Keywords: Computer networks ; Security measures ; Wireless sensor networks

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Guo, Z. E. (2018). Cyber-physical systems security : a control-theoretic approach. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-96011 ; https://doi.org/10.14711/thesis-991012637167503412 ; http://repository.ust.hk/ir/bitstream/1783.1-96011/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Guo, Ziyang ECE. “Cyber-physical systems security : a control-theoretic approach.” 2018. Thesis, Hong Kong University of Science and Technology. Accessed April 11, 2021. http://repository.ust.hk/ir/Record/1783.1-96011 ; https://doi.org/10.14711/thesis-991012637167503412 ; http://repository.ust.hk/ir/bitstream/1783.1-96011/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Guo, Ziyang ECE. “Cyber-physical systems security : a control-theoretic approach.” 2018. Web. 11 Apr 2021.

Vancouver:

Guo ZE. Cyber-physical systems security : a control-theoretic approach. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2018. [cited 2021 Apr 11]. Available from: http://repository.ust.hk/ir/Record/1783.1-96011 ; https://doi.org/10.14711/thesis-991012637167503412 ; http://repository.ust.hk/ir/bitstream/1783.1-96011/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Guo ZE. Cyber-physical systems security : a control-theoretic approach. [Thesis]. Hong Kong University of Science and Technology; 2018. Available from: http://repository.ust.hk/ir/Record/1783.1-96011 ; https://doi.org/10.14711/thesis-991012637167503412 ; http://repository.ust.hk/ir/bitstream/1783.1-96011/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

25. Tahmasbi Arashloo, Mina. Stateful Programming of High-Speed Network Hardware .

Degree: PhD, 2019, Princeton University

URL: http://arks.princeton.edu/ark:/88435/dsp01fq977x65s

► Modern networks need to operate at speeds as high as 100Gbps while running sophisticated algorithms and protocols to provide strict performance, security and reliability guarantees.… (more)

▼ Modern networks need to operate at speeds as high as 100Gbps while running sophisticated algorithms and protocols to provide strict performance, security and reliability guarantees. Moreover, they need to flexibly adapt to the rapidly evolving requirements of online services. Thus, emerging network hardware devices, i.e. switches inside the network and Network Interface Cards (NICs) at the end hosts, are high-speed and programmable, with on-chip memory accessible on a per-packet basis to support stateful packet processing. However, the programming interfaces of these devices are quite low-level, tied to each device's architecture, and only suitable for programming a single device. Thus, programming collections of stateful network devices to realize a local or network-wide functionality efficiently and correctly is extremely difficult and error-prone. This dissertation focuses on the design and implementation of high-level programming abstractions for stateful programming of high-speed network hardware, both at the end hosts and inside the network. At the end host, we focus on the transport layer, the most complicated, constantly-evolving, and stateful component of the network stack. Transport-layer algorithms maintain state across packets to decide what data segments to transmit and when, and are notoriously difficult to implement on programmable NICs at high-speed. We propose Tonic, a hardware architecture for transport algorithms that can support 100Gbps for 128-byte packets while being programmable with a simple API. In designing Tonic, we exploit common patterns across transport algorithms to create efficient fixed-function reusable hardware modules, thus significantly reducing the functionality programmers must specify. To facilitate network-wide stateful programming, we propose SNAP, a programming language that abstracts the entire network as "one big stateful switch". Using SNAP, operators can program using persistent arrays on one big switch without deciding how to distribute and access them in the network's switches. The SNAP compiler discovers read/write dependencies between arrays, translates one-big-switch programs into an efficient internal representation based on binary decision diagrams, and uses it to jointly optimize array placement and routing across the network. All in all, Tonic's modular interface and SNAP's one-big-stateful-switch abstraction relieve programmers from the low-level details of stateful programming of high-speed network hardware throughout the entire network. Advisors/Committee Members: Rexford, Jennifer (advisor).

Subjects/Keywords: Computer Networks; Network Hardware; Programmable Networks

6 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Tahmasbi Arashloo, M. (2019). Stateful Programming of High-Speed Network Hardware . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp01fq977x65s

Chicago Manual of Style (16^th Edition):

Tahmasbi Arashloo, Mina. “Stateful Programming of High-Speed Network Hardware .” 2019. Doctoral Dissertation, Princeton University. Accessed April 11, 2021. http://arks.princeton.edu/ark:/88435/dsp01fq977x65s.

MLA Handbook (7^th Edition):

Tahmasbi Arashloo, Mina. “Stateful Programming of High-Speed Network Hardware .” 2019. Web. 11 Apr 2021.

Vancouver:

Tahmasbi Arashloo M. Stateful Programming of High-Speed Network Hardware . [Internet] [Doctoral dissertation]. Princeton University; 2019. [cited 2021 Apr 11]. Available from: http://arks.princeton.edu/ark:/88435/dsp01fq977x65s.

Council of Science Editors:

Tahmasbi Arashloo M. Stateful Programming of High-Speed Network Hardware . [Doctoral Dissertation]. Princeton University; 2019. Available from: http://arks.princeton.edu/ark:/88435/dsp01fq977x65s

Princeton University

26. Tahmasbi Arashloo, Mina. Stateful Programming of High-Speed Network Hardware .

Degree: PhD, 2019, Princeton University

URL: http://arks.princeton.edu/ark:/88435/dsp0112579w15s

► Modern networks need to operate at speeds as high as 100Gbps while running sophisticated algorithms and protocols to provide strict performance, security and reliability guarantees.… (more)

▼ Modern networks need to operate at speeds as high as 100Gbps while running sophisticated algorithms and protocols to provide strict performance, security and reliability guarantees. Moreover, they need to flexibly adapt to the rapidly evolving requirements of online services. Thus, emerging network hardware devices, i.e. switches inside the network and Network Interface Cards (NICs) at the end hosts, are high-speed and programmable, with on-chip memory accessible on a per-packet basis to support stateful packet processing. However, the programming interfaces of these devices are quite low-level, tied to each device's architecture, and only suitable for programming a single device. Thus, programming collections of stateful network devices to realize a local or network-wide functionality efficiently and correctly is extremely difficult and error-prone. This dissertation focuses on the design and implementation of high-level programming abstractions for stateful programming of high-speed network hardware, both at the end hosts and inside the network. At the end host, we focus on the transport layer, the most complicated, constantly-evolving, and stateful component of the network stack. Transport-layer algorithms maintain state across packets to decide what data segments to transmit and when, and are notoriously difficult to implement on programmable NICs at high-speed. We propose Tonic, a hardware architecture for transport algorithms that can support 100Gbps for 128-byte packets while being programmable with a simple API. In designing Tonic, we exploit common patterns across transport algorithms to create efficient fixed-function reusable hardware modules, thus significantly reducing the functionality programmers must specify. To facilitate network-wide stateful programming, we propose SNAP, a programming language that abstracts the entire network as "one big stateful switch". Using SNAP, operators can program using persistent arrays on one big switch without deciding how to distribute and access them in the network's switches. The SNAP compiler discovers read/write dependencies between arrays, translates one-big-switch programs into an efficient internal representation based on binary decision diagrams, and uses it to jointly optimize array placement and routing across the network. All in all, Tonic's modular interface and SNAP's one-big-stateful-switch abstraction relieve programmers from the low-level details of stateful programming of high-speed network hardware throughout the entire network. Advisors/Committee Members: Rexford, Jennifer (advisor).

Subjects/Keywords: Computer Networks; Network Hardware; Programmable Networks

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Tahmasbi Arashloo, M. (2019). Stateful Programming of High-Speed Network Hardware . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp0112579w15s

Chicago Manual of Style (16^th Edition):

Tahmasbi Arashloo, Mina. “Stateful Programming of High-Speed Network Hardware .” 2019. Doctoral Dissertation, Princeton University. Accessed April 11, 2021. http://arks.princeton.edu/ark:/88435/dsp0112579w15s.

MLA Handbook (7^th Edition):

Tahmasbi Arashloo, Mina. “Stateful Programming of High-Speed Network Hardware .” 2019. Web. 11 Apr 2021.

Vancouver:

Tahmasbi Arashloo M. Stateful Programming of High-Speed Network Hardware . [Internet] [Doctoral dissertation]. Princeton University; 2019. [cited 2021 Apr 11]. Available from: http://arks.princeton.edu/ark:/88435/dsp0112579w15s.

Council of Science Editors:

Tahmasbi Arashloo M. Stateful Programming of High-Speed Network Hardware . [Doctoral Dissertation]. Princeton University; 2019. Available from: http://arks.princeton.edu/ark:/88435/dsp0112579w15s

University of Limerick

27. Zacharias, Sven. Effects, classification and mitigation of external interference in IEEE 802.15.4-based wireless sensor networks at 2.4 GHz.

Degree: 2014, University of Limerick

URL: http://hdl.handle.net/10344/4029

►

peer-reviewed

The IEEE Standard 802.15.4 de nes the low power wireless transmission technology behind Wireless Sensor Networks (WSNs) and ZigBee. Since IEEE 802.15.4 is a… (more)

Subjects/Keywords: computer networks; IEEE; wireless sensor networks

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Zacharias, S. (2014). Effects, classification and mitigation of external interference in IEEE 802.15.4-based wireless sensor networks at 2.4 GHz. (Thesis). University of Limerick. Retrieved from http://hdl.handle.net/10344/4029

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Zacharias, Sven. “Effects, classification and mitigation of external interference in IEEE 802.15.4-based wireless sensor networks at 2.4 GHz.” 2014. Thesis, University of Limerick. Accessed April 11, 2021. http://hdl.handle.net/10344/4029.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Zacharias, Sven. “Effects, classification and mitigation of external interference in IEEE 802.15.4-based wireless sensor networks at 2.4 GHz.” 2014. Web. 11 Apr 2021.

Vancouver:

Zacharias S. Effects, classification and mitigation of external interference in IEEE 802.15.4-based wireless sensor networks at 2.4 GHz. [Internet] [Thesis]. University of Limerick; 2014. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/10344/4029.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zacharias S. Effects, classification and mitigation of external interference in IEEE 802.15.4-based wireless sensor networks at 2.4 GHz. [Thesis]. University of Limerick; 2014. Available from: http://hdl.handle.net/10344/4029

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Rutgers University

28. Rostami, Ali, 1987-. Channel congestion control in vehicular networks: stability challenges.

Degree: MS, Electrical and Computer Engineering, 2016, Rutgers University

URL: https://rucore.libraries.rutgers.edu/rutgers-lib/51454/

► Channel congestion is one of the major challenges for IEEE 802.11p-based vehicular networks. Unless controlled, congestion increases with vehicle density, leading to high packet loss… (more)

Subjects/Keywords: Vehicular ad hoc networks (Computer networks)

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Rostami, Ali, 1. (2016). Channel congestion control in vehicular networks: stability challenges. (Masters Thesis). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/51454/

Chicago Manual of Style (16^th Edition):

Rostami, Ali, 1987-. “Channel congestion control in vehicular networks: stability challenges.” 2016. Masters Thesis, Rutgers University. Accessed April 11, 2021. https://rucore.libraries.rutgers.edu/rutgers-lib/51454/.

MLA Handbook (7^th Edition):

Rostami, Ali, 1987-. “Channel congestion control in vehicular networks: stability challenges.” 2016. Web. 11 Apr 2021.

Vancouver:

Rostami, Ali 1. Channel congestion control in vehicular networks: stability challenges. [Internet] [Masters thesis]. Rutgers University; 2016. [cited 2021 Apr 11]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/51454/.

Council of Science Editors:

Rostami, Ali 1. Channel congestion control in vehicular networks: stability challenges. [Masters Thesis]. Rutgers University; 2016. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/51454/

Texas State University – San Marcos

29. Girase, Rahul Narendrasing. Friend circle and social feature-based routing in opportunistic mobile social networks.

Degree: MS, Computer Science, 2017, Texas State University – San Marcos

URL: https://digital.library.txstate.edu/handle/10877/6788

► Opportunistic Mobile Social Networks (OMSNs), formed by people moving around carrying mobile devices, enhance spontaneous communication among users that opportunistically encounter each other without additional… (more)

Subjects/Keywords: Computer Science; Social networks; Ad hoc networks (Computer networks); Mobile computing; Online social networks

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Girase, R. N. (2017). Friend circle and social feature-based routing in opportunistic mobile social networks. (Masters Thesis). Texas State University – San Marcos. Retrieved from https://digital.library.txstate.edu/handle/10877/6788

Chicago Manual of Style (16^th Edition):

Girase, Rahul Narendrasing. “Friend circle and social feature-based routing in opportunistic mobile social networks.” 2017. Masters Thesis, Texas State University – San Marcos. Accessed April 11, 2021. https://digital.library.txstate.edu/handle/10877/6788.

MLA Handbook (7^th Edition):

Girase, Rahul Narendrasing. “Friend circle and social feature-based routing in opportunistic mobile social networks.” 2017. Web. 11 Apr 2021.

Vancouver:

Girase RN. Friend circle and social feature-based routing in opportunistic mobile social networks. [Internet] [Masters thesis]. Texas State University – San Marcos; 2017. [cited 2021 Apr 11]. Available from: https://digital.library.txstate.edu/handle/10877/6788.

Council of Science Editors:

Girase RN. Friend circle and social feature-based routing in opportunistic mobile social networks. [Masters Thesis]. Texas State University – San Marcos; 2017. Available from: https://digital.library.txstate.edu/handle/10877/6788

Cape Peninsula University of Technology

30. Ruyter, Masood. The measurement of enterprise architecture to add value to small and medium enterprises .

Degree: 2012, Cape Peninsula University of Technology

URL: http://etd.cput.ac.za/handle/20.500.11838/2293

► South Africa has a complex financial and retail service industry with high reliance on the use of IT systems to ensure effectiveness and maintainability. Decision… (more)

Subjects/Keywords: Business enterprises – Computer networks; Computer network architectures; Small business – Computer networks

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Ruyter, M. (2012). The measurement of enterprise architecture to add value to small and medium enterprises . (Thesis). Cape Peninsula University of Technology. Retrieved from http://etd.cput.ac.za/handle/20.500.11838/2293

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Ruyter, Masood. “The measurement of enterprise architecture to add value to small and medium enterprises .” 2012. Thesis, Cape Peninsula University of Technology. Accessed April 11, 2021. http://etd.cput.ac.za/handle/20.500.11838/2293.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Ruyter, Masood. “The measurement of enterprise architecture to add value to small and medium enterprises .” 2012. Web. 11 Apr 2021.

Vancouver:

Ruyter M. The measurement of enterprise architecture to add value to small and medium enterprises . [Internet] [Thesis]. Cape Peninsula University of Technology; 2012. [cited 2021 Apr 11]. Available from: http://etd.cput.ac.za/handle/20.500.11838/2293.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ruyter M. The measurement of enterprise architecture to add value to small and medium enterprises . [Thesis]. Cape Peninsula University of Technology; 2012. Available from: http://etd.cput.ac.za/handle/20.500.11838/2293

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Open Access Theses and Dissertations