Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 33 for “"Bandwidth sharing"”.

  1. Virtual path bandwidth distribution and capacity allocation with bandwidth sharing

    … a variety of traffic types with very different bandwidth requirements such as video, voice and data. to increase network efficiency in B-ISDN and other such connection oriented networks, the concept of a virtual path (VP) has been proposed and studied in the literature. A VP is a permanent or …

    wm-mary Repository record for Virtual path bandwidth distribution and capacity allocation with bandwidth sharing (opens in a new tab)

  2. Novel algorithms for fair bandwidth sharing on counter rotating rings

    … achieves higher overall utilization of the ring bandwidth with simpler and less expensive implementation than the generic implementation provided in the standard. The two schemes introduced in this dissertation provide performance comparable to the per destination queuing implementation, which …

    njit Repository record for Novel algorithms for fair bandwidth sharing on counter rotating rings (opens in a new tab)

  3. Quality of protection and efficient backup bandwidth sharing in WDM optical networks

    … a continuous spectrum of QoP grades. The backup bandwidth of those connections with low QoP grades is treated as low-speed traffic and may be multiplexed into one backup lighpath for the purpose of efficient bandwidth utilization. In this way, the bandwidth can be efficiently allocated by …

    nus Repository record for Quality of protection and efficient backup bandwidth sharing in WDM optical networks (opens in a new tab) Download file for Quality of protection and efficient backup bandwidth sharing in WDM optical networks (opens in a new tab)

  4. An End User QoS View of Buffer Sizing and Bandwidth Sharing Protocols

    Much attention has been given to design of network algorithms for the Internet, assuming a fixed number of end hosts. While this is a crucial first step, the analysis is in no way complete. The current design goals such as high-link utilization, low loss probability are useful only when the number …

    uiuc Repository record for An End User QoS View of Buffer Sizing and Bandwidth Sharing Protocols (opens in a new tab)

  5. Access Games: A Game Theoretic Framework For Fair Bandwidth Sharing In Distributed Systems

    … the central objective is to achieve fairness in bandwidth sharing amongst selfish users in a distributed system. Because of the inherent contention-based nature of the distributed medium access and the selfishness of the users, the distributed medium access is modeled as a non-cooperative game; …

    ucf Repository record for Access Games: A Game Theoretic Framework For Fair Bandwidth Sharing In Distributed Systems (opens in a new tab)

  6. Reservation arbitrated access for variable bit rate isochronous traffic transport over dual bus metropolitan area networks

    … to capture and reserve isochronous channels on a bandwidth dn demand basis yielding substantial capacity improvements over pre-arbitrated (PA) access and providing a guaranteed transport service compared to queue-arbitrated (QA) access. To resolve possible access contention in the reservation …

    ubc Repository record for Reservation arbitrated access for variable bit rate isochronous traffic transport over dual bus metropolitan area networks (opens in a new tab) Download PDF for Reservation arbitrated access for variable bit rate isochronous traffic transport over dual bus metropolitan area networks (opens in a new tab)

  7. Bounds and Approximations for Stochastic Fluid Networks

    … adapt their transmission rate to the available bandwidth. When congestion occurs, users experience delays, packet losses and low transfer rates. Thus it is essential to use congestion control algorithms that minimize the probability of occurrence of such congestion periods. Flow level models …

    waterloo Repository record for Bounds and Approximations for Stochastic Fluid Networks (opens in a new tab)

  8. Approximation to the stationary distribution of information flows in a communication network

    … in the network according to some dynamic bandwidth sharing rule, which ensures the stability of the total number of information flows ongoing in the network. The procedure is based on dynamic approximation of the bandwidth allocated to concurrent information flows in the network. Numerical …

    nus Repository record for Approximation to the stationary distribution of information flows in a communication network (opens in a new tab) Download file for Approximation to the stationary distribution of information flows in a communication network (opens in a new tab)

  9. Game theoretic models for multiple access and resource allocation in wireless networks

    … a non-cooperative auction game to solve the bandwidth allocation problem for non-cooperative channel access in a wireless network. The Nash equilibrium is obtained as a solution of the game. To address this problem of bandwidth sharing under unknown information, we further develop a Bayesian …

    manitoba Repository record for Game theoretic models for multiple access and resource allocation in wireless networks (opens in a new tab)

  10. Διαχείριση πόρων σε συστήματα κινητών επικοινωνιών και κατανεμημένα υπολογιστικά συστήματα

    … competition between users is inherent, such as bandwidth sharing in a wireless network, or disk space sharing in a caching system. Problems that have been studied include load balancing and proactive resource management in wireless networks, dynamic spectrum access, power control, as well as …

    greece Repository record for Διαχείριση πόρων σε συστήματα κινητών επικοινωνιών και κατανεμημένα υπολογιστικά συστήματα (opens in a new tab)

  11. A Cooperative Game Theory Model for Bandwidth Allocation in Community Mesh Networks

    … we propose our solutions for the problem of bandwidth sharing in wireless networks. We assume the nodes are rational, selfish but not malicious independent agents in the game. In our model, nodes are trying to send their data to the access point. Some nodes may require others to forward their …

    waterloo Repository record for A Cooperative Game Theory Model for Bandwidth Allocation in Community Mesh Networks (opens in a new tab)

  12. Paceline : toward high-bandwidth interactive continous media applications over TCP

    … suitable transport protocol. Traditionally, the bandwidth requirements were set to be well below the network capacity. Modern applications could evolve if more bandwidth were available without giving up interactivity. However, the lack of a suitable transport providing such high bandwidth with …

    ubc Repository record for Paceline : toward high-bandwidth interactive continous media applications over TCP (opens in a new tab) Download PDF for Paceline : toward high-bandwidth interactive continous media applications over TCP (opens in a new tab)

  13. A Measurement-Based Admission Control Mechanism for Wireless Local Area Networks

    … It also allows the administrator to set the bandwidth sharing policy between the high priority traffic and low priority traffic. Results show that the admission control mechanism not only protects existing high priority flows from jitter and low priority flows from starvation, but also …

    usf Repository record for A Measurement-Based Admission Control Mechanism for Wireless Local Area Networks (opens in a new tab)

  14. Frame-based bandwidth allocation for Agile All-Photonic Networks

    … optical networks describes the ability to deploy bandwidth on demand at fine granularity that allows carriers to provision and deploy services rapidly. An overlaid star all-photonic WDM network, called the Agile All-Photonic Network (AAPN), can provide such agility through multiplexing over each …

    ottawa-retro Repository record for Frame-based bandwidth allocation for Agile All-Photonic Networks (opens in a new tab)

  15. Cache location for distributed media service

    … years and continue to consume more and more bandwidth of the Internet. To achieve efficient network utilization, multicasting has been employed to share the bandwidth among a group of clients who request the same media stream, as opposed to having a separate unicast connection for each client …

    iastate Repository record for Cache location for distributed media service (opens in a new tab)

  16. Research on economic mechanisms and incentives for technologies of future internet

    … protocols for the Internet intending to solve bandwidth allocation issues better; Multipath TCP (MPTCP), as well as protocols for information exposure of the network congestion. We present their basic operation, and we investigate how such mechanisms incorporate the tussles on bandwidth sharing …

    greece Repository record for Research on economic mechanisms and incentives for technologies of future internet (opens in a new tab)

  17. High Speed Multi-Channel Optical Router Design in Dense Wavelength Division Multiplexing (DWDM) Optical Networks

    … the signal in the time domain in order to share bandwidth over time. Orthogonal frequency-division multiplexing (OFDM) on the other hand, utilizes orthogonal sub-carrier signals to carry data on parallel data channels, achieving high spectrum efficiency. On the optical link side, the Dense …

    houston Repository record for High Speed Multi-Channel Optical Router Design in Dense Wavelength Division Multiplexing (DWDM) Optical Networks (opens in a new tab)

  18. RATE-BASED HEADEND REQUEST CONTROL PROTOCOL FOR GIGABIT/S METROPOLITAN AREA NETWORKS

    … by employing a multiple requests operation and a bandwidth allocation mechanism. In addition, it retains most of the positive features of DQDB which include full bandwidth utilization and small access delays at very low offered load. RHRC also has two attractive features. Firstly, the transmission …

    nus Repository record for RATE-BASED HEADEND REQUEST CONTROL PROTOCOL FOR GIGABIT/S METROPOLITAN AREA NETWORKS (opens in a new tab) Download file for RATE-BASED HEADEND REQUEST CONTROL PROTOCOL FOR GIGABIT/S METROPOLITAN AREA NETWORKS (opens in a new tab)

  19. Congestion Control in Satellite Networks

    … solve this problem. The second problem is unfair bandwidth sharing caused by inaccurate measurements of per-flow bandwidth usage. AVQRED is enhanced to accurately measure per-flow bandwidth usage to solve this problem without adding much complexity to the algorithm. The third problem is queueing …

    maryland Repository record for Congestion Control in Satellite Networks (opens in a new tab)

  20. Adaptive scheduling in cellular access, wireless mesh and IP networks

    … controllable differentiation than basic static bandwidth sharing algorithms. The prototype router measurements also prove that a DBHPD algorithm can be easily implemented in practice, causing less processing overheads than a well known CBQ algorithm. The second part of this thesis discusses …

    aalto Repository record for Adaptive scheduling in cellular access, wireless mesh and IP networks (opens in a new tab)

Page 1 of 2