subject:( Computer network protocols )

Oregon State University

1. Maiya, Megha. iMAC : improved medium access control for multi-channel multi-hop wireless networks.

Degree: MS, Computer Science, 2010, Oregon State University

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

► Trends in wireless networks are increasingly pointing towards a future with multi-hop networks deployed in multi-channel environments. In this thesis, we present the design for… (more)

Subjects/Keywords: MAC; Computer network protocols

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Maiya, M. (2010). iMAC : improved medium access control for multi-channel multi-hop wireless networks. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/18086

Chicago Manual of Style (16^th Edition):

Maiya, Megha. “iMAC : improved medium access control for multi-channel multi-hop wireless networks.” 2010. Masters Thesis, Oregon State University. Accessed January 16, 2021. http://hdl.handle.net/1957/18086.

MLA Handbook (7^th Edition):

Maiya, Megha. “iMAC : improved medium access control for multi-channel multi-hop wireless networks.” 2010. Web. 16 Jan 2021.

Vancouver:

Maiya M. iMAC : improved medium access control for multi-channel multi-hop wireless networks. [Internet] [Masters thesis]. Oregon State University; 2010. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/1957/18086.

Council of Science Editors:

Maiya M. iMAC : improved medium access control for multi-channel multi-hop wireless networks. [Masters Thesis]. Oregon State University; 2010. Available from: http://hdl.handle.net/1957/18086

University of Victoria

2. Pu, Jian. Reliable routing and its application in MPLS and admission control.

Degree: Department of Computer Science, 2017, University of Victoria

URL: http://hdl.handle.net/1828/7980

► Reliable routing using alternate paths is investigated in this dissertation. We propose precalculated alternate paths as a method for fast recovery from link and node… (more)

▼ Reliable routing using alternate paths is investigated in this dissertation. We propose precalculated alternate paths as a method for fast recovery from link and node failures in IP networks. We demonstrate that path switching time, and thus failure recovery time are, as expected, considerably faster than the standard method of recalculating a new path on the fly. However, to be effective, the alternate paths should share a minimal set of links and nodes - preferably none - with the failed path. As shared links are considered in this work, we give a reliability model for this situation (non-disjoint alternate paths) and develop estimates of reliability as a function of the number of shared links. Alternate path finding algorithms to calculate suitable alternate paths subject to predefined constraints are also developed. Implementation of these techniques for improving routing reliability is shown to be straightforward for explicit routing protocols such as Multi-Protocol Label Switching (MPLS) with Explicit Routing mode. This mode is expected to be the protocol of choice for applications requiring guaranteed Quality of Service (QoS) carried on the coming generation of wavelength-switched networks (Internet II, CA Net III, etc.) We propose a Reliable MPLS (R-MPLS) protocol by applying alternate path routing to MPLS, using our new algorithms to precalculate appropriate alternate paths. Simulation results show that R-MPLS can achieve fast recovery from failures. We also address reliability issues for the problem of optimal Service Level Agreement (SLA) admission control. To achieve reliable admission control, we apply alternate path routing to an existing SLA-based admission controller called SLAOpt. In the existing Utility Model, SLA admission control is mapped to the Multiple-Choice Multi-Dimension Knapsack Problem (MMKP), where the aim is to maximize system utility (i.e., revenue). However, SLAOpt is static in terms of network topology and does not consider reliability. Motivated by this, we propose a Reliable SLAOpt (R-SLAOpt), in which utility optimization is subject to the additional constraint of reliability. A new algorithm was also developed to calculate multiple groups of alternate paths that meet the desired QoS demands and reliability requirement. After QoS adaptation, R-SLAOpt selects an appropriate path group containing two or three paths for each admitted session and performs resource reservation on all paths in the group. In the event of node or link failure, a session can be quickly switched to one of the alternate paths, maintaining the guaranteed QoS without having to run the full admission algorithm again. In this way, we have obtained a unified treatment of routing reliability and optimal SLA admission control. Finally, simulations are presented which investigate R-SLAOpt's impact on system performance and the gains made in reliability. Advisors/Committee Members: Shoja, Gholamali C (supervisor).

Subjects/Keywords: MPLS standard; Computer network protocols

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Pu, J. (2017). Reliable routing and its application in MPLS and admission control. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/7980

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):

Pu, Jian. “Reliable routing and its application in MPLS and admission control.” 2017. Thesis, University of Victoria. Accessed January 16, 2021. http://hdl.handle.net/1828/7980.

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

MLA Handbook (7^th Edition):

Pu, Jian. “Reliable routing and its application in MPLS and admission control.” 2017. Web. 16 Jan 2021.

Vancouver:

Pu J. Reliable routing and its application in MPLS and admission control. [Internet] [Thesis]. University of Victoria; 2017. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/1828/7980.

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

Council of Science Editors:

Pu J. Reliable routing and its application in MPLS and admission control. [Thesis]. University of Victoria; 2017. Available from: http://hdl.handle.net/1828/7980

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

Rutgers University

3. Krishnamoorthy, Aravind Narayanan, 1990-. Implementation and evaluation of the MobilityFirst protocol stack on software-defined network platforms.

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

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

► This thesis presents the results of an experimental study aimed at implementing the MobilityFirst protocol stack on Software-Defined Network platforms. The MobilityFirst protocol involves a… (more)

Subjects/Keywords: Computer network protocols; Software engineering

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Krishnamoorthy, Aravind Narayanan, 1. (2013). Implementation and evaluation of the MobilityFirst protocol stack on software-defined network platforms. (Masters Thesis). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/41810/

Chicago Manual of Style (16^th Edition):

Krishnamoorthy, Aravind Narayanan, 1990-. “Implementation and evaluation of the MobilityFirst protocol stack on software-defined network platforms.” 2013. Masters Thesis, Rutgers University. Accessed January 16, 2021. https://rucore.libraries.rutgers.edu/rutgers-lib/41810/.

MLA Handbook (7^th Edition):

Krishnamoorthy, Aravind Narayanan, 1990-. “Implementation and evaluation of the MobilityFirst protocol stack on software-defined network platforms.” 2013. Web. 16 Jan 2021.

Vancouver:

Krishnamoorthy, Aravind Narayanan 1. Implementation and evaluation of the MobilityFirst protocol stack on software-defined network platforms. [Internet] [Masters thesis]. Rutgers University; 2013. [cited 2021 Jan 16]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/41810/.

Council of Science Editors:

Krishnamoorthy, Aravind Narayanan 1. Implementation and evaluation of the MobilityFirst protocol stack on software-defined network platforms. [Masters Thesis]. Rutgers University; 2013. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/41810/

Rutgers University

4. Sriram, Shravan, 1991-. Adge-aware inter-domain routing protocol for the MobilityFirst Future Internet Architecture.

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

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

► This thesis presents the design and evaluation of an edge-aware inter-domain routing (EIR) protocol for the MobilityFirst Future Internet Architecture. The EIR protocol provides enhanced… (more)

Subjects/Keywords: Routing (Computer network management); Computer architecture; Routing protocols (Computer network protocols)

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Sriram, Shravan, 1. (2015). Adge-aware inter-domain routing protocol for the MobilityFirst Future Internet Architecture. (Masters Thesis). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/48669/

Chicago Manual of Style (16^th Edition):

Sriram, Shravan, 1991-. “Adge-aware inter-domain routing protocol for the MobilityFirst Future Internet Architecture.” 2015. Masters Thesis, Rutgers University. Accessed January 16, 2021. https://rucore.libraries.rutgers.edu/rutgers-lib/48669/.

MLA Handbook (7^th Edition):

Sriram, Shravan, 1991-. “Adge-aware inter-domain routing protocol for the MobilityFirst Future Internet Architecture.” 2015. Web. 16 Jan 2021.

Vancouver:

Sriram, Shravan 1. Adge-aware inter-domain routing protocol for the MobilityFirst Future Internet Architecture. [Internet] [Masters thesis]. Rutgers University; 2015. [cited 2021 Jan 16]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/48669/.

Council of Science Editors:

Sriram, Shravan 1. Adge-aware inter-domain routing protocol for the MobilityFirst Future Internet Architecture. [Masters Thesis]. Rutgers University; 2015. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/48669/

Rutgers University

5. Thareja, Rohit, 1986-. Implementation and performance analysis of a multi-meshed tree routing protocol for MANETs.

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

URL: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000057699

► As the importance of mobile data connectivity in our daily lives increases, there has been an accompanying increase in the demand for rapidly deployable, short-lived… (more)

