dc.contributor.author | Kamouh, Walid A. | |
dc.date.accessioned | 2020-07-17T08:45:43Z | |
dc.date.available | 2020-07-17T08:45:43Z | |
dc.date.issued | 2000-07 | |
dc.identifier.citation | Kamouh, W. A. (2000). Hop-by-hop flow control with packet aggregation in TCP/IP networks (Master's thesis, Notre Dame University-Louaize, Zouk Mosbeh, Lebanon). Retrieved from http://ir.ndu.edu.lb/123456789/1137 | en_US |
dc.identifier.uri | http://ir.ndu.edu.lb/123456789/1137 | |
dc.description | M.S. -- Faculty of Natural and Applied Sciences, Notre Dame University, Louaize, 2000; "A thesis submitted in partial fulfillment of the requirements for the degree of Master of Science in Computer Science"; Includes bibliographicl references (leaves 72-74). | en_US |
dc.description.abstract | The internet is once again suffering from its own success. Since 1995, there has been a massive increase in demand for internet services, resulting in an exponential growth of the Internet. We have entered now an era where the users of the Internet are unable to obtain the bandwidth needed to support their applications, and they are experiencing high packet loss. Packet loss problem arises whenever the number of packets arriving at a given router is much higher than its buffering space. The main goal of this thesis is to find adaptive schemes capable of optimizing the communication network performance of systems with buffering constraints such as TCP/IP networks. A new strategy, called hop-by-hop flow-control with packet aggregation (HFCPA), is devised for optimizing the network performance. HFCPA is a variation of the current TCP/IP protocol. Flow control with aggregation of packets is implemented in the main routers of the network, in contrary to the current TCP/IP protocol where the flow control occurs at the edge of the network (i.e. at the end-users). In fact, the internet will be subdivided into tunnels where the edge routers of each tunnels are responsible for the packet management inside the tunnel (aggregation, fragmentation, bandwidth allocation, path selection...). With this newly proposed technique, we have shown that TCP connections experience lower packet loss and higher throughput compared with normal TCP/IP implementation, especially during network congestion. | en_US |
dc.format.extent | 74, xxxiv, leaves ; illustrations | |
dc.language.iso | en | en_US |
dc.publisher | Notre Dame University-Louaize. | en_US |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 United States | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/us/ | * |
dc.subject.lcsh | Flow control (Data transmission systems) | |
dc.subject.lcsh | TCP/IP (Computer network protocol) | |
dc.subject.lcsh | Wireless communication systems | |
dc.subject.lcsh | Internetworking (Telecommunication) | |
dc.title | Hop-by-hop flow control with packet aggregation in TCP/IP networks | en_US |
dc.type | Thesis | en_US |
dc.rights.license | This work is licensed under a Creative Commons Attribution-NonCommercial 3.0 United States License. (CC BY-NC 3.0 US) | |
dc.contributor.supervisor | Maalouf, Hoda, Ph.D. | en_US |
dc.contributor.department | Notre Dame University-Louaize. Department of Computer Science | en_US |
The following license files are associated with this item: