Implementation and Evaluation of Activity-Based Congestion Management Using P4 (P4-ABC)
نویسندگان
چکیده
منابع مشابه
P4: Self-Management and Talent Management
Self-management has been a point of discussion among number of researchers. The teacher can manage discipline in the class by employing self-management strategies. Furthermore, it can also help students in managing their behaviors for long periods of time. Organizations need people who are more willing to work and adhere to the requirements on their own. They must understand how they can make b...
متن کاملp4: self-management and talent management
self-management has been a point of discussion among number of researchers. the teacher can manage discipline in the class by employing self-management strategies. furthermore, it can also help students in managing their behaviors for long periods of time. organizations need people who are more willing to work and adhere to the requirements on their own. they must understand how they can make b...
متن کاملP4-Linda: A Portable Implementation of Linda
Facilities such as interprocess communication and protection of shared resources have been added to operating systems to support multiprogramming and have since been adapted to exploit explicit multiprocessing within the scope of two models: the shared-memory model and the distributed (message-passing) model. When multiprocessors (or networks of heterogeneous processors) are used for explicit p...
متن کاملLaplacian integrality in P4-sparse and P4-extendible graphs
Let G be a simple graph and L = L(G) the Laplacian matrix of G. G is called L-integral if all its Laplacian eigenvalues are integer numbers. It is known that every cograph, a graph free of P4, is L-integral. The class of P4-sparse graphs and the class of P4-extendible graphs contain the cographs. It seems natural to investigate if the graphs in these classes are still L-integral. In this paper ...
متن کاملExtremal P4-stable graphs
Call a graph G k-stable (with respect to some graph H) if, deleting any k edges of G, the remaining graph still contains H as a subgraph. For a fixed H, the minimum number of edges in a k-stable graph is denoted by S(k). We prove general bounds on S(k) and compute the exact value of the function S(k) for H = P4. The main result can be applied to extremal k-edge-hamiltonian hypergraphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Future Internet
سال: 2019
ISSN: 1999-5903
DOI: 10.3390/fi11070159