▼ As the importance of mobile data connectivity in our daily lives increases, there has been an accompanying increase in the demand for rapidly deployable, short-lived networks which operate without any base infrastructure. This is where Mobile-ad-hoc Networks step in to turn the dream of getting connected anywhere and at any time into a reality and are fast being adopted into civilian applications like vehicular networks and location-based advertising. They have several advantages over infrastructure based wireless networks (like cellular networks) in terms of cost of deployment, ability to use unlicensed bands, etc. However, they are still plagued with several constraints mainly brought about by their dynamic nature. The main concern here is the use of an efficient routing protocol which must be adaptive and able to maintain routes in spite of the changing network connectivity. In this work we investigate a recently-proposed cluster-based routing protocol which utilizes both mesh and tree concepts and aims at minimizing the control overhead required in the setup and maintenance of the network while maintaining robust connectivity. This hybrid protocol, called Multi-Meshed Tree routing protocol, has a unique way of addressing the issues of dynamic adaptation and enhanced connectivity through a hierarchical cluster-based approach along with Virtual Identifiers. Its main advantage over the various other MANET protocols developed is its algorithm simplicity and low message complexity suited for these limited bandwidth, limited power, resource constrained networks. The focus of this work is implementing this protocol (to work with the ns2 simulator), understanding its advantages and conducting some preliminary simulation based comparisons with prevalent Mobile ad-hoc network protocols. We looked at comparison with AODV, DSDV and DSR Protocols and observed MMT to exhibit more resilient connectivity due to redundant routes, particularly for larger sized networks. Further, there was roughly a 1/6th reduction in routing overhead when compared to proactive protocols. We also studied the effects of configurability of cluster size and inherent non-optimality of routes associated with MMT. We foresee the increased use of MANETS in our daily lives, and hope that the advantages of this routing protocol are utilized for future applications. Advisors/Committee Members: Thareja, Rohit, 1986- (author), Marsic, Ivan (chair), Pompili, Dario (internal member), Gajic, Zoran (internal member).

Subjects/Keywords: Ad hoc networks (Computer networks); Routing protocols (Computer network protocols)

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Thareja, Rohit, 1. (2011). Implementation and performance analysis of a multi-meshed tree routing protocol for MANETs. (Masters Thesis). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000057699

Chicago Manual of Style (16^th Edition):

Thareja, Rohit, 1986-. “Implementation and performance analysis of a multi-meshed tree routing protocol for MANETs.” 2011. Masters Thesis, Rutgers University. Accessed January 16, 2021. http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000057699.

MLA Handbook (7^th Edition):

Thareja, Rohit, 1986-. “Implementation and performance analysis of a multi-meshed tree routing protocol for MANETs.” 2011. Web. 16 Jan 2021.

Vancouver:

Thareja, Rohit 1. Implementation and performance analysis of a multi-meshed tree routing protocol for MANETs. [Internet] [Masters thesis]. Rutgers University; 2011. [cited 2021 Jan 16]. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000057699.

Council of Science Editors:

Thareja, Rohit 1. Implementation and performance analysis of a multi-meshed tree routing protocol for MANETs. [Masters Thesis]. Rutgers University; 2011. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000057699

Florida Atlantic University

6. Kumar, Ajoy. Unifying the conceptual levels of network security through the use of patterns.

Degree: 2014, Florida Atlantic University

URL: http://purl.flvc.org/fau/fd/FA00004132 ; (URL) http://purl.flvc.org/fau/fd/FA00004132

►

Summary: Network architectures are described by the International Standard for Organization (ISO), which contains seven layers. The internet uses four of these layers, of which… (more)

Subjects/Keywords: Computer architecture; Computer network architectures; Computer network protocols; Computer network protocols; Computer networks – Security measures; Expert systems (Computer science)

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Kumar, A. (2014). Unifying the conceptual levels of network security through the use of patterns. (Thesis). Florida Atlantic University. Retrieved from http://purl.flvc.org/fau/fd/FA00004132 ; (URL) http://purl.flvc.org/fau/fd/FA00004132

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, Ajoy. “Unifying the conceptual levels of network security through the use of patterns.” 2014. Thesis, Florida Atlantic University. Accessed January 16, 2021. http://purl.flvc.org/fau/fd/FA00004132 ; (URL) http://purl.flvc.org/fau/fd/FA00004132.

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, Ajoy. “Unifying the conceptual levels of network security through the use of patterns.” 2014. Web. 16 Jan 2021.

Vancouver:

Kumar A. Unifying the conceptual levels of network security through the use of patterns. [Internet] [Thesis]. Florida Atlantic University; 2014. [cited 2021 Jan 16]. Available from: http://purl.flvc.org/fau/fd/FA00004132 ; (URL) http://purl.flvc.org/fau/fd/FA00004132.

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

Council of Science Editors:

Kumar A. Unifying the conceptual levels of network security through the use of patterns. [Thesis]. Florida Atlantic University; 2014. Available from: http://purl.flvc.org/fau/fd/FA00004132 ; (URL) http://purl.flvc.org/fau/fd/FA00004132

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

University of Namibia

7. Oyedele Yemisi. An evaluation of browser-based clients for asterisk .

Degree: 2010, University of Namibia

URL: http://hdl.handle.net/11070/477

► Abstract provided by author; Asterisk is a Private Branch Exchange (PBX) software used to connect telephony applications such as Voice over Internet Protocol (VoIP). In… (more)

▼ Abstract provided by author; Asterisk is a Private Branch Exchange (PBX) software used to connect telephony applications such as Voice over Internet Protocol (VoIP). In the Department of Computer Science at the University of Namibia (DCS-UNAM), Asterisk is currently set up to provide basic VoIP services to staff and students. However, this system currently has limited accessibility because it can only be accessed with VoIP clients such as hard and soft phones. Alternatively, Browser-based VoIP clients (BBVCs) can be used to provide nomadic accessibility to Asterisk. The study evaluates the BBVCs for their challenges and usability in providing users in DCS-UNAM with nomadic access to Asterisk services. Both qualitative and quantitative research methodologies were used for this study. A literature study was carried out to find available BBVCs that can be customised to work with Asterisk. Out of them, the Java Inter-Asterisk eXchange Client (JIAXC) library application was selected as the appropriate BBVC for this study. Data produced during the compilation, the loading and the use of the BBVC.s web phone were captured using Wireshark Network Protocol Analyzer, Firefox Java Console and the Gnome terminal. Some of the data collected were analysed using Wireshark and the IAX2 Call analyzer. The overall usability of the BBVC was also obtained using questionnaires which were distributed to Third year Computer Science students at DCSUNAM and then analysed using Statistica software package; The JIAXC application can be customised to provide nomadic accessibility to the Asterisk setup in DCS-UNAM. The main challenge encountered during the customisation of the BBVC is the compilation of the JIAXC library. The effects include restriction effects from the Java applet security manager and the effects of many users accessing the BBVC.s web phone on the call quality. The analysis done on the questionnaire data indicated that the customised BBVC is considered as a usable means of accessing Asterisk services Advisors/Committee Members: Terzoli Alfredo (advisor), Mufeti Kauna (advisor).

Subjects/Keywords: Computer network protocols ; Asterisk ; Internet telephony

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Yemisi, O. (2010). An evaluation of browser-based clients for asterisk . (Thesis). University of Namibia. Retrieved from http://hdl.handle.net/11070/477

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):

Yemisi, Oyedele. “An evaluation of browser-based clients for asterisk .” 2010. Thesis, University of Namibia. Accessed January 16, 2021. http://hdl.handle.net/11070/477.

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

MLA Handbook (7^th Edition):

Yemisi, Oyedele. “An evaluation of browser-based clients for asterisk .” 2010. Web. 16 Jan 2021.

Vancouver:

Yemisi O. An evaluation of browser-based clients for asterisk . [Internet] [Thesis]. University of Namibia; 2010. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/11070/477.

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

Council of Science Editors:

Yemisi O. An evaluation of browser-based clients for asterisk . [Thesis]. University of Namibia; 2010. Available from: http://hdl.handle.net/11070/477

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

Oregon State University

8. Xu, Mingcheng. Concurrent message transmission on short delay ring networks.

Degree: PhD, Electrical and Computer Engineering, 1989, Oregon State University

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

► Two new medium access protocols for ring type local area networks, CTR (Concurrent Token Ring) protocol and DRUID (Destination Removal withoUt Intermediate node Delay) ring… (more)

