Information theoretic and genie aided analyses of random access algorithms:
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | German |
Veröffentlicht: |
Konstanz
Hartung-Gorre
1998
|
Ausgabe: | 1. Aufl. |
Schriftenreihe: | ETH series in information processing
10 |
Schlagworte: | |
Online-Zugang: | Inhaltsverzeichnis |
Beschreibung: | Zugl.: Zürich, Eidgenössische Techn. Hochsch., Diss., 1998 |
Beschreibung: | VIII, 104 S. |
ISBN: | 3896493779 |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV012329199 | ||
003 | DE-604 | ||
005 | 20150608 | ||
007 | t | ||
008 | 981215s1998 gw m||| 00||| ger d | ||
016 | 7 | |a 955292727 |2 DE-101 | |
020 | |a 3896493779 |c kart. : DM 98.00, sfr 98.00, S 716.00 |9 3-89649-377-9 | ||
035 | |a (OCoLC)42311270 | ||
035 | |a (DE-599)BVBBV012329199 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a ger | |
044 | |a gw |c DE | ||
049 | |a DE-91 | ||
050 | 0 | |a QA274.8 | |
084 | |a ELT 505d |2 stub | ||
084 | |a ELT 619d |2 stub | ||
100 | 1 | |a Loher, Urs |e Verfasser |4 aut | |
245 | 1 | 0 | |a Information theoretic and genie aided analyses of random access algorithms |c Urs Loher |
246 | 1 | 3 | |a Information-theoretic and genie-aided analyses of random-access algorithms |
250 | |a 1. Aufl. | ||
264 | 1 | |a Konstanz |b Hartung-Gorre |c 1998 | |
300 | |a VIII, 104 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a ETH series in information processing |v 10 | |
500 | |a Zugl.: Zürich, Eidgenössische Techn. Hochsch., Diss., 1998 | ||
650 | 4 | |a Mathematisches Modell | |
650 | 4 | |a Mobile communication systems |x Mathematical models | |
650 | 4 | |a Queuing theory | |
650 | 4 | |a Statistical communication theory | |
650 | 4 | |a Stochastic sequences | |
650 | 4 | |a Telecommunication |x Mathematical models | |
650 | 0 | 7 | |a Informationstheorie |0 (DE-588)4026927-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Übertragungskanal |0 (DE-588)4186649-6 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Mehrfachzugriff |0 (DE-588)4251669-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Zugangsverfahren |0 (DE-588)4284316-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Mehrbenutzer-Informationstheorie |0 (DE-588)4114553-7 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Kanalkapazität |0 (DE-588)4538367-4 |2 gnd |9 rswk-swf |
655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
689 | 0 | 0 | |a Übertragungskanal |0 (DE-588)4186649-6 |D s |
689 | 0 | 1 | |a Mehrfachzugriff |0 (DE-588)4251669-9 |D s |
689 | 0 | 2 | |a Kanalkapazität |0 (DE-588)4538367-4 |D s |
689 | 0 | 3 | |a Mehrbenutzer-Informationstheorie |0 (DE-588)4114553-7 |D s |
689 | 0 | |5 DE-604 | |
689 | 1 | 0 | |a Zugangsverfahren |0 (DE-588)4284316-9 |D s |
689 | 1 | 1 | |a Informationstheorie |0 (DE-588)4026927-9 |D s |
689 | 1 | |5 DE-604 | |
830 | 0 | |a ETH series in information processing |v 10 |w (DE-604)BV008309069 |9 10 | |
856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008359886&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-008359886 |
Datensatz im Suchindex
_version_ | 1807505089880915968 |
---|---|
adam_text |
CONTENTS
1
INTRODUCTION
1
2
MODEL
FOR
ALOHA-LIKE
MULTIPLE
ACCESS
CHANNELS
5
2.1
TERMINOLOGY
AND
PRELIMINARIES
.
8
2.1.1
SUMMARY
OF
GENERAL
ASSUMPTIONS
.
15
3
AN
INFORMATION-THEORETIC
APPROACH
TO
RANDOM-ACCESS
ING
SYSTEMS
17
3.1
THE
ROLE
OF
INFORMATION
IN
RANDOM
ACCESSING
.
18
3.1.1
REAL-VALUED
FUNCTIONS
IN
ROOTED
TREES
WITH
PROB
ABILITIES
.
20
3.2
COLLISION-RESOLUTION
TIME
AND
INFORMATION
.
22
3.3
AN
UPPER
BOUND
ON
THE
CAPACITY
OF
RANDOM-ACCESSING
SYSTEMS
BASED
ON
INFORMATION-THEORETIC
ARGUMENTS
.
.
33
3.4
CAN
MIXING
OF
ENABLED
SETS
INCREASE
THE
THROUGHPUT
OF
COLLISION-RESOLUTION
ALGORITHMS?
.
34
3.5
SUMMARY
AND
DISCUSSION
.
38
3.
A
APPENDIX:
OPTIMAL
FIRST-COME
FIRST-SERVED
POLLING
AL
GORITHMS
WITH
A
MAXIMUM
ENABLING
OF
THREE
USERS
.
.
40
4
THE
"
AT
USER
PROBLEM
"
45
4.1
RECURSIVE
STRATEGY
FOR
TWO
USERS
.
46
4.2
RESOLUTION
AMONG
THREE
USERS
.
49
4.2.1
AN
OPTIMAL
ALGORITHM
.
57
4.3
A
LOWER
BOUND
AND
AN
ALGORITHM
FOR
FOUR
USERS
.
59
4.3.1
A
LOWER
BOUND
ON
THE
RESOLUTION
OF
FOUR
COL
LIDED
USERS
.
59
4.3.2
A
DETECTION
ALGORITHM
FOR
FOUR
COLLIDED
USERS
.
62
4.
A
APPENDIX:
PROOF
OF
LEMMAS
.
65
VIII
CONTENTS
5
BINARY
FEEDBACK
67
5.1
RANDOM-ACCESS
COMMUNICATIONS
WITH
SUCCESS/NO
SUC
CESS
FEEDBACK
.
69
5.1.1
INTRODUCTION
.
69
5.1.2
DESCRIPTION
AND
ANALYSIS
OF
THE
CONFLICT
RESOLU
TION
ALGORITHM
.
70
5.2
CONCLUSIONS
.
76
6
EFFICIENCY
OF
FIRST-COME
FIRST-SERVED
ALGORITHMS
77
6.1
INTRODUCTION
.
77
6.2
SOME
DEFINITIONS
AND
PRELIMINARIES
.
78
6.3
CAPACITY
BOUND
FOR
FIRST-COME
FIRST-SERVED
ALGORITHMS:
AN
OPTIMAL
GENIE-AIDED
PROTOCOL
.
79
6.3.1
INTUITIVE
ANALYSIS
.
81
6.3.2
ANALYSIS
OF
THE
GENIE-AIDED
FCFSA
BY
MARKOV
IAN
DECISION
THEORY
WITH
A
REWARD
STRUCTURE
.
.
84
7
MULTIPLICITY
FEEDBACK
91
7.1
ON
A
COMBINATORIAL
PROBLEM
IN
NUMBER
THEORY
.
92
7.2
A
PROTOCOL
ACHIEVING
A
THROUGHPUT
OF
1
.
93
7.2.1
ANALYSIS
OF
THE
STRATEGY
.
95
8
CONCLUDING
REMARKS
97
BIBLIOGRAPHY
99 |
any_adam_object | 1 |
author | Loher, Urs |
author_facet | Loher, Urs |
author_role | aut |
author_sort | Loher, Urs |
author_variant | u l ul |
building | Verbundindex |
bvnumber | BV012329199 |
callnumber-first | Q - Science |
callnumber-label | QA274 |
callnumber-raw | QA274.8 |
callnumber-search | QA274.8 |
callnumber-sort | QA 3274.8 |
callnumber-subject | QA - Mathematics |
classification_tum | ELT 505d ELT 619d |
ctrlnum | (OCoLC)42311270 (DE-599)BVBBV012329199 |
discipline | Elektrotechnik |
edition | 1. Aufl. |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV012329199</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20150608</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">981215s1998 gw m||| 00||| ger d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">955292727</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3896493779</subfield><subfield code="c">kart. : DM 98.00, sfr 98.00, S 716.00</subfield><subfield code="9">3-89649-377-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)42311270</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV012329199</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">ger</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA274.8</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ELT 505d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ELT 619d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Loher, Urs</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Information theoretic and genie aided analyses of random access algorithms</subfield><subfield code="c">Urs Loher</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Information-theoretic and genie-aided analyses of random-access algorithms</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. Aufl.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Konstanz</subfield><subfield code="b">Hartung-Gorre</subfield><subfield code="c">1998</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VIII, 104 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">ETH series in information processing</subfield><subfield code="v">10</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Zürich, Eidgenössische Techn. Hochsch., Diss., 1998</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematisches Modell</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mobile communication systems</subfield><subfield code="x">Mathematical models</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Queuing theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Statistical communication theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Stochastic sequences</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Telecommunication</subfield><subfield code="x">Mathematical models</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Informationstheorie</subfield><subfield code="0">(DE-588)4026927-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Übertragungskanal</subfield><subfield code="0">(DE-588)4186649-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mehrfachzugriff</subfield><subfield code="0">(DE-588)4251669-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Zugangsverfahren</subfield><subfield code="0">(DE-588)4284316-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mehrbenutzer-Informationstheorie</subfield><subfield code="0">(DE-588)4114553-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kanalkapazität</subfield><subfield code="0">(DE-588)4538367-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Übertragungskanal</subfield><subfield code="0">(DE-588)4186649-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Mehrfachzugriff</subfield><subfield code="0">(DE-588)4251669-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Kanalkapazität</subfield><subfield code="0">(DE-588)4538367-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Mehrbenutzer-Informationstheorie</subfield><subfield code="0">(DE-588)4114553-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Zugangsverfahren</subfield><subfield code="0">(DE-588)4284316-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Informationstheorie</subfield><subfield code="0">(DE-588)4026927-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">ETH series in information processing</subfield><subfield code="v">10</subfield><subfield code="w">(DE-604)BV008309069</subfield><subfield code="9">10</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008359886&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-008359886</subfield></datafield></record></collection> |
genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
genre_facet | Hochschulschrift |
id | DE-604.BV012329199 |
illustrated | Not Illustrated |
indexdate | 2024-08-16T01:19:39Z |
institution | BVB |
isbn | 3896493779 |
language | German |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-008359886 |
oclc_num | 42311270 |
open_access_boolean | |
owner | DE-91 DE-BY-TUM |
owner_facet | DE-91 DE-BY-TUM |
physical | VIII, 104 S. |
publishDate | 1998 |
publishDateSearch | 1998 |
publishDateSort | 1998 |
publisher | Hartung-Gorre |
record_format | marc |
series | ETH series in information processing |
series2 | ETH series in information processing |
spelling | Loher, Urs Verfasser aut Information theoretic and genie aided analyses of random access algorithms Urs Loher Information-theoretic and genie-aided analyses of random-access algorithms 1. Aufl. Konstanz Hartung-Gorre 1998 VIII, 104 S. txt rdacontent n rdamedia nc rdacarrier ETH series in information processing 10 Zugl.: Zürich, Eidgenössische Techn. Hochsch., Diss., 1998 Mathematisches Modell Mobile communication systems Mathematical models Queuing theory Statistical communication theory Stochastic sequences Telecommunication Mathematical models Informationstheorie (DE-588)4026927-9 gnd rswk-swf Übertragungskanal (DE-588)4186649-6 gnd rswk-swf Mehrfachzugriff (DE-588)4251669-9 gnd rswk-swf Zugangsverfahren (DE-588)4284316-9 gnd rswk-swf Mehrbenutzer-Informationstheorie (DE-588)4114553-7 gnd rswk-swf Kanalkapazität (DE-588)4538367-4 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Übertragungskanal (DE-588)4186649-6 s Mehrfachzugriff (DE-588)4251669-9 s Kanalkapazität (DE-588)4538367-4 s Mehrbenutzer-Informationstheorie (DE-588)4114553-7 s DE-604 Zugangsverfahren (DE-588)4284316-9 s Informationstheorie (DE-588)4026927-9 s ETH series in information processing 10 (DE-604)BV008309069 10 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008359886&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | Loher, Urs Information theoretic and genie aided analyses of random access algorithms ETH series in information processing Mathematisches Modell Mobile communication systems Mathematical models Queuing theory Statistical communication theory Stochastic sequences Telecommunication Mathematical models Informationstheorie (DE-588)4026927-9 gnd Übertragungskanal (DE-588)4186649-6 gnd Mehrfachzugriff (DE-588)4251669-9 gnd Zugangsverfahren (DE-588)4284316-9 gnd Mehrbenutzer-Informationstheorie (DE-588)4114553-7 gnd Kanalkapazität (DE-588)4538367-4 gnd |
subject_GND | (DE-588)4026927-9 (DE-588)4186649-6 (DE-588)4251669-9 (DE-588)4284316-9 (DE-588)4114553-7 (DE-588)4538367-4 (DE-588)4113937-9 |
title | Information theoretic and genie aided analyses of random access algorithms |
title_alt | Information-theoretic and genie-aided analyses of random-access algorithms |
title_auth | Information theoretic and genie aided analyses of random access algorithms |
title_exact_search | Information theoretic and genie aided analyses of random access algorithms |
title_full | Information theoretic and genie aided analyses of random access algorithms Urs Loher |
title_fullStr | Information theoretic and genie aided analyses of random access algorithms Urs Loher |
title_full_unstemmed | Information theoretic and genie aided analyses of random access algorithms Urs Loher |
title_short | Information theoretic and genie aided analyses of random access algorithms |
title_sort | information theoretic and genie aided analyses of random access algorithms |
topic | Mathematisches Modell Mobile communication systems Mathematical models Queuing theory Statistical communication theory Stochastic sequences Telecommunication Mathematical models Informationstheorie (DE-588)4026927-9 gnd Übertragungskanal (DE-588)4186649-6 gnd Mehrfachzugriff (DE-588)4251669-9 gnd Zugangsverfahren (DE-588)4284316-9 gnd Mehrbenutzer-Informationstheorie (DE-588)4114553-7 gnd Kanalkapazität (DE-588)4538367-4 gnd |
topic_facet | Mathematisches Modell Mobile communication systems Mathematical models Queuing theory Statistical communication theory Stochastic sequences Telecommunication Mathematical models Informationstheorie Übertragungskanal Mehrfachzugriff Zugangsverfahren Mehrbenutzer-Informationstheorie Kanalkapazität Hochschulschrift |
url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008359886&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
volume_link | (DE-604)BV008309069 |
work_keys_str_mv | AT loherurs informationtheoreticandgenieaidedanalysesofrandomaccessalgorithms |