Zobrazeno 1 - 10
of 173
pro vyhledávání: '"Lee, Tony T"'
In this paper, we propose a depth-first search (DFS) algorithm for searching maximum matchings in general graphs. Unlike blossom shrinking algorithms, which store all possible alternative alternating paths in the super-vertices shrunk from blossoms,
Externí odkaz:
http://arxiv.org/abs/2201.12811
In recent years, offloading mobile traffic through Wi-Fi has emerged as a potential solution to lower down the communication cost for mobile users. Users hope to reduce the cost while keeping the delay in an acceptable range through Wi-Fi offloading.
Externí odkaz:
http://arxiv.org/abs/2005.13195
In this paper, we study the throughput and delay performances of the slotted Aloha with batch service, which has wide applications in random access networks. Different from the classical slotted Aloha, each node in the slotted Aloha with batch servic
Externí odkaz:
http://arxiv.org/abs/1910.07312
Delayed offloading is a widely accepted solution for mobile users to offload their traffic through Wi-Fi when they are moving in urban areas. However, delayed offloading enhances offloading efficiency at the expense of delay performance. Previous wor
Externí odkaz:
http://arxiv.org/abs/1903.11362
This paper proposes an arrayed-waveguide grating (AWG) based wavelength-division-multiplexing (WDM) shuffle network. Compared with previous optical shuffle networks, our proposal is compact, easy to implement, highly scalable, and cost effective.
Externí odkaz:
http://arxiv.org/abs/1707.09280
This paper studies the Ethernet Passive Optical Network (EPON) with gated-limited service. The transmission window (TW) is limited in this system to guaranteeing a bounded delay experienced by disciplined users, and to constrain malicious users from
Externí odkaz:
http://arxiv.org/abs/1705.09433
In this paper, we study the power efficiency and delay performance of the IEEE 802.3az Energy Efficient Ethernet (EEE) protocol. A new approach is proposed to analyze the M/G/1 queue with the vacation time that is governed by the arrival process and
Externí odkaz:
http://arxiv.org/abs/1611.04394
This paper explores the application of a new algebraic method of edge coloring, called complex coloring, to the scheduling problems of input queued switches. The proposed distributed parallel scheduling algorithm possesses two important features: opt
Externí odkaz:
http://arxiv.org/abs/1606.07226
The performance analysis of peer-to-peer (P2P) networks calls for a new kind of queueing model, in which jobs and service stations arrive randomly. Except in some simple special cases, in general, the queueing model with varying service rate is mathe
Externí odkaz:
http://arxiv.org/abs/1605.08146