▼ Two new medium access protocols for ring type local area networks, CTR (Concurrent Token Ring) protocol and DRUID (Destination Removal withoUt Intermediate node Delay) ring protocol, are proposed, designed and analyzed. A destination partial removal technique is designed and used in these two protocols to support concurrent message transmission and minimize loop latency. CTR protocol is the first protocol using the destination partial removal technique. In this network, a source node captures a Token and transmits a message which loops around the ring to its destination. The message frame is truncated and configured by the destination node into a Conditional Token which is allowed to circulate back to the source node for final destruction. The Conditional Token, informs "downstream" nodes of busy data paths and allows them to establish concurrent message transmission if the resources they need are free. In a DRUID ring network, a node may initiate message transmission if its output link is free. Every node will relay each incoming message immediately if it is idle when the message arrives. At the same time, the node also receives and buffers all the incoming messages. Upon decoding the destination address, the destination node will truncate the message frame to form a cut frame by eliminating the information field from its output data stream. This cut frame will continue to circulate around the ring until it arrives at a busy node where it is buffered, identified and destroyed. The message frame will be completely removed by the destination node if it is busy when the message arrives. The protocol supports high concurrency while the loop latency is minimized. Programs have been developed to simulate these two protocols. Their results are compared with Token Ring protocol and Register Insertion Ring protocol. The comparisons have shown that both of the new protocols have higher performances than the existing ring protocols. Advisors/Committee Members: Herzog, James H. (advisor), Engelbrecht, R.S. (committee member).

Subjects/Keywords: Computer network protocols

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Xu, M. (1989). Concurrent message transmission on short delay ring networks. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/40406

Chicago Manual of Style (16^th Edition):

Xu, Mingcheng. “Concurrent message transmission on short delay ring networks.” 1989. Doctoral Dissertation, Oregon State University. Accessed January 16, 2021. http://hdl.handle.net/1957/40406.

MLA Handbook (7^th Edition):

Xu, Mingcheng. “Concurrent message transmission on short delay ring networks.” 1989. Web. 16 Jan 2021.

Vancouver:

Xu M. Concurrent message transmission on short delay ring networks. [Internet] [Doctoral dissertation]. Oregon State University; 1989. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/1957/40406.

Council of Science Editors:

Xu M. Concurrent message transmission on short delay ring networks. [Doctoral Dissertation]. Oregon State University; 1989. Available from: http://hdl.handle.net/1957/40406

Oregon State University

9. Agarwal, Sandeep, 1973-. Conserving energy in TCP for mobile ad-hoc networks.

Degree: MS, Electrical and Computer Engineering, 2000, Oregon State University

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

► The widespread use of TCP as a transport layer protocol for mobile ad-hoc networks and wireline networks has motivated the need to make its implementation… (more)

Subjects/Keywords: Computer network protocols

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Agarwal, Sandeep, 1. (2000). Conserving energy in TCP for mobile ad-hoc networks. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/33177

Chicago Manual of Style (16^th Edition):

Agarwal, Sandeep, 1973-. “Conserving energy in TCP for mobile ad-hoc networks.” 2000. Masters Thesis, Oregon State University. Accessed January 16, 2021. http://hdl.handle.net/1957/33177.

MLA Handbook (7^th Edition):

Agarwal, Sandeep, 1973-. “Conserving energy in TCP for mobile ad-hoc networks.” 2000. Web. 16 Jan 2021.

Vancouver:

Agarwal, Sandeep 1. Conserving energy in TCP for mobile ad-hoc networks. [Internet] [Masters thesis]. Oregon State University; 2000. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/1957/33177.

Council of Science Editors:

Agarwal, Sandeep 1. Conserving energy in TCP for mobile ad-hoc networks. [Masters Thesis]. Oregon State University; 2000. Available from: http://hdl.handle.net/1957/33177

University of Johannesburg

10. Kruger, Angela. Data integrity in a steel manufacturing environment with special reference to Columbus Stainless Steel.

Degree: 2012, University of Johannesburg

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

►

M.Comm.

In manufacturing companies where raw material is transformed into an endproduct, data pertaining to that transformation process are transported from the physical machine (workstation)… (more)

Subjects/Keywords: Data transmission systems; Computer network protocols

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Kruger, A. (2012). Data integrity in a steel manufacturing environment with special reference to Columbus Stainless Steel. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/4506

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):

Kruger, Angela. “Data integrity in a steel manufacturing environment with special reference to Columbus Stainless Steel.” 2012. Thesis, University of Johannesburg. Accessed January 16, 2021. http://hdl.handle.net/10210/4506.

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

MLA Handbook (7^th Edition):

Kruger, Angela. “Data integrity in a steel manufacturing environment with special reference to Columbus Stainless Steel.” 2012. Web. 16 Jan 2021.

Vancouver:

Kruger A. Data integrity in a steel manufacturing environment with special reference to Columbus Stainless Steel. [Internet] [Thesis]. University of Johannesburg; 2012. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/10210/4506.

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

Council of Science Editors:

Kruger A. Data integrity in a steel manufacturing environment with special reference to Columbus Stainless Steel. [Thesis]. University of Johannesburg; 2012. Available from: http://hdl.handle.net/10210/4506

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

Oregon State University

11. Pillay, Harish. An implementation of the Department of Defense's transmission control protocol internet protocol (TCP/IP) for the Microsoft OS/2 operating system.

Degree: MS, Electrical and Computer Engineering, 1990, Oregon State University

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

► This thesis discusses an approach whereby Microsoft's MS OS/2 is provided with a means of running the Department of Defense's Transmission Control Protocol/Internet Protocol (TCP/IP).… (more)

Subjects/Keywords: Computer network protocols

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Pillay, H. (1990). An implementation of the Department of Defense's transmission control protocol internet protocol (TCP/IP) for the Microsoft OS/2 operating system. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/21863

Chicago Manual of Style (16^th Edition):

Pillay, Harish. “An implementation of the Department of Defense's transmission control protocol internet protocol (TCP/IP) for the Microsoft OS/2 operating system.” 1990. Masters Thesis, Oregon State University. Accessed January 16, 2021. http://hdl.handle.net/1957/21863.

MLA Handbook (7^th Edition):

Pillay, Harish. “An implementation of the Department of Defense's transmission control protocol internet protocol (TCP/IP) for the Microsoft OS/2 operating system.” 1990. Web. 16 Jan 2021.

Vancouver:

Pillay H. An implementation of the Department of Defense's transmission control protocol internet protocol (TCP/IP) for the Microsoft OS/2 operating system. [Internet] [Masters thesis]. Oregon State University; 1990. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/1957/21863.

Council of Science Editors:

Pillay H. An implementation of the Department of Defense's transmission control protocol internet protocol (TCP/IP) for the Microsoft OS/2 operating system. [Masters Thesis]. Oregon State University; 1990. Available from: http://hdl.handle.net/1957/21863

Hong Kong University of Science and Technology

12. Chen, Feng. Server replication and its placement for reliable multicast.

Degree: 2000, Hong Kong University of Science and Technology

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

► A key challenge in reliable multicast is to reduce the retransmission cost such as bandwidth usage and delay. Local recovery approach employing replicated servers has… (more)

Subjects/Keywords: Computer network protocols

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Chen, F. (2000). Server replication and its placement for reliable multicast. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-5684 ; https://doi.org/10.14711/thesis-b655884 ; http://repository.ust.hk/ir/bitstream/1783.1-5684/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):

Chen, Feng. “Server replication and its placement for reliable multicast.” 2000. Thesis, Hong Kong University of Science and Technology. Accessed January 16, 2021. http://repository.ust.hk/ir/Record/1783.1-5684 ; https://doi.org/10.14711/thesis-b655884 ; http://repository.ust.hk/ir/bitstream/1783.1-5684/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):

Chen, Feng. “Server replication and its placement for reliable multicast.” 2000. Web. 16 Jan 2021.

Vancouver:

Chen F. Server replication and its placement for reliable multicast. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2000. [cited 2021 Jan 16]. Available from: http://repository.ust.hk/ir/Record/1783.1-5684 ; https://doi.org/10.14711/thesis-b655884 ; http://repository.ust.hk/ir/bitstream/1783.1-5684/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:

Chen F. Server replication and its placement for reliable multicast. [Thesis]. Hong Kong University of Science and Technology; 2000. Available from: http://repository.ust.hk/ir/Record/1783.1-5684 ; https://doi.org/10.14711/thesis-b655884 ; http://repository.ust.hk/ir/bitstream/1783.1-5684/1/th_redirect.html

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

Kansas State University

13. Pelletier, Larry Edward. Description of a file access protocol for computer networks.

Degree: 1985, Kansas State University

URL: http://hdl.handle.net/2097/9870

Subjects/Keywords: Computer network protocols

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Pelletier, L. E. (1985). Description of a file access protocol for computer networks. (Thesis). Kansas State University. Retrieved from http://hdl.handle.net/2097/9870

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):

Pelletier, Larry Edward. “Description of a file access protocol for computer networks.” 1985. Thesis, Kansas State University. Accessed January 16, 2021. http://hdl.handle.net/2097/9870.

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

MLA Handbook (7^th Edition):

Pelletier, Larry Edward. “Description of a file access protocol for computer networks.” 1985. Web. 16 Jan 2021.

Vancouver:

Pelletier LE. Description of a file access protocol for computer networks. [Internet] [Thesis]. Kansas State University; 1985. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/2097/9870.

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

