Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Shai Herzog

dblp:18/3067 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 1997
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 2 first-authorArtificial intelligence and machine learning · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
2 papers
Network optimization and economics · 89% Routing and switching · 11%
Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network optimization and economics
cost sharing
0.021997
Sharing the "cost" of multicast trees: an axiomatic analysis · IEEE/ACM Trans. Netw. 1997
Sharing the "Cost" of Multicast Trees: An Axiomatic Analysis · SIGCOMM 1995
Network optimization and economics › cost sharing
multicast cost sharing
0.021997
Sharing the "cost" of multicast trees: an axiomatic analysis · IEEE/ACM Trans. Netw. 1997
Sharing the "Cost" of Multicast Trees: An Axiomatic Analysis · SIGCOMM 1995
Algorithmic game theory and mechanism design › social choice › computational social choice
axiomatic analysis
0.011997
Sharing the "cost" of multicast trees: an axiomatic analysis · IEEE/ACM Trans. Netw. 1997
Network optimization and economics
mechanism design
0.011995
Sharing the "Cost" of Multicast Trees: An Axiomatic Analysis · SIGCOMM 1995
Routing and switching
multicast routing
0.021997
Sharing the "cost" of multicast trees: an axiomatic analysis · IEEE/ACM Trans. Netw. 1997
Sharing the "Cost" of Multicast Trees: An Axiomatic Analysis · SIGCOMM 1995

Methods — techniques the papers use, named apart from their topics

axiomatic analysis · 0.1one-pass mechanism · 0.0
YearPublicationVenuePosition
1997 Sharing the "cost" of multicast trees: an axiomatic analysis
abstract
Given the need to provide users with reasonable feedback about the "costs" their network usage incurs and the increasingly commercial nature of the Internet, we believe that the allocation of cost among users will play an important role in future networks. This paper discusses cost allocation in the context of multicast flows. The question we discuss is this. When a single data flow is shared among many receivers, how does one split the cost of that flow among the receivers? Multicast routing increases network efficiency by using a single shared delivery tree. We address the issue of how these savings are allocated among the various members of the multicast group. We first consider an axiomatic approach to the problem, analyzing the implications of different distributive notions on the resulting allocations. We then consider a "one-pass" mechanism to implement such allocation schemes and investigate the family of allocation schemes such mechanisms can support.
Shai Herzog, Scott Shenker, Deborah Estrin
IEEE/ACM Trans. Netw.1
1995 Sharing the "Cost" of Multicast Trees: An Axiomatic Analysis
abstract
Given the need to provide users with reasonable feedback about the "costs" their network usage incurs, and the increasingly commercial nature of the Internet, we believe that the allocation of cost among users will play an important role in future networks. This paper discusses cost allocation in the context of multicast flows. The question we discuss is this: when a single data flow is shared among many receivers, how does one split the cost of that flow among the receivers? Multicast routing increases network efficiency by using a single shared delivery tree. We address the issue of how these savings are allocated among the various members of the multicast group. We first consider an axiomatic approach to the problem, analyzing the implications of different distributive notions on the resulting allocations. We then consider a one-pass mechanism to implement such allocation schemes and investigate the family of allocation schemes such mechanisms can support.
Shai Herzog, Scott Shenker, Deborah Estrin
SIGCOMM1
1993 The Use of Meta-Rules in Rule Based Legal Computer Systems
abstract
Rule-Based Systems in the legal domain are often obtained by formalizing legislation. We consider the addition of meta-knowledge in the form of meta-rules to such a system. Such an approach has many advantages both for control and for dealing with the intrinsic vagueness of legal rules. Legal computer systems of different kinds have been proposed and built over the years. In this paper we shall present a legal reasoning system which uses concepts discussed in this paper. The system consists of a knowledge base, obtained by formalizing legislation, and uses a meta-rules mechanism for deduction and legal reasoning.
Uri J. Schild, Shai Herzog
ICAIL2