Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Ferdinand Gramsamer"'
Autor:
Ronald P. Luijten, Ton Engbersen, Mitchell Gusat, Cyriel Minkenberg, Ferdinand Gramsamer, Francois Abel, Ilias Iliadis
Publikováno v:
IEEE/ACM Transactions on Networking. 15:1603-1615
Packet-switch fabrics with widely varying characteristics are currently deployed in the domains of both communications and computer interconnection networks. For economical reasons, it would be highly desirable that a single switch fabric could accom
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ffabb6180e07378e2fcd1ee0f8f27b76
https://doi.org/10.1109/tnet.2007.909727
https://doi.org/10.1109/tnet.2007.909727
Autor:
Mark Verhappen, Mitchell Gusat, Francois Abel, Ferdinand Gramsamer, Cyriel Minkenberg, Ronald P. Luijten
Publikováno v:
Microprocessors and Microsystems. 27:243-252
We answer the question on how much memory a packet switch/router needs; more specifically, we propose a systematic method that is simple, rigorous and general for determining the absolute lower bound of packet buffering required by practical switchin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0400b2fedd07d95c8c7265561944ae10
https://doi.org/10.1016/s0141-9331(03)00025-5
https://doi.org/10.1016/s0141-9331(03)00025-5
Publikováno v:
Microprocessors and Microsystems. 27:233-241
We address a problem associated with credit flow control (FC) schemes for buffered switches, namely, the issue of FC bandwidth and FC optimization, i.e. how many and which credits to return per packet cycle. Using simulations, we show that, under the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e8bc6c9cd1c763d18ac27ffa2cd7fe0d
https://doi.org/10.1016/s0141-9331(03)00024-3
https://doi.org/10.1016/s0141-9331(03)00024-3
Autor:
Mitchell Gusat, Ferdinand Gramsamer, Ronald P. Luijten, Francois Abel, Cyriel Minkenberg, Mark Verhappen
Publikováno v:
ICCCN
We propose a systematic method to determine the lower bound for internal buffering of practical CIOQ (combined input-output queued) switching systems. We introduce a deterministic traffic scenario that stresses the global stability of finite output q
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e05944d7ee0276a208530ebd96ec368e
https://doi.org/10.1109/icccn.2002.1043104
https://doi.org/10.1109/icccn.2002.1043104
Publikováno v:
ICCCN
We address a problem often neglected in the presentation of credit flow control (FC) schemes for buffered switches, namely the issue of FC bandwidth and FC optimization, i.e. how many and which credits to return per packet cycle. Under the assumption
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ada47627f2396f3654cec7dad53a6d75
https://doi.org/10.1109/icccn.2002.1043103
https://doi.org/10.1109/icccn.2002.1043103