Council of Science Editors:

Pelletier LE. Description of a file access protocol for computer networks. [Thesis]. Kansas State University; 1985. Available from: http://hdl.handle.net/2097/9870

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

University of British Columbia

14. Chan, Linda. Implementation of the Cambridge ring protocols on the sun workstation.

Degree: MS- MSc, Computer Science, 1985, University of British Columbia

URL: http://hdl.handle.net/2429/24591

► As Local Area Networks gain momentum in recent Computer Science research, implementation is generally characterized by various factors such as efficiency, reliability, error recovery, and… (more)

Subjects/Keywords: Computer network protocols

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Chan, L. (1985). Implementation of the Cambridge ring protocols on the sun workstation. (Masters Thesis). University of British Columbia. Retrieved from http://hdl.handle.net/2429/24591

Chicago Manual of Style (16^th Edition):

Chan, Linda. “Implementation of the Cambridge ring protocols on the sun workstation.” 1985. Masters Thesis, University of British Columbia. Accessed January 16, 2021. http://hdl.handle.net/2429/24591.

MLA Handbook (7^th Edition):

Chan, Linda. “Implementation of the Cambridge ring protocols on the sun workstation.” 1985. Web. 16 Jan 2021.

Vancouver:

Chan L. Implementation of the Cambridge ring protocols on the sun workstation. [Internet] [Masters thesis]. University of British Columbia; 1985. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/2429/24591.

Council of Science Editors:

Chan L. Implementation of the Cambridge ring protocols on the sun workstation. [Masters Thesis]. University of British Columbia; 1985. Available from: http://hdl.handle.net/2429/24591

University of British Columbia

15. Tong, Darren Pong-Choi. Implementation of a protocol validation and synthesis system.

Degree: MS- MSc, Computer Science, 1985, University of British Columbia

URL: http://hdl.handle.net/2429/25061

► VALISYN, an automated system for the validation and synthesis of error-free protocols has been implemented in C language. It assists designers in the detection and… (more)

Subjects/Keywords: Computer network protocols

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Tong, D. P. (1985). Implementation of a protocol validation and synthesis system. (Masters Thesis). University of British Columbia. Retrieved from http://hdl.handle.net/2429/25061

Chicago Manual of Style (16^th Edition):

Tong, Darren Pong-Choi. “Implementation of a protocol validation and synthesis system.” 1985. Masters Thesis, University of British Columbia. Accessed January 16, 2021. http://hdl.handle.net/2429/25061.

MLA Handbook (7^th Edition):

Tong, Darren Pong-Choi. “Implementation of a protocol validation and synthesis system.” 1985. Web. 16 Jan 2021.

Vancouver:

Tong DP. Implementation of a protocol validation and synthesis system. [Internet] [Masters thesis]. University of British Columbia; 1985. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/2429/25061.

Council of Science Editors:

Tong DP. Implementation of a protocol validation and synthesis system. [Masters Thesis]. University of British Columbia; 1985. Available from: http://hdl.handle.net/2429/25061

University of British Columbia

16. Tsiknis, George. Specification-verification of protocols : the significant event temporal logic technique.

Degree: MS- MSc, Computer Science, 1985, University of British Columbia

URL: http://hdl.handle.net/2429/25047

► This thesis addresses the problem of protocol verification. We first present a brief review of the existing specification methods for communication protocols, with emphasis on… (more)

Subjects/Keywords: Computer network protocols

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Tsiknis, G. (1985). Specification-verification of protocols : the significant event temporal logic technique. (Masters Thesis). University of British Columbia. Retrieved from http://hdl.handle.net/2429/25047

Chicago Manual of Style (16^th Edition):

Tsiknis, George. “Specification-verification of protocols : the significant event temporal logic technique.” 1985. Masters Thesis, University of British Columbia. Accessed January 16, 2021. http://hdl.handle.net/2429/25047.

MLA Handbook (7^th Edition):

Tsiknis, George. “Specification-verification of protocols : the significant event temporal logic technique.” 1985. Web. 16 Jan 2021.

Vancouver:

Tsiknis G. Specification-verification of protocols : the significant event temporal logic technique. [Internet] [Masters thesis]. University of British Columbia; 1985. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/2429/25047.

Council of Science Editors:

Tsiknis G. Specification-verification of protocols : the significant event temporal logic technique. [Masters Thesis]. University of British Columbia; 1985. Available from: http://hdl.handle.net/2429/25047

Rutgers University

17. Su, Kai, 1987-. Algorithms and protocols for efficient multicast, transport, and congestion control in wireless networks.

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

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

► Effective and efficient support for wireless data transfer is an essential requirement for future Internet design, as the number of wireless network users and devices,… (more)

▼ Effective and efficient support for wireless data transfer is an essential requirement for future Internet design, as the number of wireless network users and devices, and the amount of traffic flowing through these devices have been steadily growing. This dissertation tackles several problems, and proposes algorithmic and protocol design solutions to better provide such support. The first problem is regarding the inefficiency of multicast in wireless networks: a transmission is considered a unicast despite the fact that multiple nearby nodes can receive the transmitted packet. Random network coding (RNC) is considered a cure for this problem, but related wireless network radio resources, such as transmit power, need to be optimally allocated to use RNC to its full advantage. A dynamic radio resource allocation framework for RNC is proposed to maximize multicast throughput. Its efficacy is evaluated through both numerical and event driven simulations. Next, we present the design of MFTP, a clean-slate transport protocol aimed for supporting efficient wireless and mobile content delivery. Current transport protocol of the Internet, TCP, is known to fall short if the end-to-end path involves wireless links where link quality varies drastically, or if the client is mobile. Building on a mobility-centric future Internet architecture, MobilityFirst (MF), a set of transport protocol components are designed to collectively provide robust and efficient data transfer to wireless, or mobile end hosts. These include en-route storage for disconnection, in-network transport service, and hop-by-hop delivery of large chunks of data. A research prototype is built and deployed on ORBIT testbed to evaluate the design. Results from several wireless network use case evaluations, such as large file transfer, web content retrieval, and disconnection services, have shown that the proposed mechanisms achieve significant performance improvement over TCP. Finally, a scalable, network-assisted congestion control algorithm is proposed for the MobilityFirst future Internet architecture. In MobilityFirst, various intelligent functionalities, such as reliability and storage, are placed inside the network to assist with data delivery. Traditional end-to-end congestion control such as that carried out by TCP becomes unsuitable as it is unable to take advantage of such in-network functionalities. We design a congestion control policy that uses explicit congestion notifications from network routers and rate control at traffic sources. The hop-by-hop reliability provided in MF simplifies end-to-end reliable delivery of wireless/mobile data, but often requires routers to keep per-flow queues to carry out congestion control which could become impractical in the presence of a large number of flows. Our approach builds on a per-interface queueing scheme, and we show through simulation that it is able to substantially improve delay, fairness, and scalability with only <= 6% link utilization degradation, compared with a per-flow queueing based… Advisors/Committee Members: Raychaudhuri, Dipankar (chair), Mandayam, Narayan B. (co-chair), Yates, Roy (internal member), Ramakrishnan, K. K. (outside member).

Subjects/Keywords: Wireless communication systems; Computer network protocols

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Su, Kai, 1. (2016). Algorithms and protocols for efficient multicast, transport, and congestion control in wireless networks. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/51474/

Chicago Manual of Style (16^th Edition):

Su, Kai, 1987-. “Algorithms and protocols for efficient multicast, transport, and congestion control in wireless networks.” 2016. Doctoral Dissertation, Rutgers University. Accessed January 16, 2021. https://rucore.libraries.rutgers.edu/rutgers-lib/51474/.

MLA Handbook (7^th Edition):

Su, Kai, 1987-. “Algorithms and protocols for efficient multicast, transport, and congestion control in wireless networks.” 2016. Web. 16 Jan 2021.

Vancouver:

Su, Kai 1. Algorithms and protocols for efficient multicast, transport, and congestion control in wireless networks. [Internet] [Doctoral dissertation]. Rutgers University; 2016. [cited 2021 Jan 16]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/51474/.

Council of Science Editors:

Su, Kai 1. Algorithms and protocols for efficient multicast, transport, and congestion control in wireless networks. [Doctoral Dissertation]. Rutgers University; 2016. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/51474/

Simon Fraser University

18. Datar, Rajendra R. Test sequence generation for network protocols.

Degree: 1987, Simon Fraser University

URL: http://summit.sfu.ca/item/5350

Subjects/Keywords: Computer network protocols.

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Datar, R. R. (1987). Test sequence generation for network protocols. (Thesis). Simon Fraser University. Retrieved from http://summit.sfu.ca/item/5350

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):

Datar, Rajendra R. “Test sequence generation for network protocols.” 1987. Thesis, Simon Fraser University. Accessed January 16, 2021. http://summit.sfu.ca/item/5350.

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

MLA Handbook (7^th Edition):

Datar, Rajendra R. “Test sequence generation for network protocols.” 1987. Web. 16 Jan 2021.

Vancouver:

Datar RR. Test sequence generation for network protocols. [Internet] [Thesis]. Simon Fraser University; 1987. [cited 2021 Jan 16]. Available from: http://summit.sfu.ca/item/5350.

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

Council of Science Editors:

Datar RR. Test sequence generation for network protocols. [Thesis]. Simon Fraser University; 1987. Available from: http://summit.sfu.ca/item/5350

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

University of Oklahoma

19. Hossain, Shohrab. Survivability, Scalability and Security of Mobility Protocols.

Degree: PhD, 2012, University of Oklahoma

URL: http://hdl.handle.net/11244/320332

architecture that aims at maximizing bandwidth utilization. The analysis presented in this work can help network engineers compare different mobility protocols quantitatively, thereby choose one that is reliable, secure, survivable and scalable. Advisors/Committee Members: Atiquzzaman, Mohammed (advisor).

Subjects/Keywords: Mobile communication systems; Computer network protocols

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Hossain, S. (2012). Survivability, Scalability and Security of Mobility Protocols. (Doctoral Dissertation). University of Oklahoma. Retrieved from http://hdl.handle.net/11244/320332

Chicago Manual of Style (16^th Edition):

Hossain, Shohrab. “Survivability, Scalability and Security of Mobility Protocols.” 2012. Doctoral Dissertation, University of Oklahoma. Accessed January 16, 2021. http://hdl.handle.net/11244/320332.

MLA Handbook (7^th Edition):

Hossain, Shohrab. “Survivability, Scalability and Security of Mobility Protocols.” 2012. Web. 16 Jan 2021.

Vancouver:

Hossain S. Survivability, Scalability and Security of Mobility Protocols. [Internet] [Doctoral dissertation]. University of Oklahoma; 2012. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/11244/320332.

Council of Science Editors:

Hossain S. Survivability, Scalability and Security of Mobility Protocols. [Doctoral Dissertation]. University of Oklahoma; 2012. Available from: http://hdl.handle.net/11244/320332

Ryerson University

20. Sabbagh, Amro A. Improving BGP Convergence And Reachability Through Stable Path Aggregation (SPAGG).

Degree: 2013, Ryerson University

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

► BGP is the standard inter-domain routing protocol of the internet. It has proven to be scalable enough to accommodate the exceptional growth of the Internet.… (more)

Subjects/Keywords: Routers (Computer networks); BGP (Computer network protocol); Computer network protocols

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Sabbagh, A. A. (2013). Improving BGP Convergence And Reachability Through Stable Path Aggregation (SPAGG). (Thesis). Ryerson University. Retrieved from https://digital.library.ryerson.ca/islandora/object/RULA%3A2168

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):

Sabbagh, Amro A. “Improving BGP Convergence And Reachability Through Stable Path Aggregation (SPAGG).” 2013. Thesis, Ryerson University. Accessed January 16, 2021. https://digital.library.ryerson.ca/islandora/object/RULA%3A2168.

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

MLA Handbook (7^th Edition):

Sabbagh, Amro A. “Improving BGP Convergence And Reachability Through Stable Path Aggregation (SPAGG).” 2013. Web. 16 Jan 2021.

Vancouver:

Sabbagh AA. Improving BGP Convergence And Reachability Through Stable Path Aggregation (SPAGG). [Internet] [Thesis]. Ryerson University; 2013. [cited 2021 Jan 16]. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A2168.

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

Council of Science Editors:

Sabbagh AA. Improving BGP Convergence And Reachability Through Stable Path Aggregation (SPAGG). [Thesis]. Ryerson University; 2013. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A2168

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

Columbia University

21. Kim, Kyung Hwa. Towards Trouble-Free Networks for End Users.

Degree: 2018, Columbia University

URL: https://doi.org/10.7916/D8KW6T0G

► Network applications and Internet services fail all too frequently. However, end users cannot effectively identify the root cause using traditional troubleshooting techniques due to the… (more)

▼ Network applications and Internet services fail all too frequently. However, end users cannot effectively identify the root cause using traditional troubleshooting techniques due to the limited capability to distinguish failures caused by local network elements from failures caused by elements located outside the local area network. To overcome these limitations, we propose a new approach, one that leverages collaboration of user machines to assist end users in diagnosing various failures related to Internet connectivity and poor network performance. First, we present DYSWIS ("Do You See What I See?"), an automatic network fault detection and diagnosis system for end users. DYSWIS identifies the root cause(s) of network faults using diagnostic rules that consider diverse information from multiple nodes. In addition, the DYSWIS rule system is specially designed to support crowdsourced and distributed probes. We also describe the architecture of DYSWIS and compare its performance with other tools. Finally, we demonstrate that the system successfully detects and diagnoses network failures which are difficult to diagnose using a single-user probe. Failures in lower layers of the protocol stack also have the potential to disrupt Internet access; for example, slow Internet connectivity is often caused by poor Wi-Fi performance. Channel contention and non-Wi-Fi interference are the primary reasons for this performance degradation. We investigate the characteristics of non-Wi-Fi interference that can severely degrade Wi-Fi performance and present WiSlow ("Why is my Wi-Fi slow?"), a software tool that diagnoses the root causes of poor Wi-Fi performance. WiSlow employs user-level network probes and leverages peer collaboration to identify the physical location of these causes. The software includes two principal methods: packet loss analysis and 802.11 ACK number analysis. When the issue is located near Wi-Fi devices, the accuracy of WiSlow exceeds 90%. Finally, we expand our collaborative approach to the Internet of Things (IoT) and propose a platform for network-troubleshooting on home devices. This platform takes advantage of built-in technology common to modern devices – multiple communication interfaces. For example, when a home device has a problem with an interface it sends a probe request to other devices using an alternative interface. The system then exploits cooperation of both internal devices and remote machines. We show that this approach is useful in home networks by demonstrating an application that contains actual diagnostic algorithms.

Subjects/Keywords: Computer science; Computer network resources; Internet users; Computer network protocols

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Kim, K. H. (2018). Towards Trouble-Free Networks for End Users. (Doctoral Dissertation). Columbia University. Retrieved from https://doi.org/10.7916/D8KW6T0G

Chicago Manual of Style (16^th Edition):

Kim, Kyung Hwa. “Towards Trouble-Free Networks for End Users.” 2018. Doctoral Dissertation, Columbia University. Accessed January 16, 2021. https://doi.org/10.7916/D8KW6T0G.

MLA Handbook (7^th Edition):

Kim, Kyung Hwa. “Towards Trouble-Free Networks for End Users.” 2018. Web. 16 Jan 2021.

Vancouver:

Kim KH. Towards Trouble-Free Networks for End Users. [Internet] [Doctoral dissertation]. Columbia University; 2018. [cited 2021 Jan 16]. Available from: https://doi.org/10.7916/D8KW6T0G.

Council of Science Editors:

Kim KH. Towards Trouble-Free Networks for End Users. [Doctoral Dissertation]. Columbia University; 2018. Available from: https://doi.org/10.7916/D8KW6T0G

Drexel University

22. Xie, Nan. Multiple access stability and broadcast delay in wireless networks.

Degree: 2014, Drexel University

URL: http://hdl.handle.net/1860/idea:6402

►

This thesis addresses issues of design and performance analysis in wireless communication networks. We investigate topics relevant to both uplink and downlink. For uplink, we… (more)

▼

This thesis addresses issues of design and performance analysis in wireless communication networks. We investigate topics relevant to both uplink and downlink. For uplink, we study the stability region of the slotted Aloha protocol under the collision channel model, for the case of a finite number of independent users. The stability region (i.e., the set of arrival rate vectors such that the whole queueing system can be made stable) is in general unknown when the number of users is more than two. We seek to characterize the set of stabilizable rate vectors, whereas most existing works only provide bounds on the region of stabilized rate vectors under a given control (i.e., a vector of contention probabilities). We choose a natural and important inner bound on the exact Aloha stability region. The results we obtain include equivalent forms of and alternative membership testing for this set, as well as other properties such as various geometrically intuitive and simple inner and outer bounds, and generalized convexity properties of the associated "excess rate" functions. For downlink, we seek to characterize the delay when broadcasting (random linear combinations of) information packets over independent erasure channels to a finite number of users. Of interest is the random delay until all the receivers recover all the packets initially queued at the base station (i.e., the sender). This falls into the study of certain order statistic of random variables. We obtain lower and upper bounds, exact expressions and a finite-step computational procedure (recurrence) for the moments of the random delay. We also investigate the dependence of the delay on the code blocklength (under random linear combinations of packets as the scheme employed in random linear network coding), and on the number of receivers, respectively. Results here include asymptotics, monotonicity properties and asymptotically tight lower and upper bounds.

