Browsing by Author "Harry Perros, Committee Member"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • No Thumbnail Available
    Mobility Profiling for Mobile Trajectory Based Services.
    (2007-12-17) Khokhar, Sarfraz; Ame Nilsson, Committee Chair; Harry Perros, Committee Member
  • No Thumbnail Available
    Self-Sizing Techniques for Locally Controlled Networks
    (2005-12-28) Nalatwad, Srikant S; Michael Devetsikiotis, Committee Chair; Harry Perros, Committee Member; Mihail L Sichitiu, Committee Member; Khaled A. Harfoush, Committee Member
    The Internet was designed to provide best effort service for delivery of data packets and to run virtually across any network transmission and system platform. Its exponential growth has turned it into a multiservice complex network of heterogeneous elements with dynamically changing traffic conditions. To regulate such a large scale network it is necessary to place intelligence in the nodes. Network control should be decentralized to make such a system reliable and manageable. It is necessary to find simple local rules and strategies that can produce purposeful and coherent behavior. These control mechanisms must be adaptive to effectively respond to continually varying network conditions. Such adaptive, distributed, localized mechanisms would provide a scalable solution for controlling these large networks. Our comprehensive study on QoS developments in the Internet, reveals the necessity and requirement of a new QoS framework which provides absolute guarantees to the underlying traffic. We propose an innovative self-sizing framework for locally controlled networks such as the Internet, which can support the stringent requirements of interactive applications. A "self-sizing" network can allocate link/switch capacity automatically and adaptively using online traffic data. Our unified, critical and comparative analysis of online resource allocation algorithms of two different classical approaches, leads us to a novel adaptive wavelet predictor. Our results show that by performing online resource allocation at each node based on their local knowledge, we can achieve considerable bandwidth savings and also satisfy QoS at the packet level. We further discover that by making some of the nodes aware of their neighbors resource availability, higher self-sizing gains can be attained.