Zobrazeno 1 - 10
of 305
pro vyhledávání: '"Tony T. Lee"'
Publikováno v:
IEEE Access, Vol 8, Pp 106746-106764 (2020)
This paper investigates the dual-mode power-saving strategy designed for the 100G Energy Efficient Ethernet. The process of this strategy is a sequence of cycles, where each cycle is an interval elapsed between two consecutive instants when the buffe
Externí odkaz:
https://doaj.org/article/21e76f94602c4edfa7c99a23b92a2cb2
Publikováno v:
IEEE Access, Vol 7, Pp 57956-57971 (2019)
This paper studies the Ethernet passive optical network (EPON) with limited service. The transmission window (TW) is limited in this system to guarantee a bounded delay experienced by disciplined users and to constrain malicious users from monopolizi
Externí odkaz:
https://doaj.org/article/5baca4188cd145b093ad9b735f7533e9
Publikováno v:
IEEE Transactions on Cloud Computing. 10:805-820
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4f1143678b45414c791ab87ba2104331
https://doi.org/10.1109/tcc.2020.2992489
https://doi.org/10.1109/tcc.2020.2992489
Publikováno v:
Journal of Industrial & Management Optimization. 17:185-204
In this paper, we analyze the delay performance of queueing systems in which the service rate varies with time and the number of service states may be infinite. Except in some simple special cases, in general, the queueing model with varying service
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6cb3cae40a77f9d5d2304f219ca22399
https://doi.org/10.3934/jimo.2019106
https://doi.org/10.3934/jimo.2019106
Publikováno v:
IEEE/ACM Transactions on Networking. :1-17
In recent years, connection-based slotted-Aloha (CS-Aloha) has been proposed to improve the performance of random access networks. In this protocol, each node attempts to send a request to the access point (AP) before packet transmission. Once this a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::32a980d5040f7b7f21bbb55faeca29fc
https://doi.org/10.1109/tnet.2020.3029774
https://doi.org/10.1109/tnet.2020.3029774
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::21ff0a551c9250a91a0c7ea677305dab
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 30:977-989
The three-stage fault-tolerant Clos network, where extra switch modules exist in the middle stage in case of switch failures, is widely used in the design of OTN switches. This paper proposes a route assignment algorithm for such Clos networks by sol
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f91b675a5c60ae5baaef7ff06466766e
https://doi.org/10.1109/tpds.2018.2880782
https://doi.org/10.1109/tpds.2018.2880782
Publikováno v:
IEEE Access, Vol 7, Pp 57956-57971 (2019)
This paper studies the Ethernet passive optical network (EPON) with limited service. The transmission window (TW) is limited in this system to guarantee a bounded delay experienced by disciplined users and to constrain malicious users from monopolizi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7f5c1017d796de0dc5e5ca7d561dd387
https://ieeexplore.ieee.org/document/8704718/
https://ieeexplore.ieee.org/document/8704718/
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b2071ee2ebb2c0bebca309621cdaa22e
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 29:1456-1468
This paper explores the scheduling problem of input-queued switches, based on a new algebraic method of edge coloring called complex coloring. The proposed scheduling algorithm possesses three important features inherent from complex coloring: parall
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::df51633708bafe3e952263f206dca5ae
https://doi.org/10.1109/tpds.2018.2802523
https://doi.org/10.1109/tpds.2018.2802523