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

Seiji Ueno

dblp:97/2151 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2001
—ORCID · none

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

Computer networks · 2 · 1 first-author

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
Routing and switching · 88% Internet architecture and protocols · 12%

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

TopicWeightPapersLastEvidence papers
Routing and switching
multicast routing
0.122001
Making QoS Aware Multicast Scalable in Terms of Link State Advertisement · ICNP 2001
Analysis of Internet Multicast Traffic Performance Considering Multicast Routing Protocol · ICNP 2000
Routing and switching › multicast routing
qos multicast routing
0.012001
Making QoS Aware Multicast Scalable in Terms of Link State Advertisement · ICNP 2001
Routing and switching › routing protocol
routing protocol evaluation
0.012000
Analysis of Internet Multicast Traffic Performance Considering Multicast Routing Protocol · ICNP 2000
Internet architecture and protocols
multicast
0.022001
Making QoS Aware Multicast Scalable in Terms of Link State Advertisement · ICNP 2001
Analysis of Internet Multicast Traffic Performance Considering Multicast Routing Protocol · ICNP 2000
Routing and switching › qos routing
qos multicast
0.012001
Making QoS Aware Multicast Scalable in Terms of Link State Advertisement · ICNP 2001

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

simulation · 0.0statistical analysis · 0.0packet capture · 0.0
YearPublicationVenuePosition
2001 Making QoS Aware Multicast Scalable in Terms of Link State Advertisement
abstract
Recently routing protocols for QoS aware multicast have been actively studied, but there are few studies focusing on the scalability of link state advertisement when the available bandwidth of a link is updated along with the QoS aware multicast tree construction. This paper proposes a new QoS aware multicast routing protocol that is scalable in terms of the link state advertisement exchange. Our protocol has the following features: (1) a multicast network is divided into domains, and the advertisement of information on links within a domain is limited within the domain; (2) among the border multicast routers, only the link state information of interdomain links is advertised, so that the number of link state advertisement messages is drastically reduced; (3) when a multicast tree spreads over multiple domains, the tree construction needs to be performed without information on links in other domains, and it is possible that the construction may fail. In order to cope with this problem, the crank back mechanism of tree construction is introduced. This paper describes the detailed procedures and the message formats of our protocol. It also describes the evaluation of the number of exchanged link state advertisement messages and shows that our protocol can reduce the number by the order of 1/(number of domains) compared with conventional protocols.
Toshihiko Kato, Seiji Ueno, Shigeki Mukaiyama, Kenji Suzuki 0003
ICNP2
2000 Analysis of Internet Multicast Traffic Performance Considering Multicast Routing Protocol
abstract
Recently audio and video delivery services are widely spread in the Internet. In order to deliver these data to multiple receivers at the same time, the multicast technologies are indispensable. In such a situation, the performance analysis of multicast traffic will be important in order to design and operate the Internet. Multicast traffic is controlled by its own routing protocol and the multicast routing protocol is more complex than conventional unicast routing protocols. In this paper we propose a new multicast performance analyzer considering distance vector multicast routing protocol (DVMRP) and protocol independent multicast-sparse mode (PIM-SM) routing protocols. It captures messages of a multicast routing protocol as well as multicast IP datagrams. It also analyzes DVMRP and PIM-SM messages in order to investigate the behaviors of multicast IP datagrams and measures the statistics of multicast traffic in detail. This paper describes the detailed design of the multicast performance analyzer and the results of analyzing multicast datagrams transmitted over networks.
Seiji Ueno, Toshihiko Kato, Kenji Suzuki 0003
ICNP1