Remote MIB-item look-up service

Despite some deficiencies, the Internet management framework is widely deployed and thousands of management information base (MIB) modules have been defined thus far. These modules are used by implementers of agent software, as well as by managers and management applications, to understand the syntax and semantics of the management information that may be exchanged. At the manager's side, MIB modules are usually stored in separate files, which are maintained by the human manager and read by the management application. Since maintenance of this file repository can be cumbersome, management applications are often confronted with incomplete and outdated information. To solve this "meta-management" problem, this paper discusses the design of a remote look-up service for MIB-item definitions. Such a service facilitates the retrieval of missing MIB module definitions, as well as definitions of individual MIB-items. Initially the service may be provided by a single server, but other servers can be added at later stages to improve performance and prevent copyright problems. It is envisaged that vendors of network equipment will also install servers, to distribute their vendor specific MIB. The paper describes how the service, which is provided on a best effort basis, can be accessed by managers/management applications, and how servers inform each other about the MIB modules they support

Policy-based network management with SNMP

This paper presents a way of managing configuration of network elements via a set of high-level rules or business policies rather than managing device by device. First, there is a need for abstraction of the capabilities of the individual devices, thus switching the control to network level. The benefit is that we can specify and issue unique management rules (or commands) that can be applied to a cross-section of network devices. Second, a way to manipulate (create, install, monitor, modify, revoke) the policy rules across the network is needed. The IETF SNMPConf (Configuration Management with SNMP [3]) working group explores how the Internet Standard Management Framework SNMP can be used for policy-based configuration management. The material presented in this paper is heavily based on the work of this group

Production mechanisms and single-spin asymmetry for kaons in high energy hadron-hadron collisions

Direct consequences on kaon production of the picture proposed in a recent Letter and subsequent publications are discussed. Further evidence supporting the proposed picture is obtained. Comparison with the data for the inclusive cross sections in unpolarized reactions is made. Quantitative results for the left-right asymmetry in single-spin processes are presented.Comment: 10 pages, 2 Postscript figure

Precise Determination of Electroweak Parameters in Neutrino-Nucleon Scattering

A systematic error in the extraction of $\sin^2 \theta_W$ from nuclear deep inelastic scattering of neutrinos and antineutrinos arises from higher-twist effects arising from nuclear shadowing. We explain that these effects cause a correction to the results of the recently reported significant deviation from the Standard Model that is potentially as large as the deviation claimed, and of a sign that cannot be determined without an extremely careful study of the data set used to model the input parton distribution functions.Comment: 3pages, 0 figures, version to be published by IJMP

Upper and Lower Bounds for Weak Backdoor Set Detection

We obtain upper and lower bounds for running times of exponential time algorithms for the detection of weak backdoor sets of 3CNF formulas, considering various base classes. These results include (omitting polynomial factors), (i) a 4.54^k algorithm to detect whether there is a weak backdoor set of at most k variables into the class of Horn formulas; (ii) a 2.27^k algorithm to detect whether there is a weak backdoor set of at most k variables into the class of Krom formulas. These bounds improve an earlier known bound of 6^k. We also prove a 2^k lower bound for these problems, subject to the Strong Exponential Time Hypothesis.Comment: A short version will appear in the proceedings of the 16th International Conference on Theory and Applications of Satisfiability Testin