Ph.D., Electrical Engineering – Drexel University, 2014

Advisors/Committee Members: Weber, Steven (Steven P.), College of Engineering.

Subjects/Keywords: Electrical engineering; Wireless communication systems; Multiple access protocols (Computer network protocols)

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Xie, N. (2014). Multiple access stability and broadcast delay in wireless networks. (Thesis). Drexel University. Retrieved from http://hdl.handle.net/1860/idea:6402

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):

Xie, Nan. “Multiple access stability and broadcast delay in wireless networks.” 2014. Thesis, Drexel University. Accessed January 16, 2021. http://hdl.handle.net/1860/idea:6402.

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

MLA Handbook (7^th Edition):

Xie, Nan. “Multiple access stability and broadcast delay in wireless networks.” 2014. Web. 16 Jan 2021.

Vancouver:

Xie N. Multiple access stability and broadcast delay in wireless networks. [Internet] [Thesis]. Drexel University; 2014. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/1860/idea:6402.

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

Council of Science Editors:

Xie N. Multiple access stability and broadcast delay in wireless networks. [Thesis]. Drexel University; 2014. Available from: http://hdl.handle.net/1860/idea:6402

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

Stellenbosch University

23. Merts, Andre-Jan. Satellite network simulator - design and verifcation using AODV and AntHocNet.

Degree: MEng, Electrical and Electronic Engineering, 2017, Stellenbosch University

URL: http://hdl.handle.net/10019.1/101241

►

ENGLISH ABSTRACT: As access to space increases, the viability of creating satellite networks and dedicated services for satellite clients also increases. However, satellites are expensive… (more)

▼

ENGLISH ABSTRACT: As access to space increases, the viability of creating satellite networks and dedicated services for satellite clients also increases. However, satellites are expensive to launch and cannot be easily maintained once in orbit, making it beneficial to simulate network performance before launch. Furthermore there is an extensive wealth of research regarding routing protocols available for terrestrial networks that have not been fully researched for satellite networks thus creating a need for a satellite network simulator. Any network has various ways in which its properties can be interpreted, which means any network metric must be unambiguously defined. Routing protocols can be classified in various ways, showing their inherent advantages, disadvantages, requirements and limitations. Combining these properties with information on the components of routing protocols, an analysis of routing protocols can be made and candidate routing protocols can be chosen. For this research AODV was chosen to allow functional verification and AntHocNet was chosen to show that the simulator is flexible enough to simulate various routing protocol functionality. Satellite networks were manually analysed with attention given to the key differences between terrestrial and satellite networks. Using this information in conjunction with previous research findings and recommendations, a vast distributed network similar to the Iridium network was chosen as a verification scenario for the simulator. A previously proposed network, called the OuterNet, was chosen to further research the transferability of AODV and AntHocNet to other satellite constellations. The expansion of SatSim from a basic point-to-point simulator to a network simulator capable of handling complex routing protocols was documented in detail, with clear information given as to which design choices were made and why. The key design drivers were user-friendliness, modularity and re-usability, and the code was structured to allow users to easily adjust and expand the simulator as needed. Due to the limited replicatable results, further testing for the MAC layer channel access for AODV and AntHocNet implementations was performed. SatSim was successfully expanded to allow for satellite network simulations. Preliminary findings regarding the suitability of AODV compared to AntHocNet for two different satellite constellations are presented.

AFRIKAANSE OPSOMMING: Namate die ruimte meer toeganklik word, verhoog die lewensvatbaarheid van die gebruik van satellietnetwerke en toegewyde dienste wat op daardie netwerk gerig is. Satelliete is steeds relatief duur om te lanseer en kan nie maklik onderhou of herstel word na dit in 'n wentelbaan geplaas is nie, gevolgelik kan die simulasies van die netwerk voor lansering baie nuttig wees. Daar is verder ook heelwat navorsing oor netwerkprotokolle vir aardnetwerke gedoen wat nog nie volledig bestudeer is vir satellietnetwerke nie en wat dus 'n behoefte skep vir 'n satellietnetwerk simulator. …

Advisors/Committee Members: Barnard, Arno, Stellenbosch University. Faculty of Engineering. Dept. of Electrical and Electronic Engineering..

Subjects/Keywords: UCTD; Astronautics in navigation; Space simulators; Routing protocols (Computer network protocols)

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Merts, A. (2017). Satellite network simulator - design and verifcation using AODV and AntHocNet. (Thesis). Stellenbosch University. Retrieved from http://hdl.handle.net/10019.1/101241

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):

Merts, Andre-Jan. “Satellite network simulator - design and verifcation using AODV and AntHocNet.” 2017. Thesis, Stellenbosch University. Accessed January 16, 2021. http://hdl.handle.net/10019.1/101241.

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

MLA Handbook (7^th Edition):

Merts, Andre-Jan. “Satellite network simulator - design and verifcation using AODV and AntHocNet.” 2017. Web. 16 Jan 2021.

Vancouver:

Merts A. Satellite network simulator - design and verifcation using AODV and AntHocNet. [Internet] [Thesis]. Stellenbosch University; 2017. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/10019.1/101241.

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

Council of Science Editors:

Merts A. Satellite network simulator - design and verifcation using AODV and AntHocNet. [Thesis]. Stellenbosch University; 2017. Available from: http://hdl.handle.net/10019.1/101241

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

Michigan State University

24. Lightfoot, Leron J. Cost-aware routing protocols for location-privacy and efficiency in wireless sensor networks.

Degree: 2015, Michigan State University

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

►

Thesis Ph. D. Michigan State University. Electrical Engineering 2015

Wireless sensor networks (WSNs) can provide the world with a technology for real-time event monitoring for… (more)

▼

Thesis Ph. D. Michigan State University. Electrical Engineering 2015

Wireless sensor networks (WSNs) can provide the world with a technology for real-time event monitoring for both military and civilian applications. One of the primary concerns that hinders the successful deployment of wireless sensor networks is how to provide adequate source and destination nodes location privacy. The privacy of the location is vital and highly jeopardized by the usage of wireless communications. While message content privacy can be ensured through message encryption, it is much more difficult to adequately address the location privacy issue. For WSNs, location privacy service is further complicated by the fact that sensors consist of low-cost and energy efficient radio devices. Therefore, using computationally intensive cryptographic algorithms (such as public-key cryptosystems) and large scale broadcasting-based protocols are not suitable for WSNs.Many protocols have been proposed to provide location privacy but most of them are based on public-key cryptosystems, while others are either energy inefficient or have certain security flaws. After analyzing the security weaknesses of the existing schemes, we propose several creative and secure energy-aware routing protocols that can address the location privacy issue in WSNs. For source-location privacy, we propose 3 schemes. The first scheme routes each message to a randomly selected intermediate node (RSIN) before it is transmitted to the SINK node. However, this scheme can only provide local source-location privacy. In the second scheme, a network mixing ring (NMR) is proposed to provide network-level source-location privacy. The third scheme achieves network-level source-location privacy through a technique we call the Sink Toroidal Region (STaR) routing. For destination-location privacy, we propose the Bubble routing protocol and a series of R-STaR routing protocols. For each of these routing schemes, both security analysis using quantitative measurements and simulation results show that the proposed protocols are secure and energy-efficient.While providing location privacy is vital, prolonging the lifetime of the network can be a very essential component as well. In this dissertation, we propose a cluster-based energy-aware routing scheme, called Quad-Region Cluster-Head Selection (Q-ReCHS), which will prolong the network lifetime by evenly distributing the energy load among all the nodes. Our extensive simulation results on cluster-based routing demonstrates that our proposed Q-ReCHS scheme can out perform many of the existing schemes.

Description based on online resource;

Advisors/Committee Members: Ren, Jian, Pierre, Percy, Biswas, Subir, Hall, Jonathan.

Subjects/Keywords: Routing protocols (Computer network protocols); Wireless sensor networks; Electrical engineering

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Lightfoot, L. J. (2015). Cost-aware routing protocols for location-privacy and efficiency in wireless sensor networks. (Thesis). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:3796

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):

Lightfoot, Leron J. “Cost-aware routing protocols for location-privacy and efficiency in wireless sensor networks.” 2015. Thesis, Michigan State University. Accessed January 16, 2021. http://etd.lib.msu.edu/islandora/object/etd:3796.

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

MLA Handbook (7^th Edition):

Lightfoot, Leron J. “Cost-aware routing protocols for location-privacy and efficiency in wireless sensor networks.” 2015. Web. 16 Jan 2021.

Vancouver:

Lightfoot LJ. Cost-aware routing protocols for location-privacy and efficiency in wireless sensor networks. [Internet] [Thesis]. Michigan State University; 2015. [cited 2021 Jan 16]. Available from: http://etd.lib.msu.edu/islandora/object/etd:3796.

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

