UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Maturing of OpenFlow and Software-defined Networking through deployments

Computer networks (Amsterdam, Netherlands : 1999), 2014-03, Vol.61, p.151-175

2014

Volltextzugriff (PDF)

Analysis of the parallel packet switch architecture

IEEE/ACM transactions on networking, 2003-04, Vol.11 (2), p.314-324

2003

Volltextzugriff (PDF)

Reproducible network experiments using container-based emulation

Proceedings of the 8th international conference on Emerging networking experiments and technologies, 2012, p.253-264

2012

Volltextzugriff (PDF)

Stability Analysis of Explicit Congestion Control Protocols

IEEE communications letters, 2007-10, Vol.11 (10), p.823-825

2007

Volltextzugriff (PDF)

Integrated Photonics for Low-Power Packet Networking

IEEE journal of selected topics in quantum electronics, 2011-03, Vol.17 (2), p.458-471

2011

Volltextzugriff (PDF)

A buffer-based approach to rate adaptation: evidence from a large video streaming service

Proceedings of the 2014 ACM conference on SIGCOMM, 2014, p.187-198

2014

Volltextzugriff (PDF)

The iSLIP scheduling algorithm for input-queued switches

IEEE/ACM transactions on networking, 1999-04, Vol.7 (2), p.188-201

McKeown, N.

1999

Volltextzugriff (PDF)

pFabric: Minimal Near-Optimal Datacenter Transport

Computer communication review, 2013, Vol.43 (4), p.435-446

2013

Volltextzugriff (PDF)

Forwarding Metamorphosis: Fast Programmable Match-Action Processing in Hardware for SDN

Computer communication review, 2013, Vol.43 (4), p.99-110

2013

Volltextzugriff (PDF)

Automatic Test Packet Generation

IEEE/ACM transactions on networking, 2014-04, Vol.22 (2), p.554-566

2014

Volltextzugriff (PDF)

Rethinking IP core networks

Journal of optical communications and networking, 2013-12, Vol.5 (12), p.1431-1442

2013

Volltextzugriff (PDF)

Algorithms for packet classification

IEEE network, 2001-03, Vol.15 (2), p.24-32

2001

Volltextzugriff (PDF)

Enlarging the SIGCOMM tent

Computer communication review, 2013, Vol.44 (1), p.63-65

McKeown, Nick

2013

Volltextzugriff (PDF)

Why OpenFlow/SDN can succeed where GMPLS failed

2012 38th European Conference and Exhibition on Optical Communications, 2012, p.1-3

2012

Volltextzugriff (PDF)

Rethinking Enterprise Network Control

IEEE/ACM transactions on networking, 2009-08, Vol.17 (4), p.1270-1283

2009

Volltextzugriff (PDF)

OSNT: open source network tester

IEEE network, 2014-09, Vol.28 (5), p.6-12

2014

Volltextzugriff (PDF)

The controller placement problem

Proceedings of the first workshop on Hot topics in software defined networks, 2012, p.7-12

2012

Volltextzugriff (PDF)

THE RECON APPROACH: A NEW DIRECTION FOR MACHINE LEARNING IN CRIMINAL LAW

Berkeley technology law journal, 2021-10, Vol.36 (2), p.821

2021

Volltextzugriff (PDF)

A network in a laptop: rapid prototyping for software-defined networks

Proceedings of the 9th ACM SIGCOMM Workshop on Hot Topics in Networks, 2010, p.1-6

2010

Volltextzugriff (PDF)

Achieving 100% throughput in an input-queued switch

IEEE transactions on communications, 1999, Vol.47 (8), p.1260-1267

1999

Volltextzugriff (PDF)

Designing Packet Buffers for Router Linecards

IEEE/ACM transactions on networking, 2008-06, Vol.16 (3), p.705-717

2008

Volltextzugriff (PDF)

The P4->NetFPGA Workflow for Line-Rate Packet Processing

Proceedings of the 2019 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays, 2019, p.1-9

2019

Volltextzugriff (PDF)

A practical scheduling algorithm to achieve 100% throughput in input-queued switches

Annual Joint Conference of the IEEE Computer and Communications Societies, 1998, Vol.2, p.792-799 vol.2

1998

Volltextzugriff (PDF)

Classifying packets with hierarchical intelligent cuttings

IEEE MICRO, 2000-01, Vol.20 (1), p.34-41

2000

Volltextzugriff (PDF)

A Distributed Algorithm to Calculate Max-Min Fair Rates Without Per-Flow State

Proceedings of the ACM on measurement and analysis of computing systems, 2019-06, Vol.3 (2), p.1-42, Article 21

2019

Volltextzugriff (PDF)

1 – 25 von 221

Menü

Weitere Dienste

Einstellungen

Maturing of OpenFlow and Software-defined Networking through deployments

Analysis of the parallel packet switch architecture

Reproducible network experiments using container-based emulation

Stability Analysis of Explicit Congestion Control Protocols

Integrated Photonics for Low-Power Packet Networking

A buffer-based approach to rate adaptation: evidence from a large video streaming service

The iSLIP scheduling algorithm for input-queued switches

pFabric: Minimal Near-Optimal Datacenter Transport

Forwarding Metamorphosis: Fast Programmable Match-Action Processing in Hardware for SDN

Automatic Test Packet Generation

Rethinking IP core networks

Algorithms for packet classification

Enlarging the SIGCOMM tent

Why OpenFlow/SDN can succeed where GMPLS failed

Rethinking Enterprise Network Control

OSNT: open source network tester

The controller placement problem

THE RECON APPROACH: A NEW DIRECTION FOR MACHINE LEARNING IN CRIMINAL LAW

A network in a laptop: rapid prototyping for software-defined networks

Achieving 100% throughput in an input-queued switch

Designing Packet Buffers for Router Linecards

The P4->NetFPGA Workflow for Line-Rate Packet Processing

A practical scheduling algorithm to achieve 100% throughput in input-queued switches

Classifying packets with hierarchical intelligent cuttings

A Distributed Algorithm to Calculate Max-Min Fair Rates Without Per-Flow State

Suchergebnisse filtern