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

Koichiro Kitajima

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

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

Computer networks · 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
1 paper
Internet architecture and protocols · 61% Network performance modeling · 30% Transport protocols and congestion control · 9%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols
ATM networks
0.011997
Packet Loss Performance of Selective Cell Discard Schemes in ATM Switches · IEEE J. Sel. Areas Commun. 1997
Network performance modeling
packet loss
0.011997
Packet Loss Performance of Selective Cell Discard Schemes in ATM Switches · IEEE J. Sel. Areas Commun. 1997
Internet architecture and protocols › ATM networks
selective cell discard
0.011997
Packet Loss Performance of Selective Cell Discard Schemes in ATM Switches · IEEE J. Sel. Areas Commun. 1997
Transport protocols and congestion control › TCP
TCP over ATM
0.011997
Packet Loss Performance of Selective Cell Discard Schemes in ATM Switches · IEEE J. Sel. Areas Commun. 1997

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

packet loss probability analysis · 0.0analytical modeling · 0.0
YearPublicationVenuePosition
1997 Packet Loss Performance of Selective Cell Discard Schemes in ATM Switches
abstract
In transport-layer protocols such as TCP over ATM networks, a packet is discarded when one or more cells of that packet are lost, and the destination node then requires its source to retransmit the corrupted packet. Therefore, once one of the cells constituting a packet is lost, its subsequent cells of the corrupted packet waste network resources. Thus, discarding those cells will enable us to efficiently utilize network resources, and will improve the packet loss probability. We focus on tail dropping (TD) and early packet discard (EPD) as selective cell discard schemes which enforce the switches to discard some of the arriving cells instead of relaying them. We exactly analyze the packet loss probability in a system applying these schemes. Their advantages and limits are then discussed based on numerical results derived through the analysis.
Kenji Kawahara, Koichiro Kitajima, Tetsuya Takine, Yuji Oie
IEEE J. Sel. Areas Commun.2