Council of Science Editors:

Lightfoot LJ. Cost-aware routing protocols for location-privacy and efficiency in wireless sensor networks. [Thesis]. Michigan State University; 2015. Available from: http://etd.lib.msu.edu/islandora/object/etd:3796

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

25. Ye, Lisha. DCUDP : a novel UDP for reliable transmission in data center networks.

Degree: 2012, Hong Kong University of Science and Technology

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

► Recent researchers find out that TCP fails to provide satisfying performance for data center networks in many cases including throughput, fairness and latency requirements since… (more)

Subjects/Keywords: TCP/IP (Computer network protocol) ; Computer network protocols ; Data transmission systems

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Ye, L. (2012). DCUDP : a novel UDP for reliable transmission in data center networks. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-7757 ; https://doi.org/10.14711/thesis-b1198287 ; http://repository.ust.hk/ir/bitstream/1783.1-7757/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):

Ye, Lisha. “DCUDP : a novel UDP for reliable transmission in data center networks.” 2012. Thesis, Hong Kong University of Science and Technology. Accessed January 16, 2021. http://repository.ust.hk/ir/Record/1783.1-7757 ; https://doi.org/10.14711/thesis-b1198287 ; http://repository.ust.hk/ir/bitstream/1783.1-7757/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):

Ye, Lisha. “DCUDP : a novel UDP for reliable transmission in data center networks.” 2012. Web. 16 Jan 2021.

Vancouver:

Ye L. DCUDP : a novel UDP for reliable transmission in data center networks. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2012. [cited 2021 Jan 16]. Available from: http://repository.ust.hk/ir/Record/1783.1-7757 ; https://doi.org/10.14711/thesis-b1198287 ; http://repository.ust.hk/ir/bitstream/1783.1-7757/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:

Ye L. DCUDP : a novel UDP for reliable transmission in data center networks. [Thesis]. Hong Kong University of Science and Technology; 2012. Available from: http://repository.ust.hk/ir/Record/1783.1-7757 ; https://doi.org/10.14711/thesis-b1198287 ; http://repository.ust.hk/ir/bitstream/1783.1-7757/1/th_redirect.html

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

Michigan State University

26. Patel, Jignesh. Algorithms for deep packet inspection.

Degree: 2012, Michigan State University

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

►

Thesis Ph. D. Michigan State University. Computer Science 2012.

The core operation in network intrusion detection and prevention systems is Deep Packet Inspection (DPI), in… (more)

▼

Thesis Ph. D. Michigan State University. Computer Science 2012.

The core operation in network intrusion detection and prevention systems is Deep Packet Inspection (DPI), in which each security threat is represented as a signature, and the payload of each data packet is matched against the set of current security threat signatures. DPI is also used for other networking applications like advanced QoS mechanisms, protocol identification etc.. In the past, attack signatures were specified as strings, and a great deal of research has been done in string matching for network applications. Today most DPI systems use Regular Expression (RE) to represent signatures. RE matching is more diffcult than string matching, and current string matching solutions don't work well for REs. RE matching for networking applications is diffcult for several reasons. First, the DPI application is usually implemented in network devices, which have limited computing resources. Second, as new threats are discovered, size of the signature set grows over time. Last, the matching needs to be done at network speeds, the growth of which out paces improvements in computing speed; so there is a need for novel solutions that can deliver higher throughput. So RE matching for DPI is a very important and active research area.In our research, we investigate the existing methods proposed for RE matching, identify their limitations, and propose new methods to overcome these limitations. RE matching remains a fundamentally challenging problem due to the diffculty in compactly encoding DFA. While the DFA for any one RE is typically small, the DFA that corresponds to the entire set of REs is usually too large to be constructed or deployed. To address this issue, many alternative automata implementations that compress the size of the final automaton have been proposed. However, previously proposed automata construction algorithms employ a “Union then Minimize” framework where the automata for each RE are first joined before minimization occurs. This leads to expensive minimization on a large automata, and a large intermediate memory footprint. We propose a “Minimize then Union” framework for constructing compact alternative automata, which minimizes smaller automata first before combining them. This approach required much less time and memory, allowing us to handle a much larger RE set. Prior hardware based RE matching algorithms typically use FPGA. The drawback of FPGA is that resynthesizing and updating FPGA circuitry to handle RE updates is slow and diffcult. We propose the first hardware-based RE matching approach that uses Ternary Content Addressable Memory (TCAM). TCAMs have already been widely used in modern networking devices for tasks such as packet classification, so our solutions can be easily deployed. Our methods support easy RE updates, and we show that we can achieve very high throughput. The main reason combined DFAs for multiple REs grow exponentially in size is because of replication of states. We developed a new…

Advisors/Committee Members: Torng, Eric, Enbody, Richard, Liu, Alex, Magyar, Peter.

Subjects/Keywords: Computer network architectures; Computer networks – Security measures; Computer security; Computer network protocols; Computer science

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Patel, J. (2012). Algorithms for deep packet inspection. (Thesis). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:1847

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):

Patel, Jignesh. “Algorithms for deep packet inspection.” 2012. Thesis, Michigan State University. Accessed January 16, 2021. http://etd.lib.msu.edu/islandora/object/etd:1847.

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

MLA Handbook (7^th Edition):

Patel, Jignesh. “Algorithms for deep packet inspection.” 2012. Web. 16 Jan 2021.

Vancouver:

Patel J. Algorithms for deep packet inspection. [Internet] [Thesis]. Michigan State University; 2012. [cited 2021 Jan 16]. Available from: http://etd.lib.msu.edu/islandora/object/etd:1847.

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

Council of Science Editors:

Patel J. Algorithms for deep packet inspection. [Thesis]. Michigan State University; 2012. Available from: http://etd.lib.msu.edu/islandora/object/etd:1847

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

Ryerson University

27. Ma, Jason V. Routing simulation of brain network topology.:.

Degree: 2014, Ryerson University

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

► The incessant search to understand human cognitive functions has led to the hypothesis that the brain works similar to a packet switched network such as… (more)

Subjects/Keywords: Neural networks (Computer science) – Simulation methods.; Neural networks (Computer science) – Simulation methods. – -; Routing protocols (Computer network protocols) – Simulation methods.; Routing protocols (Computer network protocols) – Simulation methods. – -

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Ma, J. V. (2014). Routing simulation of brain network topology.:. (Thesis). Ryerson University. Retrieved from https://digital.library.ryerson.ca/islandora/object/RULA%3A2684

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):

Ma, Jason V. “Routing simulation of brain network topology.:.” 2014. Thesis, Ryerson University. Accessed January 16, 2021. https://digital.library.ryerson.ca/islandora/object/RULA%3A2684.

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

MLA Handbook (7^th Edition):

Ma, Jason V. “Routing simulation of brain network topology.:.” 2014. Web. 16 Jan 2021.

Vancouver:

Ma JV. Routing simulation of brain network topology.:. [Internet] [Thesis]. Ryerson University; 2014. [cited 2021 Jan 16]. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A2684.

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

Council of Science Editors:

Ma JV. Routing simulation of brain network topology.:. [Thesis]. Ryerson University; 2014. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A2684

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

Florida Atlantic University

28. Alzamzami, Ohoud. Geographic Routing Reliability Enhancement in Urban Vehicular Ad Hoc Networks.

Degree: 2018, Florida Atlantic University

URL: http://fau.digital.flvc.org/islandora/object/fau:40776

►

Vehicular Ad hoc Networks (VANETs) have the potential to enable various kinds of applications aiming at improving road safety and transportation efficiency. These applications require… (more)

▼

Vehicular Ad hoc Networks (VANETs) have the potential to enable various kinds of applications aiming at improving road safety and transportation efficiency. These applications require uni-cast routing, which remains a significant challenge due to VANETs characteristics. Given VANET dynamic topology, geographic routing protocols are considered the most suitable for such network due to their scalability and low overhead. However, the optimal selection of next-hop nodes in geographic routing is a challenging problem where the routing performance is highly affected by the variable link quality and bandwidth availability. In this dissertation, a number of enhancements to improve geographic routing reliability in VANETs are proposed. To minimize packet losses, the direction and link quality of next-hop nodes using the Expected Transmission Count (ETX) are considered to select links with low loss ratios. To consider the available bandwidth, a cross-layer enchantment of geographic routing, which can select more reliable links and quickly react to varying nodes load and channel conditions, is proposed. We present a novel model of the dynamic behavior of a wireless link. It considers the loss ratio on a link, in addition to transmission and queuing delays, and it takes into account the physical interference e ect on the link. Then, a novel geographic routing protocol based on fuzzy logic systems, which help in coordinating di erent contradicting metrics, is proposed. Multiple metrics related to vehicles' position, direction, link quality and achievable throughput are combined using fuzzy rules in order to select the more reliable next-hop nodes for packet forwarding. Finally, we propose a novel link utility aware geographic routing protocol, which extends the local view of the network topology using two-hop neighbor information. We present our model of link utility, which measures the usefulness of a two-hop neighbor link by considering its minimum residual bandwidth and packet loss rate. The proposed protocol can react appropriately to increased network tra c and to frequent topology dis-connectivity in VANETs. To evaluate the performance of the proposed protocols, extensive simulation experiments are performed using network and urban mobility simulation tools. Results confirm the advantages of the proposed schemes in increased traffic loads and network density.

