![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Ken'ichi Kawanishi
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j14]Mitsuki Sato, Kohei Kawamura, Ken'ichi Kawanishi
, Tuan Phung-Duc:
Modeling and performance analysis of hybrid systems by queues with setup time. Perform. Evaluation 162: 102366 (2023) - 2022
- [j13]Tuan Phung-Duc
, Kohei Akutsu, Ken'ichi Kawanishi, Osama I. Salameh, Sabine Wittevrongel:
Queueing models for cognitive wireless networks with sensing time of secondary users. Ann. Oper. Res. 310(2): 641-660 (2022) - 2021
- [c10]Mitsuki Sato, Kohei Kawamura, Ken'ichi Kawanishi, Tuan Phung-Duc
:
Performance Models of NFV-Based Hybrid Systems for Delay-Sensitive Services. EPEW 2021: 181-196 - 2020
- [j12]Tuan Phung-Duc
, Ken'ichi Kawanishi
:
Delay performance of data-center queue with setup policy and abandonment. Ann. Oper. Res. 293(1): 269-293 (2020)
2010 – 2019
- 2019
- [j11]Ken'ichi Kawanishi, Tetsuya Takine:
The M/PH/1+D queue with Markov-renewal service interruptions and its application to delayed mobile data offloading. Perform. Evaluation 134 (2019) - 2016
- [j10]Ken'ichi Kawanishi, Tetsuya Takine:
MAP/M/c and M/PH/c queues with constant impatience times. Queueing Syst. Theory Appl. 82(3-4): 381-420 (2016) - [c9]Tuan Phung-Duc
, Ken'ichi Kawanishi:
Energy-Aware Data Centers with s-Staggered Setup and Abandonment. ASMTA 2016: 269-283 - [c8]Tuan Phung-Duc, Ken'ichi Kawanishi:
Impacts of Retrials on Power-Saving Policy in Data Centers. QTNA 2016: 22 - 2015
- [j9]Ken'ichi Kawanishi, Tetsuya Takine:
A note on the virtual waiting time in the stationary PH/M/c+D queue. J. Appl. Probab. 52(3): 899-903 (2015) - 2014
- [j8]Tuan Phung-Duc
, Ken'ichi Kawanishi:
An Efficient Method for Performance Analysis of Blended Call Centers with redial. Asia Pac. J. Oper. Res. 31(2) (2014) - [j7]Tuan Phung-Duc
, Ken'ichi Kawanishi:
Performance analysis of call centers with abandonment, retrial and after-call work. Perform. Evaluation 80: 43-62 (2014) - 2012
- [c7]Bin Han, Ken'ichi Kawanishi:
Using game theory to investigate stochastic channel selection for multi-channel MAC protocol. ICCS 2012: 172-176 - 2011
- [j6]Bin Han, Ken'ichi Kawanishi:
Conditionally Randomized Channel Selection Algorithm for Multi-Channel MAC Protocol in Ad Hoc Networks. IEICE Trans. Commun. 94-B(4): 940-950 (2011) - 2010
- [j5]Li Wang, Ken'ichi Kawanishi:
Performance of MPEG-4 Transmission over SCTP Multi-Streaming in Wireless Networks. IEICE Trans. Commun. 93-B(9): 2336-2347 (2010) - [c6]Yutaka Sakuma, Atsushi Inoie, Ken'ichi Kawanishi, Masakiyo Miyazawa:
Tail asymptotics for waiting time distribution of an M/M/s queue with general impatient time. QTNA 2010: 140-147
2000 – 2009
- 2009
- [c5]Li Wang, Ken'ichi Kawanishi, Yoshikuni Onozato:
Achieving robust fairness of SCTP extension for MPEG-4 streaming. PIMRC 2009: 2970-2974 - 2008
- [j4]Ken'ichi Kawanishi:
QBD approximations of a call center queueing model with general patience distribution. Comput. Oper. Res. 35(8): 2463-2481 (2008) - 2007
- [c4]Li Wang, Ken'ichi Kawanishi, Yoshikuni Onozato:
Simulation-Based Optimization on MPEG-4 over SCTP Multi-streaming with Differentiated Retransmission Policy in Lossy Link. APSCC 2007: 164-171 - 2006
- [j3]Ken'ichi Kawanishi:
Waiting time distribution of a queueing system with postservice activity. Comput. Math. Appl. 51(2): 209-218 (2006) - [j2]Rujipun Assarut, Ken'ichi Kawanishi, Ushio Yamamoto, Yoshikuni Onozato:
Region Division Assignment: A New OVSF Code Reservation and Assignment Scheme for Downlink Capacity in W-CDMA Systems. Wirel. Networks 12(3): 357-368 (2006) - 2005
- [j1]Ken'ichi Kawanishi:
On the Counting Process for a Class of Markovian Arrival Processes with an Application to a Queueing System. Queueing Syst. Theory Appl. 49(2): 93-122 (2005) - 2002
- [c3]Sakchai Thipchaksurat, Ken'ichi Kawanishi, Ushio Yamamoto, Yoshikuni Onozato:
Impact of mobility on blocking in one-dimensional cellular networks with new call channel limiting scheme. GLOBECOM 2002: 1663-1667 - [c2]Rujipun Assarut, Ken'ichi Kawanishi, Rajkumar Deshpande
, Ushio Yamamoto, Yoshikuni Onozato:
Performance evaluation of orthogonal variable-spreading-factor code assignment schemes in W-CDMA. ICC 2002: 3050-3054 - 2001
- [c1]Rujipun Assarut, Ken'ichi Kawanishi, Ushio Yamamoto, Yoshikuni Onozato, Masahiko Matsushita:
Region division assignment of orthogonal variable-spreading-factor codes in W-CDMA. VTC Fall 2001: 1884-1888
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint