linux - Windows client connecting to UCS / Samba server - The join operation was not successful -


using univention corporate server ucs, have following linux distribution:

root@ucs:~# cat /etc/*-release distrib_id=univention distrib_release="4.2-2 errata159" distrib_codename=lesum  distrib_description="univention corporate server 4.2-2 errata159 (lesum)" pretty_name="debian gnu/linux 8 (jessie)" name="debian gnu/linux" version_id="8" version="8 (jessie)" id=debian home_url="http://www.debian.org/" support_url="http://www.debian.org/support" bug_report_url="https://bugs.debian.org/"

and following samba version:

root@ucs:~# samba -v version 4.6.1-debian

on linux machine have configured package:

active directory-compatible domain controller

i configured 1 user there: myuser under group: domain users.

my problem is, when trying connect local domain defined there: mydomain.intranet

i error:

the join operation not successful. because existing computer account having name "myuser-pc" created using different set of credentials. use different computer name, or contact administrator remove stale conflicting account. error was:  access denied

as can see on following image:

enter image description here

any idea on how troubleshoot this?

thanks.

greetings univention,

this might not best site ask solutions these kind of problems, jeff mention.

we invite univention help lot of experienced community members , our staff love you.

beside that, did try join domain myuser user? won't work user doesn't have proper rights add machines domain. have tried user administrator shown in this image?

you want make sure, there isn't machine name dell-insipron existent in domain, assume won't case.


Comments

Post a Comment

Popular posts from this blog

Sort a complex associative array in PHP -

this question has answer here: php sort array subarray value 5 answers i have associative array in php like: $newarray1 = array ( [producta] => array ( [link] => http://sanjosespartan.com/blog/products/agile-java-development/ [visitcount] => 4 ) [productd] => array ( [link] => http://sanjosespartan.com/blog/products/intro-to-go/ [visitcount] => 1 ) [productg] => array ( [link] => http://sanjosespartan.com/blog/products/node-js-for-developers/ [visitcount] => 1 ) [productb] => array ( [link] => http://sanjosespartan.com/blog/products/beginning-mysql/ [visitcount] => 1 ) [productc] => array ( [link] => http://sanjosespartan.com/blog/products/computer-networks/ [visitcount] => 1 ) ...
Read more

vb.net - How to ignore if a cell is empty nothing -

how use roscolor() ignore value (like empty cell) ? color row if value upper 5 when there nothing in cell, want ignore roscolor() apply, how? public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val integer val = quotedatagridview1.rows(i).cells(3).value if val = vbempty quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white elseif val < 5 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.red elseif val > 5 , val < 10 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.lightyellow end if next end sub you can check empty value following public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val = quotedatagridview1.rows(i).cells(3).value if isdbnull(val) or val nothing quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white ...
Read more

recursion - Can every recursive algorithm be improved with dynamic programming? -

i first year undergraduate csc student looking competitive programming. recursion involves defining , solving sub problems. understand, top down dynamic programming (dp) involves memoizing solutions sub problems reduce time complexity of algorithm. can top down dp used improve efficiency of every recursive algorithm overlapping sub problems? dp fail work , how can identify this? the short answer is: yes. however, there constraints. obvious 1 recursive calls must overlap. i.e. during execution of algorithm, recursive function must called multiple times same parameters. lets truncate recursion tree memoization. can use memoization reduce number of calls. however, reduction of calls comes price. need store results somewhere. next obvious constraint need have enough memory. comes not-so obvious constraint. memory access requires time. first need find result stored , maybe copy location. in cases, might faster let recursion calculate result instead of loading somewher...
Read more