2018

Degree granted: Dissertation (Ph.D.) – Florida Atlantic University, 2018.

Collection: FAU

Advisors/Committee Members: Mahgoub, Imad (Thesis advisor), Florida Atlantic University (Degree grantor), College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science.

Subjects/Keywords: Vehicular ad hoc networks (Computer networks); Traffic safety; Routing protocols (Computer network protocols); Fuzzy logic

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Alzamzami, O. (2018). Geographic Routing Reliability Enhancement in Urban Vehicular Ad Hoc Networks. (Thesis). Florida Atlantic University. Retrieved from http://fau.digital.flvc.org/islandora/object/fau:40776

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):

Alzamzami, Ohoud. “Geographic Routing Reliability Enhancement in Urban Vehicular Ad Hoc Networks.” 2018. Thesis, Florida Atlantic University. Accessed January 16, 2021. http://fau.digital.flvc.org/islandora/object/fau:40776.

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

MLA Handbook (7^th Edition):

Alzamzami, Ohoud. “Geographic Routing Reliability Enhancement in Urban Vehicular Ad Hoc Networks.” 2018. Web. 16 Jan 2021.

Vancouver:

Alzamzami O. Geographic Routing Reliability Enhancement in Urban Vehicular Ad Hoc Networks. [Internet] [Thesis]. Florida Atlantic University; 2018. [cited 2021 Jan 16]. Available from: http://fau.digital.flvc.org/islandora/object/fau:40776.

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

Council of Science Editors:

Alzamzami O. Geographic Routing Reliability Enhancement in Urban Vehicular Ad Hoc Networks. [Thesis]. Florida Atlantic University; 2018. Available from: http://fau.digital.flvc.org/islandora/object/fau:40776

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

Rhodes University

29. Murisa, Wesley Vengayi. Deploying DNSSEC in islands of security.

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

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

►

The Domain Name System (DNS), a name resolution protocol is one of the vulnerable network protocols that has been subjected to many security attacks such… (more)

▼

The Domain Name System (DNS), a name resolution protocol is one of the vulnerable network protocols that has been subjected to many security attacks such as cache poisoning, denial of service and the 'Kaminsky' spoofing attack. When DNS was designed, security was not incorporated into its design. The DNS Security Extensions (DNSSEC) provides security to the name resolution process by using public key cryptosystems. Although DNSSEC has backward compatibility with unsecured zones, it only offers security to clients when communicating with security aware zones. Widespread deployment of DNSSEC is therefore necessary to secure the name resolution process and provide security to the Internet. Only a few Top Level Domains (TLD's) have deployed DNSSEC, this inherently makes it difficult for their sub-domains to implement the security extensions to the DNS. This study analyses mechanisms that can be used by domains in islands of security to deploy DNSSEC so that the name resolution process can be secured in two specific cases where either the TLD is not signed or the domain registrar is not able to support signed domains. The DNS client side mechanisms evaluated in this study include web browser plug-ins, local validating resolvers and domain look-aside validation. The results of the study show that web browser plug-ins cannot work on their own without local validating resolvers. The web browser validators, however, proved to be useful in indicating to the user whether a domain has been validated or not. Local resolvers present a more secure option for Internet users who cannot trust the communication channel between their stub resolvers and remote name servers. However, they do not provide a way of showing the user whether a domain name has been correctly validated or not. Based on the results of the tests conducted, it is recommended that local validators be used with browser validators for visibility and improved security. On the DNS server side, Domain Look-aside Validation (DLV) presents a viable alternative for organizations in islands of security like most countries in Africa where only two country code Top Level Domains (ccTLD) have deployed DNSSEC. This research recommends use of DLV by corporates to provide DNS security to both internal and external users accessing their web based services.

LaTeX with hyperref package

pdfTeX-1.40.10

Subjects/Keywords: Internet domain names; Computer security; Computer network protocols; Computer security – Africa

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Murisa, W. V. (2013). Deploying DNSSEC in islands of security. (Thesis). Rhodes University. Retrieved from http://hdl.handle.net/10962/d1003053

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):

Murisa, Wesley Vengayi. “Deploying DNSSEC in islands of security.” 2013. Thesis, Rhodes University. Accessed January 16, 2021. http://hdl.handle.net/10962/d1003053.

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

MLA Handbook (7^th Edition):

Murisa, Wesley Vengayi. “Deploying DNSSEC in islands of security.” 2013. Web. 16 Jan 2021.

Vancouver:

Murisa WV. Deploying DNSSEC in islands of security. [Internet] [Thesis]. Rhodes University; 2013. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/10962/d1003053.

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

Council of Science Editors:

Murisa WV. Deploying DNSSEC in islands of security. [Thesis]. Rhodes University; 2013. Available from: http://hdl.handle.net/10962/d1003053

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

Massey University

30. Leijen, Thomas Johannes Laurentius. Developing a backplane solution for the TCS PCC : thesis submitted in complete fulfilment of the requirements for the Master of Engineering .

Degree: 2011, Massey University

URL: http://hdl.handle.net/10179/2998

► TCS is company that specialises in systems integration and development of products for industrial application. Their flagship product for distributed control is the CPU5. This… (more)

▼ TCS is company that specialises in systems integration and development of products for industrial application. Their flagship product for distributed control is the CPU5. This project covers the design and development of a backplane solution to solve the limitation of the CPU5 that it only has a limited number of inputs and outputs. The next iteration of the CPU5, is to be called the PCC. Background research was carried out into the needs of TCS and their target markets. The IEC61499 standard, Windows CE platform and ISaGRAF software environment were also investigated. The project planning was analysed to gain an understanding of R&D project planning. This project concluded that it was important to be able to make changes to the plan as the project proceeds so that it can still be completed by the deadline. TCS had set the limitation that the backplane protocol must be a serial bus. Various different types of serial bus were investigated including CAN, USB, Light Peak (optical) and EIA485. The bus selected was a CAN bus with a custom protocol. Research was carried out into the operation of existing bus drivers and protocols such as DeviceNet and CANOpen to determine an appropriate protocol for a serial bus based backplane. Software was developed to manage devices attached to the backplane. Hardware and software for a digital I/O module was developed. Various ways of updating the I/O were investigated, an event-based and cyclic updating method was implemented with an adjustable debounce time to maximise performance and robustness. Hardware and software for a serial port module was developed. A major challenge faced was to transmit a stream based protocol across a frame based CAN backplane. Software for an Ethernet module was developed. Software design included development of an NDIS compatible miniport driver for Windows CE and software for the slave module. To demonstrate that the PCC is an effective platform for distributed control, a test setup was created to be shown at a trade show in Nuremberg. The trade show setup was fully programmed in compliance with the IEC61499 standard and demonstrated the power of the PCC.

Subjects/Keywords: Backplane; Serial bus; Computer network protocols; Controller Area Network

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Leijen, T. J. L. (2011). Developing a backplane solution for the TCS PCC : thesis submitted in complete fulfilment of the requirements for the Master of Engineering . (Thesis). Massey University. Retrieved from http://hdl.handle.net/10179/2998

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):

Leijen, Thomas Johannes Laurentius. “Developing a backplane solution for the TCS PCC : thesis submitted in complete fulfilment of the requirements for the Master of Engineering .” 2011. Thesis, Massey University. Accessed January 16, 2021. http://hdl.handle.net/10179/2998.

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

MLA Handbook (7^th Edition):

Leijen, Thomas Johannes Laurentius. “Developing a backplane solution for the TCS PCC : thesis submitted in complete fulfilment of the requirements for the Master of Engineering .” 2011. Web. 16 Jan 2021.

Vancouver:

Leijen TJL. Developing a backplane solution for the TCS PCC : thesis submitted in complete fulfilment of the requirements for the Master of Engineering . [Internet] [Thesis]. Massey University; 2011. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/10179/2998.

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

Council of Science Editors:

Leijen TJL. Developing a backplane solution for the TCS PCC : thesis submitted in complete fulfilment of the requirements for the Master of Engineering . [Thesis]. Massey University; 2011. Available from: http://hdl.handle.net/10179/2998

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

Open Access Theses and Dissertations