Zobrazeno 1 - 10
of 362
pro vyhledávání: '"Sugih Jamin"'
Publikováno v:
IEEE Access, Vol 6, Pp 11046-11062 (2018)
In this paper, we study a new class of single-iteration scheduling algorithms for inputqueued switches based on a new arbitration idea called highest rank first (HRF). We first demonstrate the effectiveness of HRF by a simple algorithm named Basic-HR
Externí odkaz:
https://doaj.org/article/39a57f31ea2f484b8b90b2f11087ecec
Publikováno v:
Journal of Communications Software and Systems, Vol 7, Iss 3, Pp 93-103 (2011)
Television transmitted over IP (IPTV) presents numerousopportunities for users as well as service providers, and has attracted significant interest from industry as well asresearch communities in recent years. Among the emergingIPTV delivery architec
Externí odkaz:
https://doaj.org/article/ccb81e59633a467da854d2a391692d4f
Publikováno v:
IEEE/ACM Transactions on Networking. 26:2748-2761
In Internet mapping, IP address space is divided into a set of client aggregation units, which are the finest-grained units for global load balancing. Choosing the proper level of aggregation is a complex problem, which determines the number of aggre
Publikováno v:
IEEE Access, Vol 6, Pp 11046-11062 (2018)
In this paper, we study a new class of single-iteration scheduling algorithms for input-queued switches based on a new arbitration idea called highest rank first (HRF). We first demonstrate the effectiveness of HRF by a simple algorithm named Basic-H
Publikováno v:
SIGMETRICS (Abstracts)
Load balancers choose among load-balanced paths to distribute traffic as if it makes no difference using one path or another. This work shows that the latency difference between load-balanced paths (called latency imbalance), previously deemed insign
Publikováno v:
ICC
In routerless network-on-chip (NoC), any pair of cores are directly connected via at least one isolated ring, such that high-cost routers can be entirely abandoned. In this paper, we focus on the problem of designing a set of rings that guarantee the
Publikováno v:
LCN
Literature on coflow-aware packet scheduling for input-queued switches is limited. Yet most of them are offline algorithms, requiring (unrealistic) a priori knowledge of all coflows and solving (time-consuming) linear programming (LP) problems for de
Publikováno v:
HPSR
We consider scheduling mixed unicast and multicast traffic with variable-size packets in an input-queued switch. When variable-size packets arrive at a switch input port, they will be segmented into cells (fixed-size packets), sent across the switch
Publikováno v:
HPSR
We consider an $N\times N$ input-queued switch with $N$ dedicated unicast virtual output queues (VOQs) and one shared multicast queue (MQ) at each input port. An efficient two-bit single-iteration (2BSI) scheduling algorithm is proposed to concurrent
Publikováno v:
GLOBECOM
We focus on designing efficient integrated schedulers for handling mixed unicast and multicast traffic. We consider an input-queued switch with a multicast-capable switch fabric. At each input port of the switch, there are N dedicated unicast VOQs an